Starten Sie Ihre Suche...


Durch die Nutzung unserer Webseite erklären Sie sich damit einverstanden, dass wir Cookies verwenden. Weitere Informationen
Philipp Kindermann

Jun.-Prof. Dr. Philipp Kindermann

Informatikwissenschaften, Universität Trier

Publikationen
Ergebnisse pro Seite:  10

Kindermann, Philipp; Montecchiani, Fabrizio; Schlipf, Lena et al.

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.

GD. 2018 S. 152 - 166


Kindermann, Philipp; Meulemans, Wouter; Schulz, André

Experimental Analysis of the Accessibility of Drawings with Few Segments.

J. Graph Algorithms Appl. Bd. 22. H. 3. 2018 S. 501 - 518


E. Devanny, William; Kindermann, Philipp; Löffler, Maarten et al.

Graph Drawing Contest Report.

GD. 2018 S. 609 - 617


Angelini, Patrizio; A. Bekos, Michael; Didimo, Walter et al.

Greedy Rectilinear Drawings.

GD. 2018 S. 495 - 508


Biedl, Therese; Biniaz, Ahmad; Irvine, Veronika et al.

Integral Unit Bar-Visibility Graphs.

CCCG. 2018 S. 230 - 246


Eppstein, David; Kindermann, Philipp; G. Kobourov, Stephen et al.

On the Planar Split Thickness of Graphs.

Algorithmica. Bd. 80. H. 3. 2018 S. 977 - 994


Alt, Helmut; Buchin, Kevin; Chaplick, Steven et al.

Placing your coins on a shelf.

J. Comput. Geom. Bd. 9. H. 1. 2018 S. 312 - 327


Angelini, Patrizio; Da Lozzo, Giordano; Di Battista, Giuseppe et al.

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.

ACM Trans. Algorithms. Bd. 14. H. 4. 2018 S. 54:1 - 54:24


Angelini, Patrizio; A. Bekos, Michael; Kaufmann, Michael et al.

1-Fan-Bundle-Planar Drawings of Graphs.

GD. 2017 S. 517 - 530


Hültenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter et al.

Drawing Planar Graphs with Few Geometric Primitives.

WG. 2017 S. 316 - 329