The following pages link to Torsten Tholey (Q306255):
Displaying 14 items.
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- Solving the 2-disjoint paths problem in nearly linear time (Q2432525) (← links)
- (Q2762514) (← links)
- Approximation Algorithms for Intersection Graphs (Q3588413) (← links)
- The Complexity of Minimum Convex Coloring (Q3596703) (← links)
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem (Q3599102) (← links)
- Algorithms and Computation (Q5191685) (← links)
- STACS 2004 (Q5309713) (← links)
- (Q5743430) (← links)
- The k-Disjoint Paths Problem on Chordal Graphs (Q5851105) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897566) (← links)