CONFERENCE
International Workshop on Graph Decomposition
January 19  23, 2015
January 19  23, 2015
Graph Decomposition methods offer a powerful paradigm to graph theorists but also to combinatorial algorithmic designers. A milestone example is the theory of width parameters and the associated decompositions at the origin of major steps in the proof of Wagner’s conjecture on graph minors. This theory also provided the foundations of new algorithmic paradigm and led to major metaalgorithmic results in the context of model checking, parameterized complexity or kernelization.
The goals of the workshop are to discuss and exchange on recent developments on graph decomposition methods from the view points of graph theory, algorithmic theory, complexity and logics. Among the thematics of the workshop we may find new decomposition for graph classes defined by forbidden induced subgraphs, graph decompositions for topological minor free graphs, algorithmic consequences of new decomposition techniques… 
Scientific & Organizing Committee
Stephan Kreutzer (University of Berlin) Christophe Paul (Université Montpellier II) Nicolas Trotignon (ENS Lyon) Paul Wollan (University of Rome) Speakers
