Torsten Tholey

16 papers A* 1A 2B 5Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2016 J jnl
Approximate tree decompositions of planar graphs in linear time.
Theor. Comput. Sci.
Frank Kammer, Torsten Tholey
2014 J jnl
Approximation Algorithms for Intersection Graphs.
Algorithmica
Frank Kammer, Torsten Tholey
2012 A* conf
Approximate tree decompositions of planar graphs in linear time.
SODA
Frank Kammer, Torsten Tholey
2012 J jnl
Linear time algorithms for two disjoint paths problems on directed acyclic graphs.
Theor. Comput. Sci.
Torsten Tholey
2012 J jnl
The complexity of minimum convex coloring.
Discret. Appl. Math.
Frank Kammer, Torsten Tholey
2011 J jnl
Approximate Tree Decompositions of Planar Graphs in Linear Time
CoRR
Frank Kammer, Torsten Tholey
2010 — conf
Approximation Algorithms for Intersection Graphs.
APPROX-RANDOM
Frank Kammer, Torsten Tholey, Heiko Voepel
2009 B conf
Improved Algorithms for the 2-Vertex Disjoint Paths Problem.
SOFSEM
Torsten Tholey
2009 B conf
The k-Disjoint Paths Problem on Chordal Graphs.
WG
Frank Kammer, Torsten Tholey
2008 B conf
The Complexity of Minimum Convex Coloring.
ISAAC
Frank Kammer, Torsten Tholey
2007 — —
Effiziente Algorithmen und Datenstrukturen zur Berechnung zweier disjunkter Pfade.
Torsten Tholey
2006 J jnl
Solving the 2-Disjoint Paths Problem in Nearly Linear Time.
Theory Comput. Syst.
Torsten Tholey
2005 B conf
Finding Disjoint Paths on Directed Acyclic Graphs.
WG
Torsten Tholey
2004 A conf
Solving the 2-Disjoint Paths Problem in Nearly Linear Time.
STACS
Torsten Tholey
2003 B conf
A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs.
ISAAC
Torsten Tholey
2001 A conf
Efficient Minimal Perfect Hashing in Nearly Minimal Space.
STACS
Torben Hagerup, Torsten Tholey