35 citations · 100 across the 23 of their papers we have counts for
5 papers · 1 filter
Simultaneous Orthogonal Planarity
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +7
We introduce and study the problem: Given planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there…
Planar Embeddings with Small and Uniform Faces
Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl +1
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-gra…
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
Steven Chaplick, Vít Jelínek, Jan Kratochvíl +1
In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs repres…
Non-crossing Connectors in the Plane
Jan Kratochvíl, Torsten Ueckerdt
We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R_1,...,R_n in the plane and finite point sets P_i subset of R_i for i…
Moving Vertices to Make Drawings Plane
Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto +2
A straight-line drawing of a planar graph need not be plane, but can be made so by moving some of the vertices. Let shift denote the minimum number of vertices that…