( en | de | ru )

 

Disambiguation of "Kindermann, Philipp"

Author of the publication

copydeleteadd this publication to your clipboard
The Computational Complexity of the ChordLink Model

, , and . Proc. 38th Europ. Workshop Comput. Geom. (EuroCG'22), page 10:1--7. (2022)

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

Klaus Kindermann

Walter Kindermann

 

Other publications of authors with the same name

Recognizing Stick Graphs with and without Length Constraints, , , , , , and . Journal of Graph Algorithms and Applications, 24 (4): 657--681 (2020)Special Issue on Selected Papers from GD 2020.On the Planar Split Thickness of Graphs, , , , , , , , and . Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN'16), volume 9644 of Lecture Notes in Computer Science, page 403--415. Springer-Verlag, (April 2016)Drawing Planar Graphs with Few Geometric Primitives, , , and . Journal of Graph Algorithms and Applications, 22 (2): 357--387 (2018)Simultaneous Orthogonal Planarity, , , , , , , , , and . Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD'16), volume 9801 of Lecture Notes in Computer Science, page 532--545. Springer-Verlag, (September 2016)The Rique-Number of Graphs., , , , , and . GD, volume 13764 of Lecture Notes in Computer Science, page 371-386. Springer, (2022)Graph Drawing Contest Report., , and . GD, volume 12868 of Lecture Notes in Computer Science, page 409-417. Springer, (2021)Graph Drawing Contest Report, , , and . Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD'18), volume 11282 of Lecture Notes in Computer Science, page 609--617. Springer-Verlag, (September 2018)Geometric Thickness of Multigraphs is ∃ ℝ-Complete., , , , , and . LATIN (1), volume 14578 of Lecture Notes in Computer Science, page 336-349. Springer, (2024)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.The Complexity of Finding Tangles, , , , , and . Proc. 36th European Workshop on Computational Geometry (EuroCG'20), page 67:1--8. (2020)