The TACO project
Treewidth and Combinatorial Optimization
The research project Treewidth and Combinatorial Optimization, is
in cooperation between the Institute for Information and Computing Sciences
of Utrecht University and the
Department of Quantitative Economics of Maastricht University, and
subsidized by NWO.
The project has approximately three meeting per year. In case you are
interested in joining us at one of the TACO meetings, or giving a talk on
a TACO-related topic at such a meeting, please let know.
Relevant papers - a selection of recent work
Emgad H. Bachoore, Hans L. Bodlaender.
New upper bound heuristics for treewidth.
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle.
Contraction and treewidth lower bounds.
Hans L. Bodlaender, Arie M. C. A. Koster.
Safe separators for treewidth.
Hans L. Bodlaender, Fedor V. Fomin.
Tree decompositions with small cost.
- Hans L.
Bodlaender, Arie M.C.A. Koster, Frank van den Eijkhof, Linda C. van der Gaag
Pre-processing for Triangulation of Probabilistic Networks.
- Arie M.C.A.
Koster, Hans L. Bodlaender, Stan P.M. van Hoesel.
Treewidth: Computational Experiments
- A.M.C.A. Koster,
S.P.M. van Hoesel, A.W.J. Kolen.
Solving Frequency Assignment Problems via Tree-Decomposition.
The project is headed by dr Hans
Bodlaender and prof dr Stan van Hoesel. Working in the project with full
support of NWO-EW are
MSc Emgad Bachoore,
Roel Bovendeerd, and Alexander Grigoriev.
The project is in cooperation with several other researchers.
If you want more information or have additional information for this webpage,
e-mail Hans Bodlaender: