Graph Theoretic Concepts in Computer Science

36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers

  • Dimitrios M. Thilikos
Conference proceedings WG 2010

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

Table of contents

  1. Regular Talks

    1. Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro
      Pages 208-219
    2. Annabell Berger, Matthias Müller-Hannemann
      Pages 220-231
    3. René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
      Pages 232-243
    4. Dániel Marx, Ildikó Schlotter
      Pages 244-255
    5. Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato
      Pages 256-265
    6. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas
      Pages 266-278
    7. Robert Elsässer, Adrian Ogierman
      Pages 279-291
    8. Padmini Mukkamala, János Pach, Deniz Sarıöz
      Pages 292-303
    9. Colin McDiarmid, Tobias Müller
      Pages 315-323
    10. Jannik Matuschke, Britta Peis
      Pages 324-335
  2. Back Matter

About these proceedings

Introduction

The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zar´ os, Crete, Greece, June 28–30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japan, The Netherlands, Norway, Poland, Switzerland, the UK, and the USA) attended the conference. WG has a long tradition. Since 1975, WG has taken place 21 times in Germany, four times in The Netherlands, twice in Austria, twice in France and once in the Czech Republic, Greece, Italy, Norway, Slovakia, Switzerland, and the UK. WG aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, or by extracting new graph theoretic problems from applications. The goal is to presentemergingresearchresultsand to identify and exploredirections of future research.The conference is well-balanced with respect to established researchers and young scientists. There were 94 submissions, two of which where withdrawn before entering the review process. Each submission was carefully reviewed by at least 3, and on average 4.5, members of the Program Committee. The Committee accepted 28 papers, which makes an acceptance ratio of around 30%. I should stress that, due to the high competition and the limited schedule, there were papers that were not accepted while they deserved to be.

Keywords

Graph Hypergraph Matching algorithms broadcasting chordal graphs claw-free graphs clique-width cocomparability graphs complexity modeling

Editors and affiliations

  • Dimitrios M. Thilikos
    • 1
  1. 1.Department of MathematicsUniversity of AthensAthensGreece

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-16926-7
  • Copyright Information Springer Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-16925-0
  • Online ISBN 978-3-642-16926-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book