( en | de | ru )

 

Disambiguation of "Kindermann, Philipp"

Author of the publication

copydeleteadd this publication to your clipboard
Computing Height-Optimal Tangles Faster.

, , , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 203-215. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Philipp Kindermann

Christoph Kindermann

Gerhard Kindermann

Barbara Kindermann

Martina Kindermann

 

Other publications of authors with the same name

The Complexity of Finding Tangles, , , , , and . Proc. 36th European Workshop on Computational Geometry (EuroCG'20), page 67:1--8. (2020)Morphing Rectangular Duals., , , , and . CoRR, (2021)Vehicle Routing with Time Constraints and Different Vehicles. Lehrstuhl für Informatik I, Universität Würzburg, Diplomarbeit, (October 2011)(German).Drawing Trees and Triangulations with Few Geometric Primitives, , , and . Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG'16), page 55--58. Lugano, (March 2016)Abstract.Mutual Witness Proximity Drawings of Isomorphic Trees., , , and . GD (1), volume 14465 of Lecture Notes in Computer Science, page 304-319. Springer, (2023)On Mixed Linear Layouts of Series-Parallel Graphs., , , and . GD, volume 12590 of Lecture Notes in Computer Science, page 151-159. Springer, (2020)Graph Drawing Contest Report., , , and . GD, volume 12590 of Lecture Notes in Computer Science, page 507-519. Springer, (2020)One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons., , , , and . GD, volume 12868 of Lecture Notes in Computer Science, page 184-192. Springer, (2021)Upward and Orthogonal Planarity are W1-Hard Parameterized by Treewidth., , , , , and . GD (2), volume 14466 of Lecture Notes in Computer Science, page 203-217. Springer, (2023)Geometric Thickness of Multigraphs is $R$-Complete., , , , , and . LATIN (1), volume 14578 of Lecture Notes in Computer Science, page 336-349. Springer, (2024)