( en | de | ru )

 

Disambiguation of "Wolff, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Planar L-Drawings of Directed Graphs

, , , , , , , and . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), volume 10692 of LNCS, page 465--478. Cham, Springer International Publishing, (2017)
DOI: 978-3-319-73915-1_36

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. You can also use the button next to the name to display some publications already assigned to the person.

Alexander Wolff

Alexander Wolff

Alexander Wolff

Alexander Wolff

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

 

Other publications of authors with the same name

Multi-level Steiner Trees., , , , , , , , , and 1 other author(s). ACM J. Exp. Algorithmics, 24 (1): 2.5:1-2.5:22 (2019)Recognizing Stick Graphs with and without Length Constraints, , , , , , and . Journal of Graph Algorithms and Applications, 24 (4): 657--681 (2020)Special Issue on Selected Papers from GD 2020.Beschriftungsalgorithmen in Theorie & Praxis, , , , , , , , , and . Technical report, 13/2002. #UG#, (April 2002)Geographic Information Systems, , , , , , and . 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, and . Internat. J. Geogr. Inf. Sci., (): (2009)To appear; conference version appeared at ACM-GIS'06..A Generic Design Concept for Geometric Algorithms, , and . Technical report, B 00--10. Institut für Informatik, Fachbereich Mathematik und Informatik, Freie Universität Berlin, (June 2000)Labeling Points with Circles, and . Technical report, B 99-08. Institut für Informatik, Freie Universität Berlin, (April 1999)Planar L-Drawings of Directed Graphs, , , , , , , and . CoRR, (2017)Recognizing Stick Graphs with and without Length Constraints, , , , , , and . Journal of Graph Algorithms and Applications, 24 (4): 657--681 (2020)Computing Optimal Tangles Faster, , , , and . Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19), page 61:1-7. (2019)