Suche
103762 Treffer
×
Hochschule Worms
×
Hochschule Kaiserslautern
×
Johannes Gutenberg-Universität Mainz
×
Universität Trier
×
Hochschule Trier
×
Katholische Hochschule Mainz
- 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
- 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
- Angelini, Patrizio; A. Bekos, Michael; Kindermann, Philipp et al.
- On Mixed Linear Layouts of Series-Parallel Graphs.
- GD. 2020 S. 151 - 159
- Chaplick, Steven; Kindermann, Philipp; Löffler, Andre et al.
- Recognizing Stick Graphs with and without Length Constraints.
- J. Graph Algorithms Appl. Bd. 24. H. 4. 2020 S. 657 - 681
- Kindermann, Philipp; Mchedlidze, Tamara; Meulemans, Wouter
- Graph Drawing Contest Report.
- GD. 2021 S. 409 - 417
- Hültenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter et al.
- Drawing Planar Graphs with Few Geometric Primitives.
- J. Graph Algorithms Appl. Bd. 22. H. 2. 2018 S. 357 - 387
- 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
- Kindermann, Philipp; Meulemans, Wouter; Schulz, André
- Experimental Analysis of the Accessibility of Drawings with Few Segments.
- GD. 2017 S. 52 - 64
- 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
- Biedl, Therese; Biniaz, Ahmad; Irvine, Veronika et al.
- Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs.
- WG. 2019 S. 258 - 270