( en | de | ru )

 

Disambiguation of "Wolff, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding the Feasibility and Minimizing the Height of Tangles.

, , , , , and . CoRR, (2023)

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.

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

Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs, , and . Proc. ICALP Affiliated Workshop on Improving Exponential-Time Algorithms (iETA'06), page 31--38. Venezia, (2006)
Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs, , and . Proc. ICALP Affiliated Workshop on Improving Exponential-Time Algorithms (iETA'06), page 31--38. Venezia, (2006)On Arrangements of Orthogonal Circles, , , and . Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD'19), volume 11904 of Lecture Notes in Computer Science, page 216--229. Springer-Verlag, (2019)Schematization in Cartography, Visualization, and Computational Geometry, , and (Eds.) volume 10461 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, (2011)

Alexander Wolff

Alexander Wolff

Alexander Wolff

Alexander Wolff

 

Other publications of authors with the same name

Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192)., , and . Dagstuhl Reports, 9 (5): 31-57 (2019)Beyond Outerplanarity, , , , and . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), Springer-Verlag, (2017)Approximating the Generalized Minimum Manhattan Network Problem, , , , , and . Algorithmica, (March 2017)Improved Approximation Algorithms for Box Contact Representations, , , , , , , and . Algorithmica, (2016)Computing Storyline Visualizations with Few Block Crossings, , , and . Proc. 25th Int. Sympos. Graph Drawing Network Vis. (GD'17), volume 10692 of Lecture Notes in Computer Science, page 365--378. Springer-Verlag, (2018)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)Planar L-Drawings of Directed Graphs, , , , , , , and . CoRR, (2017)Unternehmensbewertung im Transformationsprozeß. Gabler-Edition Wissenschaft Dt. Univ.-Verl. u.a., Wiesbaden, (1998)The Traveling Salesman Problem Under Squared Euclidean Distances, , , , and . Proc. 27th Internat. Sympos. Theoretical Aspects Comput. Sci. (STACS'10), page 239--250. Nancy, (2010)A Simple Proof for the NP-Hardness of Edge Labeling. Technical report, 11/2000. #UG#, (September 2000)