Dagstuhl-Seminar 01251
Graph Decompositions and Algorithmic Applications
( 17. Jun – 22. Jun, 2001 )
(zum Vergrößern in der Bildmitte klicken)
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/01251
Organisatoren
- Andreas Brandstädt (Universität Rostock, DE)
- Jeremy P. Spinrad (Vanderbilt University, US)
Kontakt
The main goal of this seminar is to bring together experts working in various areas of graph decomposition. Given the fast advances in graph decompositions that we have witnessed in the past few years, we believe that it is very important to offer researchers in graph decomposition a forum for the exchange of ideas in the relaxed workshop-like atmosphere that Dagstuhl can offer.
We anticipate strong interaction and a very healthy exchange of ideas that is likely to result in successful applications of graph (and other) decomposition methods to the design of efficient algorithms, and it will have the following aims:
- extending known graph decompositions such as the modular, the primeval and the homogeneous decomposition
- new structural insights by studying graph decomposition
- extending results on the tree structure of graphs and using such results for the design of efficient algorithms
- new results on the P4 structure of graphs and decompositions related to this concept such as the investigation of p-connected components
- exchange of information on recent research and stimulation of further research in the direction of graph decompositions and its algorithmic applications.
- Anne Berry (University Blaise Pascal - Aubiere, FR)
- Vincent Bouchitté (ENS - Lyon, FR)
- Andreas Brandstädt (Universität Rostock, DE) [dblp]
- Kathie Cameron (Wilfrid Laurier University, CA) [dblp]
- Derek G. Corneil (University of Toronto, CA) [dblp]
- Elias Dahlhaus (DB Systems GmbH - Frankfurt, DE) [dblp]
- Celina de Figueiredo (University of Rio de Janeiro, BR)
- Fabien de Montgolfier (University of Montpellier 2, FR)
- Ernst de Ridder (Universität Rostock, DE)
- Feodor F. Dragan (Kent State University, US)
- Elaine M. Eschen (West Virginia University - Morgantown, US)
- Martin Charles Golumbic (University of Haifa, IL) [dblp]
- Jens Gustedt (INRIA Lorraine - Nancy, FR)
- Ryan Hayward (University of Alberta - Edmonton, CA)
- Chinh T. Hoàng (Wilfrid Laurier University, CA) [dblp]
- Wilfried Imrich (Montan-Universität Leoben, AT)
- Öjvind Johansson (University of California - San Diego, US)
- Ton Kloks (University of Lethbridge, CA)
- Ekkehard Köhler (TU Berlin, DE) [dblp]
- Dieter Kratsch (University of Metz, FR) [dblp]
- Jean Marc Lanlignel (University of Montpellier 2, FR)
- Van Bang Le (Universität Rostock, DE) [dblp]
- Chuan-Min Lee (National Chung Cheng Univ. - Chai-yi, TW)
- Frédéric Maffray (IMAG - Grenoble, FR) [dblp]
- Haiko Müller (University of Leeds, GB) [dblp]
- Christophe Paul (University of Montpellier 2, FR) [dblp]
- Jeremy P. Spinrad (Vanderbilt University, US)
- R. Sritharan (University of Dayton, US)
- Lorna K. Stewart (University of Alberta - Edmonton, CA)
- Jayme L. Szwarcfiter (Federal University - Rio de Janeiro, BR)
- Thomas Szymczak (Universität Rostock, DE)
- Ioan Todinca (University of Orleans, FR) [dblp]
- Jean-Marie Vanherpe (University of Amiens, FR)
- Egon Wanke (Heinrich-Heine-Universität Düsseldorf, DE)
Verwandte Seminare
- Dagstuhl-Seminar 99231: Graph Decompositions and Algorithmic Applications (1999-06-06 - 1999-06-11) (Details)
- Dagstuhl-Seminar 04221: Robust and Approximative Algorithms on Particular Graph Classes (2004-05-23 - 2004-05-28) (Details)
- Dagstuhl-Seminar 07211: Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes (2007-05-20 - 2007-05-25) (Details)
- Dagstuhl-Seminar 11182: Exploiting graph structure to cope with hard problems (2011-05-01 - 2011-05-06) (Details)
- Dagstuhl-Seminar 14071: Graph Modification Problems (2014-02-09 - 2014-02-14) (Details)
