55 citations · 188 across the 40 of their papers we have counts for
4 papers · 2 filters
Crossing Numbers of Beyond-Planar Graphs
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani +1
We study the 1-planar, quasi-planar, and fan-planar crossing number in comparison to the (unrestricted) crossing number of graphs. We prove that there are -vertex 1-planar (quas…
Recognizing Stick Graphs with and without Length Constraints
Steven Chaplick, Philipp Kindermann, Andre Löffler +4
Stick graphs are intersection graphs of horizontal and vertical line segments that all touch a line of slope -1 and lie above this line. De Luca et al. [GD'18] considered the recog…
Drawing planar graphs with few segments on a polynomial grid
Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck +1
The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawin…
Maximum Matchings and Minimum Blocking Sets in -Graphs
Therese Biedl, Ahmad Biniaz, Veronika Irvine +3
-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilatera…