Efficient Minimal Perfect Hashing in Nearly Minimal Space. - Torben Hagerup; Torsten Tholey (STACS, 2001)

A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs. - Torsten Tholey (ISAAC, 2003)

Finding Disjoint Paths on Directed Acyclic Graphs. - Torsten Tholey (WG, 2005)

Solving the 2-Disjoint Paths Problem in Nearly Linear Time. - Torsten Tholey (Theory Comput. Syst., 2006)

Effiziente Algorithmen und Datenstrukturen zur Berechnung zweier disjunkter Pfade. - Torsten Tholey (2007)

Improved Algorithms for the 2-Vertex Disjoint Paths Problem. - Torsten Tholey (SOFSEM, 2009)

The k-Disjoint Paths Problem on Chordal Graphs. - Frank Kammer; Torsten Tholey (WG, 2009)

Approximation Algorithms for Intersection Graphs. - Frank Kammer; Torsten Tholey; Heiko Voepel (APPROX-RANDOM, 2010)

The complexity of minimum convex coloring. - Frank Kammer; Torsten Tholey (Discret. Appl. Math., 2012)

Linear time algorithms for two disjoint paths problems on directed acyclic graphs. - Torsten Tholey (Theor. Comput. Sci., 2012)

Approximation Algorithms for Intersection Graphs. - Frank Kammer; Torsten Tholey (Algorithmica, 2014)

Approximate tree decompositions of planar graphs in linear time. - Frank Kammer; Torsten Tholey (Theor. Comput. Sci., 2016)