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

Beyond Outerplanarity.

S. Chaplick, M. Kryven, G. Liotta, A. Löffler, and A. Wolff. Graph Drawing, volume 10692 of Lecture Notes in Computer Science, page 546-559. Springer, (2017)

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.

Steven Minden University of Stuttgart

Steven Presser University of Stuttgart

Steven Jöns University of Stuttgart

Steven Biele University of Stuttgart

Steven Scharr University of Stuttgart

Other publications of authors with the same name

Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid.S. Chaplick, E. Cohen, and J. Stacho. WG, volume 6986 of Lecture Notes in Computer Science, page 319-330. Springer, (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)The vertex leafage of chordal graphs.S. Chaplick, and J. Stacho. Discrete Applied Mathematics, (2014)Stick Graphs with Length Constraints.S. Chaplick, P. Kindermann, A. Löffler, F. Thiele, A. Wolff, A. Zaft, and J. Zink. GD, volume 11904 of Lecture Notes in Computer Science, page 3-17. Springer, (2019)Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.S. Chaplick, J. Fiala, P. van 't Hof, D. Paulusma, and M. Tesar. Theor. Comput. Sci., (2015)Placing your coins on a shelf.H. Alt, K. Buchin, S. Chaplick, O. Cheong, P. Kindermann, C. Knauer, and F. Stehn. JoCG, 9 (1): 312-327 (2018)Brief Announcement: Approximation Schemes for Geometric Coverage Problems.S. Chaplick, M. De, A. Ravsky, and J. Spoerhase. ICALP, volume 107 of LIPIcs, page 107:1-107:4. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Placing your Coins on a Shelf.H. Alt, K. Buchin, S. Chaplick, O. Cheong, P. Kindermann, C. Knauer, and F. Stehn. ISAAC, volume 92 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Stabbing Polygonal Chains with Rays is Hard to Approximate.S. Chaplick, E. Cohen, and G. Morgenstern. CCCG, Carleton University, Ottawa, Canada, (2013)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)