Graph-Theoretic Concepts in Computer Science

35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers

  • Christophe Paul
  • Michel Habib
Conference proceedings WG 2009

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5911)

Table of contents

  1. Front Matter
  2. Zdeněk Dvořák, Daniel Král’
    Pages 17-32
  3. Ilia Averbouch, Johann A. Makowsky, Peter Tittmann
    Pages 33-43
  4. Hajo Broersma, Fedor V. Fomin, Pim van ’t Hof, Daniël Paulusma
    Pages 44-53
  5. Gruia Călinescu, Cristina G. Fernandes, Hemanshu Kaul
    Pages 54-65
  6. Shiri Chechik, David Peleg
    Pages 66-76
  7. Christophe Crespelle
    Pages 77-87
  8. Michael R. Fellows, Jiong Guo, Iyad A. Kanj
    Pages 88-99
  9. Henning Fernau, Serge Gaspers, Daniel Raible
    Pages 100-111
  10. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
    Pages 112-121
  11. Rajiv Gandhi, Bradford Greening Jr., Sriram Pemmaraju, Rajiv Raman
    Pages 122-132
  12. Petr A. Golovach, Jan Kratochvíl, Ondřej Suchý
    Pages 133-142
  13. Alexander Grigoriev, René Sitters
    Pages 143-153
  14. Frank Gurski, Egon Wanke
    Pages 166-177
  15. Frank Kammer, Torsten Tholey
    Pages 190-201
  16. Iyad A. Kanj, Andreas Wiese, Fenghui Zhang
    Pages 202-213
  17. Mamadou Moustapha Kanté, Michaël Rao
    Pages 214-225

About these proceedings


This book constitutes the thoroughly refereed post-conference proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, held in Montpellier, France, in June 2009.

The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 69 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.


Graph algorithms chordal graphs claw-free graphs complexity computational geometry edge colorings graph algorithms graph partitioning k-disjoint graph problem minimum spanning trees modeling planar graphs switch graphs

Editors and affiliations

  • Christophe Paul
    • 1
  • Michel Habib
    • 2
  1. 1.CNRS - LIRMMMontpellier Cedex 5France
  2. 2.LIAFA, case 7014, Université Paris DiderotParis Cedex 13France

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-11408-3
  • Online ISBN 978-3-642-11409-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book