Author of the publication

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 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)
 

Other publications of authors with the same name

Two-Sided Boundary Labeling with Adjacent Sides., , , , , and . WADS, volume 8037 of Lecture Notes in Computer Science, page 463-474. Springer, (2013)Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity., , , , , , , and . Graph Drawing, volume 11282 of Lecture Notes in Computer Science, page 509-523. Springer, (2018)Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps., , , and . Graph Drawing, volume 4372 of Lecture Notes in Computer Science, page 270-281. Springer, (2006)Block Crossings in Storyline Visualizations., , , , , , , and . Graph Drawing, volume 9801 of Lecture Notes in Computer Science, page 382-398. Springer, (2016)Planar L-Drawings of Directed Graphs., , , , , , , and . Graph Drawing, volume 10692 of Lecture Notes in Computer Science, page 465-478. Springer, (2017)Drawing Graphs within Restricted Area., , , and . Graph Drawing, volume 8871 of Lecture Notes in Computer Science, page 367-379. Springer, (2014)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)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)