Torsten Tholey

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Approximate tree decompositions of planar graphs in linear time	2019-05-10	Paper
Approximate tree decompositions of planar graphs in linear time Theoretical Computer Science	2016-08-31	Paper
Approximation algorithms for intersection graphs Algorithmica	2014-12-02	Paper
Linear time algorithms for two disjoint paths problems on directed acyclic graphs Theoretical Computer Science	2013-01-07	Paper
The complexity of minimum convex coloring Discrete Applied Mathematics	2012-05-11	Paper
Approximation algorithms for intersection graphs Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2010-09-10	Paper
The \(k\)-disjoint paths problem on chordal graphs Graph-Theoretic Concepts in Computer Science	2010-01-21	Paper
Algorithms and Computation Lecture Notes in Computer Science	2009-08-07	Paper
Improved Algorithms for the 2-Vertex Disjoint Paths Problem Lecture Notes in Computer Science	2009-02-03	Paper
The Complexity of Minimum Convex Coloring Algorithms and Computation	2009-01-29	Paper
STACS 2004 Lecture Notes in Computer Science	2007-10-01	Paper
Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science	2006-11-01	Paper
Solving the 2-disjoint paths problem in nearly linear time Theory of Computing Systems	2006-10-25	Paper
scientific article; zbMATH DE number 1688373 (Why is no real title available?)	2002-01-09	Paper

Research outcomes over time

This page was built for person: Torsten Tholey