( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Folding polyominoes with holes into a cube

, , , , , , , , , , и . Computational Geometry, (2021)

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.

Günter Aichholzer

Karl Aichholzer

Walter Aichholzer

Peter Aichholzer

Anton Aichholzer

 

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

Graph Drawings with Relative Edge Length Specifications., , , и . CCCG, Carleton University, Ottawa, Canada, (2014)On pseudo-convex decompositions, partitions, and coverings., , , , и . EuroCG, стр. 89-92. Technische Universiteit Eindhoven, (2005)Triangulations with Circular Arcs., , , , , и . J. Graph Algorithms Appl., 19 (1): 43-65 (2015)Flip Distances Between Graph Orientations., , , , , , и . WG, том 11789 из Lecture Notes in Computer Science, стр. 120-134. Springer, (2019)Blocking delaunay triangulations., , , , , , и . CCCG, стр. 21-24. (2010)On (Pointed) Minimum Weight Pseudo-Triangulations., , , и . CCCG, стр. 209-212. Carleton University, Ottawa, Canada, (2007)Degree Bounds for Constrained Pseudo-Triangulations., , , и . CCCG, стр. 155-158. (2003)Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs., , и . GD (2), том 14466 из Lecture Notes in Computer Science, стр. 34-50. Springer, (2023)An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings., , , , и . ISAAC, том 9472 из Lecture Notes in Computer Science, стр. 505-516. Springer, (2015)Hardness of Token Swapping on Trees., , , , , , , , и . ESA, том 244 из LIPIcs, стр. 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)