Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Improved Approximation Algorithms for Box Contact Representations.

M. Bekos, T. van Dijk, M. Fink, P. Kindermann, S. Kobourov, S. Pupyrev, J. Spoerhase, and A. Wolff. ESA, volume 8737 of Lecture Notes in Computer Science, page 87-99. 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.

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 RobotsP. Tempel, A. Verl, and A. Pott. 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

Configurations with few crossings in topological graphs.C. Knauer, É. Schramm, A. Spillner, and A. Wolff. Comput. Geom., 37 (2): 104-114 (2007)Boundary labeling: Models and efficient algorithms for rectangular maps.M. Bekos, M. Kaufmann, A. Symvonis, and A. Wolff. Comput. Geom., 36 (3): 215-236 (2007)Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.K. Buchin, M. Buchin, J. Byrka, M. Nöllenburg, Y. Okamoto, R. Silveira, and A. Wolff. Algorithmica, 62 (1-2): 309-332 (2012)Approximating Minimum Manhattan Networks in Higher Dimensions.A. Das, E. Gansner, M. Kaufmann, S. Kobourov, J. Spoerhase, and A. Wolff. Algorithmica, 71 (1): 36-52 (2015)Computing Optimal Tangles Faster.O. Firman, P. Kindermann, A. Ravsky, A. Wolff, and J. Zink. CoRR, (2019)Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter TractabilityK. Buchin, M. Buchin, J. Byrka, M. Nöllenburg, Y. Okamoto, R. Silveira, and A. Wolff. CoRR, (2008)A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling.A. Wolff, M. Thon, and Y. Xu. Int. J. Comput. Geometry Appl., 12 (4): 269-282 (2002)Drawing Binary Tanglegrams: An Experimental EvaluationM. Nöllenburg, D. Holten, M. Völker, and A. Wolff. CoRR, (2008)Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.M. Bekos, T. van Dijk, P. Kindermann, and A. Wolff. CoRR, (2014)Multi-Sided Boundary LabelingP. Kindermann, B. Niedermann, I. Rutter, M. Schaefer, A. Schulz, and A. Wolff. CoRR, (2013)

PUMA

Disambiguation of "Wolff, Alexander"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Improved Approximation Algorithms for Box Contact Representations.

Please choose a person to relate this publication to

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

Frank Wolff University of Stuttgart

Alexander Verl

Lars Freiherr von Wolff University of Stuttgart

Alexander Jaust

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Wolff, Alexander"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Improved Approximation Algorithms for Box Contact Representations.

Please choose a person to relate this publication to

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

Frank Wolff University of Stuttgart

Alexander Verl

Lars Freiherr von Wolff University of Stuttgart

Alexander Jaust

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Improved Approximation Algorithms for Box Contact Representations.