Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Tholey, Torsten"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for intersection graphs
Frank Kammer
,
Torsten Tholey
Algorithmica
68
(2), 2014, pp. 312-336
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Torsten Tholey
Theoretical Computer Science
465
, 2012, pp. 35-48
The
k
-disjoint paths problem on chordal graphs
Frank Kammer
,
Torsten Tholey
Lecture Notes in Computer Science
5911
, 2010, pp. 190-201
The complexity of minimum convex coloring
Frank Kammer
,
Torsten Tholey
Lecture Notes in Computer Science
5369
, 2008, pp. 16-27
Solving the 2-disjoint paths problem in nearly linear time
Torsten Tholey
Theory of Computing Systems
39
(1), 2006, pp. 51-78
Finding disjoint paths on directed acyclic graphs
Torsten Tholey
Lecture Notes in Computer Science
3787
, 2005, pp. 319-330
Solving the 2-disjoint paths problem in nearly linear time
Torsten Tholey
Lecture Notes in Computer Science
2996
, 2004, pp. 350-361
A dynamic data structure for maintaining disjoint paths information in digraphs
Torsten Tholey
Lecture Notes in Computer Science
2906
, 2003, pp. 565-574
Efficient minimal perfect hashing in nearly minimal space
Torben Hagerup
,
Torsten Tholey
Lecture Notes in Computer Science
2010
, 2001, pp. 317-326