Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilipp Kindermann
Person information
- affiliation: Universität Trier, Germany
- affiliation: Universität Würzburg, Germany
- affiliation: FernUniversität in Hagen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j24]Oswin Aichholzer
, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber:
Perfect Matchings with Crossings. Algorithmica 86(3): 697-716 (2024)- [j23]Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza:
Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. 183: 106419 (2024) - [c50]Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) 2024: 336-349 - [c49]Carolina Haase, Philipp Kindermann:
On Layered Area-Proportional Rectangle Contact Representations. WALCOM 2024: 149-162 - [i42]Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter:
On k-Plane Insertion into Plane Drawings. CoRR abs/2402.14552 (2024) - 2023
- [j22]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023) - [j21]Giordano Da Lozzo, Philipp Kindermann:
Guest Editors' Foreword. J. Graph Algorithms Appl. 27(6): 405-408 (2023) - [j20]Philipp Kindermann, Jan Sauer, Alexander Wolff:
The Computational Complexity of the ChordLink Model. J. Graph Algorithms Appl. 27(9): 759-767 (2023) - [c48]Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. GD (2) 2023: 203-217 - [c47]Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
Mutual Witness Proximity Drawings of Isomorphic Trees. GD (1) 2023: 304-319 - [c46]Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) 2023: 323-338 - [c45]Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. ISAAC 2023: 46:1-46:13 - [c44]Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
The Complexity of Finding Tangles. SOFSEM 2023: 3-17 - [c43]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. SOFSEM 2023: 111-125 - [i41]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023) - [i40]Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR abs/2306.07237 (2023) - [i39]Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth. CoRR abs/2309.01264 (2023) - [i38]Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
Mutual Witness Proximity Drawings of Isomorphic Trees. CoRR abs/2309.01463 (2023) - [i37]Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable. CoRR abs/2309.15454 (2023) - [i36]Carolina Haase, Philipp Kindermann:
On Layered Area-Proportional Rectangle Contact Representations. CoRR abs/2311.15057 (2023) - [i35]Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃R-complete. CoRR abs/2312.05010 (2023) - [i34]Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Deciding the Feasibility and Minimizing the Height of Tangles. CoRR abs/2312.16213 (2023) - 2022
- [j19]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100: 101820 (2022) - [j18]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. 898: 44-49 (2022) - [j17]Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. Theor. Comput. Sci. 919: 66-74 (2022) - [j16]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On mixed linear layouts of series-parallel graphs. Theor. Comput. Sci. 936: 129-138 (2022) - [c42]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. GD 2022: 371-386 - [c41]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Morphing Rectangular Duals. GD 2022: 389-403 - [c40]Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff:
Outside-Obstacle Representations with All Vertices on the Outer Face. GD 2022: 432-440 - [c39]Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans:
Graph Drawing Contest Report. GD 2022: 459-470 - [c38]Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber:
Perfect Matchings with Crossings. IWOCA 2022: 46-59 - [i33]Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff:
Outside-Obstacle Representations with All Vertices on the Outer Face. CoRR abs/2202.13015 (2022) - [i32]Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza:
Recognizing well-dominated graphs is coNP-complete. CoRR abs/2208.08864 (2022) - [i31]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. CoRR abs/2209.00424 (2022) - [i30]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. CoRR abs/2210.05019 (2022) - 2021
- [j15]Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff:
ClusterSets: Optimizing Planar Clusters in Categorical Point Data. Comput. Graph. Forum 40(3): 471-481 (2021) - [j14]Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. J. Graph Algorithms Appl. 25(1): 1-28 (2021) - [c37]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC 2021: 340-353 - [c36]Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis:
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. GD 2021: 184-192 - [c35]Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans:
Graph Drawing Contest Report. GD 2021: 409-417 - [i29]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CoRR abs/2102.02013 (2021) - [i28]Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis:
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. CoRR abs/2108.12321 (2021) - [i27]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Morphing Rectangular Duals. CoRR abs/2112.03040 (2021) - 2020
- [j13]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Recognizing Stick Graphs with and without Length Constraints. J. Graph Algorithms Appl. 24(4): 657-681 (2020) - [c34]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On Mixed Linear Layouts of Series-Parallel Graphs. GD 2020: 151-159 - [c33]Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter:
Graph Drawing Contest Report. GD 2020: 507-519 - [i26]Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On Mixed Linear Layouts of Series-Parallel Graphs. CoRR abs/2008.10475 (2020)
2010 – 2019
- 2019
- [j12]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi drawings of knots and links. J. Comput. Geom. 10(1): 444-476 (2019) - [j11]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019) - [c32]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. GD 2019: 3-17 - [c31]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing Numbers of Beyond-Planar Graphs. GD 2019: 78-86 - [c30]Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Computing Height-Optimal Tangles Faster. GD 2019: 203-215 - [c29]Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis:
Drawing Planar Graphs with Few Segments on a Polynomial Grid. GD 2019: 416-429 - [c28]Philipp Kindermann, Tamara Mchedlidze, Ignaz Rutter:
Graph Drawing Contest Report. GD 2019: 575-583 - [c27]Therese Biedl, Philipp Kindermann:
Finding Tutte Paths in Linear Time. ICALP 2019: 23:1-23:14 - [c26]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw:
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. WG 2019: 258-270 - [i25]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw:
Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs. CoRR abs/1901.01476 (2019) - [i24]Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis:
Drawing planar graphs with few segments on a polynomial grid. CoRR abs/1903.08496 (2019) - [i23]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. CoRR abs/1907.05257 (2019) - [i22]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing Numbers of Beyond-Planar Graphs. CoRR abs/1908.03153 (2019) - 2018
- [j10]David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath:
On the Planar Split Thickness of Graphs. Algorithmica 80(3): 977-994 (2018) - [j9]Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. J. Graph Algorithms Appl. 22(2): 357-387 (2018) - [j8]Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental Analysis of the Accessibility of Drawings with Few Segments. J. Graph Algorithms Appl. 22(3): 501-518 (2018) - [j7]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your coins on a shelf. J. Comput. Geom. 9(1): 312-327 (2018) - [j6]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. ACM Trans. Algorithms 14(4): 54:1-54:24 (2018) - [j5]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723: 23-50 (2018) - [c25]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte:
Integral Unit Bar-Visibility Graphs. CCCG 2018: 230-246 - [c24]Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. GD 2018: 152-166 - [c23]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. GD 2018: 495-508 - [c22]William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. GD 2018: 609-617 - [i21]Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. CoRR abs/1808.08496 (2018) - [i20]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. CoRR abs/1808.09063 (2018) - [i19]Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider, André Schulz:
The Partition Spanning Forest Problem. CoRR abs/1809.02710 (2018) - [i18]Therese Biedl, Philipp Kindermann:
Finding Tutte paths in linear time. CoRR abs/1812.04543 (2018) - 2017
- [j4]Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. Algorithmica 77(3): 902-920 (2017) - [c21]Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental Analysis of the Accessibility of Drawings with Few Segments. GD 2017: 52-64 - [c20]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. GD 2017: 113-126 - [c19]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-Bundle-Planar Drawings of Graphs. GD 2017: 517-530 - [c18]William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. GD 2017: 575-582 - [c17]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. ISAAC 2017: 4:1-4:12 - [c16]Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. WG 2017: 316-329 - [i17]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-Bundle-Planar Drawings of Graphs. CoRR abs/1702.06163 (2017) - [i16]Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. CoRR abs/1703.01691 (2017) - [i15]Philipp Kindermann, Lena Schlipf, André Schulz:
On Gallai's conjecture for series-parallel graphs and planar 3-trees. CoRR abs/1706.04130 (2017) - [i14]Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. CoRR abs/1707.01239 (2017) - [i13]Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental analysis of the accessibility of drawings with few segments. CoRR abs/1708.09815 (2017) - [i12]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. CoRR abs/1708.09819 (2017) - 2016
- [j3]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-sided Boundary Labeling. Algorithmica 76(1): 225-258 (2016) - [j2]Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff:
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. J. Graph Algorithms Appl. 20(1): 133-158 (2016) - [j1]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and drawing IC-planar graphs. Theor. Comput. Sci. 636: 1-16 (2016) - [c15]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. SoCG 2016: 37:1-37:15 - [c14]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. GD 2016: 532-545 - [c13]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2016: 589-595 - [c12]David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath:
On the Planar Split Thickness of Graphs. LATIN 2016: 403-415 - [c11]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. SODA 2016: 985-996 - [i11]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. CoRR abs/1601.01598 (2016) - [i10]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum Rectilinear Polygons for Given Angle Sequences. CoRR abs/1606.06940 (2016) - [i9]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. CoRR abs/1608.08427 (2016) - 2015
- [b1]Philipp Kindermann:
Angular Schematization in Graph Drawing. Julius Maximilians University Würzburg, Germany, 2015, ISBN 978-3-95826-020-7, pp. 1-173 - [c10]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-Planar Graphs. GD 2015: 295-308 - [c9]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2015: 531-537 - [c8]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-crossing Euclidean Steiner Forest. ISAAC 2015: 429-441 - [c7]William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG 2015: 105-119 - [c6]Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff:
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. WALCOM 2015: 222-233 - [i8]Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff:
On Monotone Drawings of Trees. CoRR abs/1505.01410 (2015) - [i7]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-planar Graphs. CoRR abs/1509.00388 (2015) - [i6]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-Crossing Euclidean Steiner Forest. CoRR abs/1509.05681 (2015) - [i5]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. CoRR abs/1510.02659 (2015) - 2014
- [c5]Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. ESA 2014: 87-99 - [c4]Philipp Kindermann, Fabian Lipp, Alexander Wolff:
Luatodonotes: Boundary Labeling for Annotations in Texts. GD 2014: 76-88 - [c3]Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff:
On Monotone Drawings of Trees. GD 2014: 488-500 - [c2]Muhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff:
Smooth Orthogonal Drawings of Planar Graphs. LATIN 2014: 144-155 - [i4]Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. CoRR abs/1403.4861 (2014) - [i3]Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann,