Torsten Tholey

According to our database, Torsten Tholey authored at least 12 papers between 2001 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2014

Approximation Algorithms for Intersection Graphs.

Frank Kammer, Torsten Tholey

Algorithmica, 2014

2012

Linear time algorithms for two disjoint paths problems on directed acyclic graphs.

Torsten Tholey

Theor. Comput. Sci., 2012

Approximate tree decompositions of planar graphs in linear time.

Frank Kammer, Torsten Tholey

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010

Approximation Algorithms for Intersection Graphs.

Frank Kammer, Torsten Tholey, Heiko Voepel

Proceedings of the Approximation, 2010

2009

The k-Disjoint Paths Problem on Chordal Graphs.

Frank Kammer, Torsten Tholey

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Improved Algorithms for the 2-Vertex Disjoint Paths Problem.

Torsten Tholey

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2008

The Complexity of Minimum Convex Coloring.

Frank Kammer, Torsten Tholey

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Effiziente Algorithmen und Datenstrukturen zur Berechnung zweier disjunkter Pfade.

Torsten Tholey

PhD thesis, 2007

2005

Finding Disjoint Paths on Directed Acyclic Graphs.

Torsten Tholey

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004

Solving the 2-Disjoint Paths Problem in Nearly Linear Time.

Torsten Tholey

Proceedings of the STACS 2004, 2004

2003

A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs.

Torsten Tholey

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001

Efficient Minimal Perfect Hashing in Nearly Minimal Space.

Torben Hagerup, Torsten Tholey

Proceedings of the STACS 2001, 2001