| 2009 |
|---|
| 7 | EE | Torsten Tholey:
Improved Algorithms for the 2-Vertex Disjoint Paths Problem.
SOFSEM 2009: 546-557 |
| 2008 |
|---|
| 6 | EE | Frank Kammer,
Torsten Tholey:
The Complexity of Minimum Convex Coloring.
ISAAC 2008: 16-27 |
| 2006 |
|---|
| 5 | EE | Torsten Tholey:
Solving the 2-Disjoint Paths Problem in Nearly Linear Time.
Theory Comput. Syst. 39(1): 51-78 (2006) |
| 2005 |
|---|
| 4 | EE | Torsten Tholey:
Finding Disjoint Paths on Directed Acyclic Graphs.
WG 2005: 319-330 |
| 2004 |
|---|
| 3 | EE | Torsten Tholey:
Solving the 2-Disjoint Paths Problem in Nearly Linear Time.
STACS 2004: 350-361 |
| 2003 |
|---|
| 2 | EE | Torsten Tholey:
A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs.
ISAAC 2003: 565-574 |
| 2001 |
|---|
| 1 | EE | Torben Hagerup,
Torsten Tholey:
Efficient Minimal Perfect Hashing in Nearly Minimal Space.
STACS 2001: 317-326 |
