Graph-Theoretic Concepts in Computer Science

37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers

  • Petr Kolman
  • Jan Kratochvíl
Conference proceedings WG 2011

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

Table of contents

  1. Front Matter
  2. Alberto Marchetti-Spaccamela
    Pages 1-4
  3. Liliana Alcón, Luerbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
    Pages 11-22
  4. Felix Arends, Joël Ouaknine, Charles W. Wampler
    Pages 23-34
  5. Christopher Auer, Andreas Gleißner
    Pages 35-46
  6. Hans L. Bodlaender, Dieter Kratsch
    Pages 59-70
  7. Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger
    Pages 71-82
  8. Ondřej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec
    Pages 83-94
  9. Katarína Cechlárová, Eva Jelínková
    Pages 95-106
  10. Christine Cheng, Eric McDermid, Ichiro Suzuki
    Pages 107-118
  11. Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
    Pages 119-130
  12. Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Ildikó Schlotter
    Pages 131-142
  13. Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
    Pages 143-154
  14. Holger Flier, Matúš Mihalák, Peter Widmayer, Anna Zych
    Pages 155-166
  15. Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
    Pages 167-178
  16. Magnús M. Halldórsson, Sergey Kitaev, Artem Pyatkin
    Pages 191-202
  17. Toru Hasunuma, Hiroshi Nagamochi
    Pages 203-214

About these proceedings


This book constitutes the revised selected papers of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, held at Teplá Monastery, Czech Republic, in June 2011.
The 28 revised papers presented were carefully reviewed and selected from 52 submissions. The workshop aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, and by extracting new graph theoretic problems from applications.


NP-completeness combinatorial game parameterized complexity split graphs topological graph

Editors and affiliations

  • Petr Kolman
    • 1
  • Jan Kratochvíl
    • 1
  1. 1.KAM MFF UK, Charles UniversityPraha 1Czech Republic

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-25869-5
  • Online ISBN 978-3-642-25870-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Energy, Utilities & Environment