From post

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.

Prof. Dr. Alexander Wolff Universität Würzburg

Graph Harvester, , , и . Proc. 32nd Int. Symp. Graph Drawing & Network Vis. (GD'24), том 320 из LIPIcs, стр. 58:1--3. Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik, (2024)
Graph Harvester, , , и . Proc. 32nd Int. Symp. Graph Drawing & Network Vis. (GD'24), том 320 из LIPIcs, стр. 58:1--3. Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik, (2024)Multi-Level Steiner Trees, , , , , , , , , и 1 other автор(ы). ACM J. Exp. Algorithmics, 24 (1): 2.5:1--2.5:22 (2019)The Price of Upwardness, , , , , , , , , и 1 other автор(ы). Proc. 32nd Int. Symp. Graph Drawing & Network Vis. (GD'24), том 320 из LIPIcs, стр. 13:1--20. Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik, (2024)
 

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

Recognizing Stick Graphs with and without Length Constraints, , , , , , и . Journal of Graph Algorithms and Applications, 24 (4): 657--681 (2020)Special Issue on Selected Papers from GD 2020.Beschriftungsalgorithmen in Theorie & Praxis, , , , , , , , , и . Technical report, 13/2002. #UG#, (апреля 2002)Geographic Information Systems, , , , , , и . Report on the GIS part of the Computational Geometry Algorithms Library (CGAL), Task 4.1, (1997)Area aggregation in map generalisation by mixed-integer programming, и . Internat. J. Geogr. Inf. Sci., (): (2009)To appear; conference version appeared at ACM-GIS'06..A Generic Design Concept for Geometric Algorithms, , и . Technical report, B 00--10. Institut für Informatik, Fachbereich Mathematik und Informatik, Freie Universität Berlin, (июня 2000)Labeling Points with Circles, и . Technical report, B 99-08. Institut für Informatik, Freie Universität Berlin, (апреля 1999)Graph Drawing and Cartography. стр. 697--736. CRC Press, (2014)1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area, , , и . Proc. 34th Europ. Workshop Comput. Geom. (EuroCG'18), стр. 28:1--6. (2018)Representing Graphs and Hypergraphs by Touching Polygons in 3D., , , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 18-32. Springer, (2019)Computing Height-Optimal Tangles Faster., , , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 203-215. Springer, (2019)