9 citations · 16 across the 13 of their papers we have counts for
5 papers · 1 filter
Lazy Queue Layouts of Posets
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2
We investigate the queue number of posets in terms of their width, that is, the maximum number of pairwise incomparable elements. A long-standing conjecture of Heath and Pemmaraju…
On Turn-Regular Orthogonal Representations
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista +5
An interesting class of orthogonal representations consists of the so-called turn-regular ones, i.e., those that do not contain any pair of reflex corners that "point to each other…
Drawing Shortest Paths in Geodetic Graphs
Sabine Cornelsen, Maximilian Pfister, Henry Förster +4
Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph , i.e.,…
Grid Drawings of Graphs with Constant Edge-Vertex Resolution
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +3
We study the algorithmic problem of computing drawings of graphs in which each vertex is a disk with fixed radius , each edge is a straight-line segment connecting…
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages
Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach +3
An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of t…