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 2022Show all

7 papers · 1 filter

cs.DS2022★ 1 cited

The Rique-Number of Graphs

Michael A. Bekos, Stefan Felsner, Philipp Kindermann +3

We continue the study of linear layouts of graphs in relation to known data structures. At a high level, given a data structure, the goal is to find a linear order of the vertices…

cs.CG2022

Strictly-Convex Drawings of -Connected Planar Graphs

Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +1

Strictly-convex straight-line drawings of -connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such…

cs.CG2022★ 1 cited

Recognizing DAGs with Page-Number 2 is NP-complete

Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati +3

The page-number of a directed acyclic graph (a DAG, for short) is the minimum for which the DAG has a topological order and a -coloring of its edges such that no two edges o…

cs.CG2022

RAC Drawings of Graphs with Low Degree

Patrizio Angelini, Michael A. Bekos, Julia Katheder +2

Motivated by cognitive experiments providing evidence that large crossing-angles do not impair the readability of a graph drawing, RAC (Right Angle Crossing) drawings were introduc…

cs.DS2022

Recognizing Map Graphs of Bounded Treewidth

Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo +3

A map graph is a graph admitting a representation in which vertices are nations on a spherical map and edges are shared curve segments or points between nations. We present an expl…

cs.DS2022

Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution

Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +1

We continue the study of the area requirement of convex straight-line grid drawings of 3-connected plane graphs, which has been intensively investigated in the last decades. Motiva…

cs.DS2022

Graph Product Structure for h-Framed Graphs

Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný +1

Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding struc…