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

Contact Graphs of Circular Arcs.

M. Alam, D. Eppstein, M. Kaufmann, S. Kobourov, S. Pupyrev, A. Schulz, and T. Ueckerdt. WADS, volume 9214 of Lecture Notes in Computer Science, page 1-13. Springer, (2015)

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.

Torsten Gieß University of Stuttgart

Torsten Boldt University of Stuttgart

Dr. -Ing. Torsten Methling University of Stuttgart

Univ. -Prof. Dr. phil. Torsten Hoffmann University of Stuttgart

Other publications of authors with the same name

Local and Union Boxicity.T. Bläsius, P. Stumpf, and T. Ueckerdt. CoRR, (2016)On Semantic Word Cloud RepresentationL. Barth, S. Kobourov, S. Pupyrev, and T. Ueckerdt. CoRR, (2013)Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths.M. Axenovich, T. Ueckerdt, and P. Weiner. CoRR, (2015)Making Octants Colorful and Related Covering Decomposition Problems.J. Cardinal, K. Knauer, P. Micek, and T. Ueckerdt. SIAM J. Discrete Math., 28 (4): 1948-1959 (2014)Spectrum of mixed bi-uniform hypergraphs.M. Axenovich, E. Cherubini, and T. Ueckerdt. CoRR, (2014)Three ways to cover a graph.K. Knauer, and T. Ueckerdt. Discrete Mathematics, 339 (2): 745-758 (2016)The Number of Crossings in Multigraphs with No Empty Lens.M. Kaufmann, J. Pach, G. Tóth, and T. Ueckerdt. Graph Drawing, volume 11282 of Lecture Notes in Computer Science, page 242-254. Springer, (2018)Contact Graphs of Circular Arcs.M. Alam, D. Eppstein, M. Kaufmann, S. Kobourov, S. Pupyrev, A. Schulz, and T. Ueckerdt. WADS, volume 9214 of Lecture Notes in Computer Science, page 1-13. Springer, (2015)Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs.P. Angelini, M. Bekos, M. Kaufmann, M. Pfister, and T. Ueckerdt. ISAAC, volume 123 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Induced and weak induced arboricities.M. Axenovich, P. Dörr, J. Rollin, and T. Ueckerdt. Discrete Mathematics, 342 (2): 511-519 (2019)