|
2nd
Workshop on Graph
Decompositions
Theoretical,
Algorithmic and
Logical
Aspects
October 18-22, 2010
CIRM,
Luminy, Marseille (France)
This workshop on graph
decompositions aims at gathering researchers from different
communities such as graph theory, logical theory, algorithmic theory.
Few themes have been proposed (not excluding other topics):
- Excluded minors and width notions,
- Implementation of verification of MSO properties,
- Labelling Schemes based on graph decompositions,
- Effcient graph decomposition algorithms,
- Generalization of modular decomposition and related notions,
- Graph decomposition and logic in fixed parameterized complexity.
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.
Confirmed invited speakers (more to be announced soon)
- Isolde Alder (Goether University Frankfurt, Germany)
- Ken-ichi Kawarabayashi (National Institue of Informatics, Japan)
- Stefan Kreutzer (University of Oxford, England)
- Alexander Langer (RWTH Aachen, Germany)
- Daniel Lokshtanov (Bergen University, Norway)
- Jaroslav Nesetril (Charles University, Prague, Czech Republic)
- Patrice Ossona de Mendez (CNRS, CAMS, Paris, France)
- Nicolas Trotignon (CNRS, LIAFA, France)
Scientific committee
Important dates
- Contributed talks submission deadline: June 30th, 2010
- Registration deadline: June 30th, 2010
Practical informations
The workshop will be organized at the CIRM
at Marseille. CIRM facilities include conference rooms, library,
housing, restaurant... It is located on Luminy campus close to the
famous calanques de Marseille area.
|