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

5 papers · 1 filter

cs.DS2019

Coloring outerplanar graphs and planar 3-trees with small monochromatic components

Michael A. Bekos, Carla Binucci, Michael Kaufmann +3

In this work, we continue the study of vertex colorings of graphs, in which adjacent vertices are allowed to be of the same color as long as each monochromatic connected component…

cs.DS2019

On a Conjecture of Lovász on Circle-Representations of Simple 4-Regular Planar Graphs

Michael A. Bekos, Chrysanthi N. Raftopoulou

Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system of circles, i.e., it can be drawn on the plane utilizing a set of circles, such th…

cs.CG2019★ 12 cited

Simple -Planar Graphs are Simple -Quasiplanar

Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8

A simple topological graph is -quasiplanar () if it contains no pairwise crossing edges, and -planar if no edge is crossed more than times. In this paper, we…

cs.DS2019

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity

Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1

Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on…

cs.CG2019

External Labeling Techniques: A Taxonomy and Survey

Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg

External labeling is frequently used for annotating features in graphical displays and visualizations, such as technical illustrations, anatomical drawings, or maps, with textual i…