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

Obstructing Visibilities with One Obstacle.

S. Chaplick, F. Lipp, J. won Park, and A. Wolff. Graph Drawing, volume 9801 of Lecture Notes in Computer Science, page 295-308. Springer, (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.

Dr. rer. nat. Hansjörg Lipp University of Stuttgart

Melanie Lipp University of Stuttgart

Max Lippoldt University of Stuttgart

Felix Lippkau University of Stuttgart

Fabian Schnelle

Design and programming for cable-driven parallel robots in the German pavilion at the EXPO 2015P. Tempel, F. Schnelle, A. Pott, and P. Eberhard. Machines, 3 (3): 223-241 (2015)

Other publications of authors with the same name

Block Crossings in Storyline Visualizations.T. van Dijk, M. Fink, N. Fischer, F. Lipp, P. Markfelder, A. Ravsky, S. Suri, and A. Wolff. Graph Drawing, volume 9801 of Lecture Notes in Computer Science, page 382-398. Springer, (2016)Block Crossings in Storyline Visualizations.T. van Dijk, M. Fink, N. Fischer, F. Lipp, P. Markfelder, A. Ravsky, S. Suri, and A. Wolff. J. Graph Algorithms Appl., 21 (5): 873-913 (2017)The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions.K. Fleszar, C. Glaßer, F. Lipp, C. Reitwießner, and M. Witek. Electronic Colloquium on Computational Complexity (ECCC), (2011)The Complexity of Drawing Graphs on Few Lines and Few Planes.S. Chaplick, K. Fleszar, F. Lipp, A. Ravsky, O. Verbitsky, and A. Wolff. CoRR, (2016)Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition.F. Lipp, A. Wolff, and J. Zink. Algorithms, 9 (3): 53 (2016)The Complexity of Drawing Graphs on Few Lines and Few Planes.S. Chaplick, K. Fleszar, F. Lipp, A. Ravsky, O. Verbitsky, and A. Wolff. WADS, volume 10389 of Lecture Notes in Computer Science, page 265-276. Springer, (2017)Luatodonotes: Boundary Labeling for Annotations in Texts.P. Kindermann, F. Lipp, and A. Wolff. Graph Drawing, volume 8871 of Lecture Notes in Computer Science, page 76-88. Springer, (2014)Structural Complexity of Multiobjective NP Search Problems.K. Fleszar, C. Glaßer, F. Lipp, C. Reitwießner, and M. Witek. LATIN, volume 7256 of Lecture Notes in Computer Science, page 338-349. Springer, (2012)Compact drawings of 1-planar graphs with right-angle crossings and few bends.S. Chaplick, F. Lipp, A. Wolff, and J. Zink. Comput. Geom., (2019)NOracle: Who is communicating with whom in my network?P. Kalmbach, D. Hock, F. Lipp, W. Kellerer, and A. Blenk. SIGCOMM Posters and Demos, page 48-50. ACM, (2019)