The first CIRM workshop on Graph Decomposition was held at the CIRM (Marseille, France) from April 9 to April 13, 2008. It is the first workshop of a series organized at the CIRM.
This workshop on graph decompositions aims at gathering researchers from different communities such as graph theory, logical theory, algorithmic theory. The objective is to stimulate discussions and informal peer to peer meetings or working session. The daily program will thus be organized in a morning and an evening session, letting free afternoons. Each session will contain a plenary talk and few contributed talks.
Plenary speakers:
- S.I Oum “Finding branch-decomposition and rank-decompositions“
- H. Bodlaender “Algorithms for finding tree decompositions…“
- M. Fellows “What about trees ? …“
- D. Thilikos “Bidimensionality, decompositions and subexponential parameterized algorithms“
- D. Kratsch “Fast exponential algorithms…“
- J. Makowsky “Connection matrices of numeric graph invariants“
- F. Fomin “Parameterized algorithms for partial covering problems“
- B. Courcelle “Labelling schemes for solving FO and MSO queries…”
Scientific committee: Bruno Courcelle (Université Bordeaux 1), Michel Habib (Université Montpellier 2), Christophe Paul (CNRS, Université Montpellier 2)
