29. WG 2003:
Elspeet, The Netherlands
Michael R. Fellows
: Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT.
Paul S. Bonsma
: The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.
: Complexity of Hypergraph Coloring and Seidel's Switching.
: Coloring Powers of Graphs of Bounded Clique-Width.