Thema |
Student |
Betreuer |
Combinatorial Optimization on graphs of bounded treewidth [Bodlaender and Koster (2008)] |
tba |
tba |
Edge dominating set and colorings on graphs with fixed clique-width [Kobler, Rotics (2003)]
|
tba |
tba |
Tour merging via branch-decomposition [Cook and Seymour (2003)] |
tba |
tba |
On Integer Programming and the Branch-Width of the constraint matrix [Cunningham and Geelen (2007)] |
tba |
tba |
Dominating sets in planar graphs: Branch-Width and exponential speed-up [Fomin and Thilikos (2003)] |
tba |
tba |
Call Routing and the Ratcatcher [Seymour and Thomas (1994)] |
tba |
tba |
Finding Branch-Decompositions and Rank-Decompositions [Oum and Hlineny (2008)] |
tba |
tba |
Treewidth Computations I: Upper Bounds [Bodlaender and Koster (2010)] |
tba |
tba |
Treewidth Computations II. Lower Bounds [Bodlaender and Koster (2011)] |
tba |
tba |
On exact algorithms for treewidth [Bodlaender et al. (2012)] |
tba |
tba |