( en | de | ru )

 

Disambiguation of "Kindermann, Philipp"

Author of the publication

copydeleteadd this publication to your clipboard
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.

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

Lombardi Drawings of Knots and Links, , , , , and . Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), volume 10692 of Lecture Notes in Computer Science, page 113--126. Springer, (September 2017)Drawing Planar Graphs with Few Geometric Primitives, , , and . Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'17), volume 10520 of Lecture Notes in Computer Science, page 316--329. Springer-Verlag, (June 2017)Simultaneous Orthogonal Planarity, , , , , , , , , and . Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, volume 9801 of Lecture Notes in Computer Science, page 532--545. Springer, (September 2016)Simultaneous Orthogonal Planarity, , , , , , , , , and . Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16), 9801, page 532-545. Springer, (2016)Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, , , and . Journal of Graph Algorithms and Applications, 25 (1): 1--28 (2020)One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons, , , , and . Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20), page 70:1--70:6. Würzburg, (2020)Abstract.Recognizing well-dominated graphs is coNP-complete., , , , and . Inf. Process. Lett., (January 2024)Deciding the Feasibility and Minimizing the Height of Tangles., , , , , and . CoRR, (2023)Perfect Matchings with Crossings., , , , , , , and . Algorithmica, 86 (3): 697-716 (March 2024)Splitting Vertices in 2-Layer Graph Drawings., , , , , , , , , and 1 other author(s). CoRR, (2023)