Kindermann, Philipp; Meulemans, Wouter; Schulz, André
Experimental Analysis of the Accessibility of Drawings with Few Segments.GD. 2017 S. 52 - 64
E. Devanny, William; Kindermann, Philipp; Löffler, Maarten et al.
Graph Drawing Contest Report.GD. 2017 S. 575 - 582
A. Bekos, Michael; C. van Dijk, Thomas; Fink, Martin et al.
Improved Approximation Algorithms for Box Contact Representations.Algorithmica. Bd. 77. H. 3. 2017 S. 902 - 920
Kindermann, Philipp; G. Kobourov, Stephen; Löffler, Maarten et al.
Lombardi Drawings of Knots and Links.GD. 2017 S. 113 - 126
Alt, Helmut; Buchin, Kevin; Chaplick, Steven et al.
Placing your Coins on a Shelf.ISAAC. 2017 S. 4:1 - 4:12
Kindermann, Philipp; Löffler, Maarten; Nachmanson, Lev et al.
Graph Drawing Contest Report.GD. 2016 S. 589 - 595
Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz et al.
Multi-sided Boundary Labeling.Algorithmica. Bd. 76. H. 1. 2016 S. 225 - 258
Eppstein, David; Kindermann, Philipp; G. Kobourov, Stephen et al.
On the Planar Split Thickness of Graphs.LATIN. 2016 S. 403 - 415
J. Brandenburg, Franz; Didimo, Walter; S. Evans, William et al.
Recognizing and drawing IC-planar graphs.Theor. Comput. Sci. Bd. 636. 2016 S. 1 - 16
A. Bekos, Michael; C. van Dijk, Thomas; Kindermann, Philipp et al.
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.J. Graph Algorithms Appl. Bd. 20. H. 1. 2016 S. 133 - 158