2 citations · 3 across the 5 of their papers we have counts for
5 papers
Splitting Plane Graphs to Outerplanarity
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu
Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired…
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…
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…
Bitonic st-orderings for Upward Planar Graphs
Martin Gronemann
Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. Whi…
Planar Octilinear Drawings with One Bend Per Edge
Michael A. Bekos, Martin Gronemann, Michael Kaufmann +1
In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal () line-segments. In this paper, we study oct…