Supported by a grant of
proRWTH - Freunde und Förderer der RWTH Aachen e. V.

TACO DAY June'10

A one-day workshop on Treewidth and Combinatorial Optimization.

Date and Location

Thursday, June 10, 2010, 11am - 6pm
RWTH Aachen University
Super-C, Templergraben 55, Aachen.
Room: Ford-Saal, Room No. 637, 6. OG (=7th floor)

Travel Directions

Call for Talks

Talks of 20-30 minutes about one of the following topics are invited (we are still looking for speakers!): If you want to give a talk then please send an e-mail to the organizers.


Participation is free and lunch/dinner are included. After the workshop there will be a workshop dinner at a restaurant (place: TBA).

It would be easier for us to make the necessary arrangements for lunch and dinner if we knew of your plans early. So we would appreciate it if you let us know as soon as possible whether you plan to attend, by sending an e-mail to Please indicate whether you participate in the dinner, and if so whether you have special dietary requirements.

Registered Participants

André Berger, Maastricht University
Tobias Brunsch, Maastricht University
Viktor Engelmann, RWTH Aachen
Hans Ensinck, Maastricht University
Alexander Grigoriev, Maastricht University
Martin Hoefer, RWTH Aachen
Stan van Hoesel, Maastricht University
Bart Jansen, Utrecht University
Joachim Kneis, RWTH Aachen
Alexander Langer, RWTH Aachen
Erik Jan van Leeuwen, University of Bergen
Tobias Mueller, CWI Amsterdam
Felix Reidl, RWTH Aachen
Heiko Röglin, Maastricht University
Peter Rossmanith, RWTH Aachen
Cyriel Rutten, Maastricht University
Fernando Sanchez, RWTH Aachen
Somnath Sikdar, RWTH Aachen
Alexander Skopalik, RWTH Aachen
Luite Stegeman, Utrecht University
Natalya Usotskaya, Maastricht University
Tjark Vredeveld, Maastricht University

Tentative Programme

11:00 - 11:15 Opening
11:15 - 11:55 Bart Jansen: Polynomial Kernels for Hard Problems on Disk Graphs
11:55 - 12:35 Martin Hoefer: Combinatorial Auctions for Secondary Spectrum Markets
12:35 - 13:30 Lunch and Coffee
13:30 - 14:10 H. Ensinck, A. Grigoriev, N.Usotskaya: New/old ideas for the first LP-based logarithmic approximation of the treewidth
14:10 - 14:50 Tobias Mueller: Line arrangements and geometric graph classes
14:50 - 15:20 Coffee Break
15:20 - 16:00 Somnath Sikdar: Are there any good digraph width measures?
16:00 - 16:40 Cyriel Rutten: Bounding SEPT in Bayesian Scheduling
16:40 - 17:10 Open Problems Session
17:30 walk to restaurant
18:00 Dinner

Travel Directions

View TACO Day 2010 in a larger map


Alexander Langer
Joachim Kneis