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. Front Matter
  2. Invited Talks

  3. Regular Talks

    1. Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen
      Pages 3-14
    2. Marcin Kamiński
      Pages 15-26
    3. Kyriaki Ioannidou, Stavros D. Nikolopoulos
      Pages 27-38
    4. Petr A. Golovach, Dieter Kratsch, Jean-Francois Couturier
      Pages 39-50
    5. Tamás Fleiner
      Pages 51-62
    6. Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
      Pages 63-74
    7. Pinar Heggernes, Pim van ’t Hof, Daniel Lokshtanov, Jesper Nederlof
      Pages 75-87
    8. Mathieu Liedloff, Ioan Todinca, Yngve Villanger
      Pages 88-99
    9. Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
      Pages 100-111
    10. Ge Xia, Yong Zhang
      Pages 112-122
    11. Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances Rosamond, Sue Whitesides et al.
      Pages 123-134
    12. Karin Arikushi, Radoslav Fulek, Baláazs Keszegh, Filip Morić, Csaba D. Tóth
      Pages 135-146
    13. Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk
      Pages 147-158
    14. Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle
      Pages 159-170
    15. Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle
      Pages 171-183
    16. Konrad Dabrowski, Vadim Lozin, Rajiv Raman, Bernard Ries
      Pages 184-195
    17. Geevarghese Philip, Venkatesh Raman, Yngve Villanger
      Pages 196-207

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