( en | de | ru )

 

Disambiguation of "Wolff, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Finding Tangles

, , , , , and . Proc. 36th European Workshop on Computational Geometry (EuroCG'20), page 67:1--8. (2020)

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

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)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.Graph Harvester (Software Abstract), , , and . Proc. 32nd Int. Symp. Graph Drawing & Network Vis. (GD'24), volume 320 of LIPIcs, page 58:1–58:3. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, (2024)Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability, , , , , , and . Arxiv report, (June 2008)Available at http://arxiv.org/abs/0806.0920.A Simple and Efficient Algorithm for High-Quality Line Labeling, , , , and . Technical report, UU-CS-2001-44. #UU#, (2001)Cover Contact Graphs, , , , , , , , , and 4 other author(s). Technical report, 2007-18. #UKA#, (September 2007)