From post

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)
DOI: 10.1007/978-3-319-73915-1_10

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.

 

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

Smart districts in an ageing society., , и . GCCE, стр. 1-4. IEEE, (2014)Fréchet Distance of Surfaces: Some Simple Hard Cases., , и . ESA (2), том 6347 из Lecture Notes in Computer Science, стр. 63-74. Springer, (2010)Lombardi Drawings of Knots and Links, , , , , и . Journal of Computational Geometry, 10 (1): 444--476 (2019)Pinning balloons with perfect angles and optimal area., и . J. Graph Algorithms Appl., 16 (4): 847-870 (2012)Lifting planar graphs to realize integral 3-polytopes and topics in pseudo- triangulations (Heben von planaren Graphen zur ganzzahligen Einbettung von 3-Polytopen und Themen über Pseudo-Triangulierungen). FU Berlin, Germany, (2008)base-search.net (ftfuberlin:oai:refubium.fu-berlin.de:fub188/12086).Bounded-degree polyhedronization of point sets., , , , , , , , , и 1 other автор(ы). CCCG, стр. 99-102. (2010)New results on Pseudo-triangulations with low vertex degree.. CCCG, стр. 130-133. (2005)A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams., и . GD, том 9411 из Lecture Notes in Computer Science, стр. 489-501. Springer, (2015)Bounds on the maximum multiplicity of some common geometric graphs., , , и . STACS, том 9 из LIPIcs, стр. 637-648. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Algorithms for Designing Pop-Up Cards., , , , , , , , и . STACS, том 20 из LIPIcs, стр. 269-280. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)