PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Wolff, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.

, , , and . J. Graph Algorithms Appl., 20 (1): 133-158 (2016)

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.

Hon. -Prof. Dr. rer. nat. Gerd Wolff University of Stuttgart

Frank Wolff University of Stuttgart

Alexander Verl

On the Dynamics and Emergency Stop Behavior of Cable-Driven Parallel Robots, , and . ROMANSY 21 - Robot Design, Dynamics and Control, volume 569 of CISM International Centre for Mechanical Sciences, page 431--438. Switzerland, Springer Verlag and Springer International Publishing, (2016)

Lars Freiherr von Wolff University of Stuttgart

Alexander Jaust

 

Other publications of authors with the same name

On the Maximum Crossing Number., , , , , and . IWOCA, volume 10765 of Lecture Notes in Computer Science, page 61-74. Springer, (2017)Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs., , and . WAOA, volume 7164 of Lecture Notes in Computer Science, page 77-88. Springer, (2011)Drawing Binary Tanglegrams: An Experimental Evaluation., , , and . ALENEX, page 106-119. SIAM, (2009)Boundary labeling: Models and efficient algorithms for rectangular maps., , , and . Comput. Geom., 36 (3): 215-236 (2007)Configurations with few crossings in topological graphs., , , and . Comput. Geom., 37 (2): 104-114 (2007)Approximating Minimum Manhattan Networks in Higher Dimensions., , , , , and . Algorithmica, 71 (1): 36-52 (2015)Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability., , , , , , and . Algorithmica, 62 (1-2): 309-332 (2012)Computing Optimal Tangles Faster., , , , and . CoRR, (2019)Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability, , , , , , and . CoRR, (2008)Drawing Binary Tanglegrams: An Experimental Evaluation, , , and . CoRR, (2008)