( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On k-Plane Insertion into Plane Drawings.

, , , , и . CoRR, (2024)

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

Klaus Kindermann

Josef Kindermann

 

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

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