Jun.-Prof. Dr. Philipp Kindermann - Publikationen

Didimo, Walter; Gupta, Siddharth; Kindermann, Philipp et al.
Parameterized Approaches to Orthogonal Compaction.
SOFSEM. 2023 S. 111 - 125

Firman, Oksana; Kindermann, Philipp; Klemz, Boris et al.
The Complexity of Finding Tangles.
SOFSEM. 2023 S. 3 - 17

Chimani, Markus; Kindermann, Philipp; Montecchiani, Fabrizio et al.
Crossing numbers of beyond-planar graphs.
Theor. Comput. Sci. Bd. 898. 2022 S. 44 - 49

Kindermann, Philipp; Klute, Fabian; Mchedlidze, Tamara et al.
Graph Drawing Contest Report.
GD. 2022 S. 459 - 470

S. Evans, William; Fleszar, Krzysztof; Kindermann, Philipp et al.
Minimum rectilinear polygons for given angle sequences.
Comput. Geom. Bd. 100. 2022 S. 101820

Chaplick, Steven; Kindermann, Philipp; Klawitter, Jonathan et al.
Morphing Rectangular Duals.
GD. 2022 S. 389 - 403

Angelini, Patrizio; A. Bekos, Michael; Kindermann, Philipp et al.
On mixed linear layouts of series-parallel graphs.
Theor. Comput. Sci. Bd. 936. 2022 S. 129 - 138

Firman, Oksana; Kindermann, Philipp; Klawitter, Jonathan et al.
Outside-Obstacle Representations with All Vertices on the Outer Face.
GD. 2022 S. 432 - 440

Aichholzer, Oswin; Fabila Monroy, Ruy; Kindermann, Philipp et al.
Perfect Matchings with Crossings.
IWOCA. 2022 S. 46 - 59

Chaplick, Steven; Felsner, Stefan; Kindermann, Philipp et al.
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations.
Theor. Comput. Sci. Bd. 919. 2022 S. 66 - 74

A. Bekos, Michael; Felsner, Stefan; Kindermann, Philipp et al.
The Rique-Number of Graphs.
GD. 2022 S. 371 - 386

Geiger, Jakob; Cornelsen, Sabine; Haunert, Jan-Henrik et al.
ClusterSets: Optimizing Planar Clusters in Categorical Point Data.
Comput. Graph. Forum. Bd. 40. H. 3. 2021 S. 471 - 481

Kindermann, Philipp; Montecchiani, Fabrizio; Schlipf, Lena et al.
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.
J. Graph Algorithms Appl. Bd. 25. H. 1. 2021 S. 1 - 28

Chaplick, Steven; Kindermann, Philipp; Klawitter, Jonathan et al.
Extending Partial Representations of Rectangular Duals with Given Contact Orientations.
CIAC. 2021 S. 340 - 353

Kindermann, Philipp; Mchedlidze, Tamara; Meulemans, Wouter
Graph Drawing Contest Report.
GD. 2021 S. 409 - 417

Angelini, Patrizio; Kindermann, Philipp; Löffler, Andre et al.
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons.
GD. 2021 S. 184 - 192

Kindermann, Philipp; Mchedlidze, Tamara; Meulemans, Wouter et al.
Graph Drawing Contest Report.
GD. 2020 S. 507 - 519

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

Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander et al.
Computing Height-Optimal Tangles Faster.
GD. 2019 S. 203 - 215

Chimani, Markus; Kindermann, Philipp; Montecchiani, Fabrizio et al.
Crossing Numbers of Beyond-Planar Graphs.
GD. 2019 S. 78 - 86

Kindermann, Philipp; Mchedlidze, Tamara; Schneck, Thomas et al.
Drawing Planar Graphs with Few Segments on a Polynomial Grid.
GD. 2019 S. 416 - 429

Biedl, Therese; Kindermann, Philipp
Finding Tutte Paths in Linear Time.
ICALP. 2019 S. 23:1 - 23:14

Kindermann, Philipp; Mchedlidze, Tamara; Rutter, Ignaz
Graph Drawing Contest Report.
GD. 2019 S. 575 - 583

Angelini, Patrizio; A. Bekos, Michael; Didimo, Walter et al.
Greedy rectilinear drawings.
Theor. Comput. Sci. Bd. 795. 2019 S. 375 - 397

Kindermann, Philipp; G. Kobourov, Stephen; Löffler, Maarten et al.
Lombardi drawings of knots and links.
J. Comput. Geom. Bd. 10. H. 1. 2019 S. 444 - 476

Biedl, Therese; Biniaz, Ahmad; Irvine, Veronika et al.
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs.
WG. 2019 S. 258 - 270

Chaplick, Steven; Kindermann, Philipp; Löffler, Andre et al.
Stick Graphs with Length Constraints.
GD. 2019 S. 3 - 17

Angelini, Patrizio; A. Bekos, Michael; Kaufmann, Michael et al.
1-Fan-bundle-planar drawings of graphs.
Theor. Comput. Sci. Bd. 723. 2018 S. 23 - 50

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

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

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

Angelini, Patrizio; Chaplick, Steven; Cornelsen, Sabine et al.
Simultaneous Orthogonal Planarity.
GD. 2016 S. 532 - 545

Felsner, Stefan; Igamberdiev, Alexander; Kindermann, Philipp et al.
Strongly Monotone Drawings of Planar Graphs.
SoCG. 2016 S. 37:1 - 37:15

Angelini, Patrizio; Da Lozzo, Giordano; Di Battista, Giuseppe et al.
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.
SODA. 2016 S. 985 - 996

Kindermann, Philipp
Angular Schematization in Graph Drawing.
2015 S. 1 - 173

Bereg, Sergey; Fleszar, Krzysztof; Kindermann, Philipp et al.
Colored Non-crossing Euclidean Steiner Forest.
ISAAC. 2015 S. 429 - 441

Kindermann, Philipp; Löffler, Maarten; Nachmanson, Lev et al.
Graph Drawing Contest Report.
GD. 2015 S. 531 - 537

S. Evans, William; Fleszar, Krzysztof; Kindermann, Philipp et al.
Minimum Rectilinear Polygons for Given Angle Sequences.
JCDCGG. 2015 S. 105 - 119

J. Brandenburg, Franz; Didimo, Walter; S. Evans, William et al.
Recognizing and Drawing IC-Planar Graphs.
GD. 2015 S. 295 - 308

A. Bekos, Michael; C. van Dijk, Thomas; Kindermann, Philipp et al.
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.
WALCOM. 2015 S. 222 - 233

A. Bekos, Michael; C. van Dijk, Thomas; Fink, Martin et al.
Improved Approximation Algorithms for Box Contact Representations.
ESA. 2014 S. 87 - 99

Kindermann, Philipp; Lipp, Fabian; Wolff, Alexander
Luatodonotes: Boundary Labeling for Annotations in Texts.
GD. 2014 S. 76 - 88

Kindermann, Philipp; Schulz, André; Spoerhase, Joachim et al.
On Monotone Drawings of Trees.
GD. 2014 S. 488 - 500

Jawaherul Alam, Muhammad; A. Bekos, Michael; Kaufmann, Michael et al.
Smooth Orthogonal Drawings of Planar Graphs.
LATIN. 2014 S. 144 - 155

Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz et al.
Two-Sided Boundary Labeling with Adjacent Sides.
WADS. 2013 S. 463 - 474