( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Stick Graphs with Length Constraints

, , , , , , и . Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD'19), том 11904 из Lecture Notes in Computer Science, стр. 3--17. Springer-Verlag, (2019)
DOI: 10.1007/978-3-030-35802-0_1

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.

Philipp Kindermann

Christoph Kindermann

Gerhard Kindermann

Josef Kindermann

Klaus Kindermann

 

Другие публикации лиц с тем же именем

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