Author of the publication

Semantic Word Cloud Representations: Hardness and Approximation Algorithms.

, , , , , , , , , and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 514-525. Springer, (2014)

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

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends., , , and . WALCOM, volume 8973 of Lecture Notes in Computer Science, page 222-233. Springer, (2015)A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling., , and . Int. J. Comput. Geometry Appl., 12 (4): 269-282 (2002)Delineating Boundaries for Imprecise Regions., , , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 143-154. Springer, (2005)Improved Approximation Algorithms for Box Contact Representations., , , , , , , and . ESA, volume 8737 of Lecture Notes in Computer Science, page 87-99. Springer, (2014)New Algorithms for Two-Label Point Labeling., , , and . ESA, volume 1879 of Lecture Notes in Computer Science, page 368-379. Springer, (2000)Multi-Level Steiner Trees., , , , , , , , , and 1 other author(s). SEA, volume 103 of LIPIcs, page 15:1-15:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)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)