Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...

Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively. We prove a complexity dichotomy for MINMAXFACE and show that deciding whether the maximum is at most k is...

We study embeddings of continuous dynamical systems in larger dimensions via projector operators. call this technique PEDS, projective embedding systems, as the stable fixed point dynamics are recovered projection from higher dimensional space. In paper we provide a general definition and prove that for particular type operator rank-1, uniform mean field projector, equations motion become appro...

Automatic voice pathology detection systems are receiving an increasingly growing interest due to the their advantages compared to traditional systems (non invasiveness, objectivity and reduction in time and cost analysis). In this respect, the complexity analysis has been also introduced within the automatic detection framework for providing more reliability and higher system performance. Howe...