activity
20142023
most citedMulti-Level Steiner Trees

9 citations · 16 across the 13 of their papers we have counts for

collaborators
Showing cs.CGShow all

5 papers · 1 filter

cs.CG2023

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…

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.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.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…