activity
20102026
most citedThe Straight-Line RAC Drawing Problem is NP-Hard

21 citations · 92 across the 45 of their papers we have counts for

collaborators
Showing 2020Show all

7 papers · 1 filter

cs.DM2020

On Mixed Linear Layouts of Series-Parallel Graphs

Patrizio Angelini, Michael A. Bekos, Philipp Kindermann +1

A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same…

cs.DS2020

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…

cs.CG2020

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…

cs.DS2020

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…

cs.DS2020★ 1 cited

Four Pages Are Indeed Necessary for Planar Graphs

Michael A. Bekos, Michael Kaufmann, Fabian Klute +3

An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two…

cs.DM2020★ 1 cited

An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs

Michael A. Bekos, Mirco Haug, Michael Kaufmann +1

We present a prototype online system to automate the procedure of computing different types of linear layouts of graphs under different user-specific constraints. Currently, four d…

cs.CG2020

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…