Torsten Tholey

Publication Activity (10 Years)

Years Active: 2001-2016
Publications (10 Years): 1

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

SODA

Algorithmica

University of Augsburg (PHD)

Education History

University of Augsburg

PHD

Publications

Frank Kammer, Torsten Tholey
Approximate tree decompositions of planar graphs in linear time. Theor. Comput. Sci. 645 (2016)
Frank Kammer, Torsten Tholey
Approximation Algorithms for Intersection Graphs. Algorithmica 68 (2) (2014)
Torsten Tholey
Linear time algorithms for two disjoint paths problems on directed acyclic graphs. Theor. Comput. Sci. 465 (2012)
Frank Kammer, Torsten Tholey
The complexity of minimum convex coloring. Discret. Appl. Math. 160 (6) (2012)
Frank Kammer, Torsten Tholey
Approximate tree decompositions of planar graphs in linear time. SODA (2012)
Frank Kammer, Torsten Tholey
Approximate Tree Decompositions of Planar Graphs in Linear Time CoRR (2011)
Frank Kammer, Torsten Tholey, Heiko Voepel
Approximation Algorithms for Intersection Graphs. APPROX-RANDOM (2010)
Torsten Tholey
Improved Algorithms for the 2-Vertex Disjoint Paths Problem. SOFSEM (2009)
Frank Kammer, Torsten Tholey
The k-Disjoint Paths Problem on Chordal Graphs. WG (2009)
Frank Kammer, Torsten Tholey
The Complexity of Minimum Convex Coloring. ISAAC (2008)
Torsten Tholey
Solving the 2-Disjoint Paths Problem in Nearly Linear Time. Theory Comput. Syst. 39 (1) (2006)
Torsten Tholey
Finding Disjoint Paths on Directed Acyclic Graphs. WG (2005)
Torsten Tholey
Solving the 2-Disjoint Paths Problem in Nearly Linear Time. STACS (2004)
Torsten Tholey
A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs. ISAAC (2003)
Torben Hagerup, Torsten Tholey
Efficient Minimal Perfect Hashing in Nearly Minimal Space. STACS (2001)

Torsten Tholey.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Torsten Tholey