Graph-Theoretic Concepts in Computer Science

32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006 Revised Papers

  • Fedor V. Fomin
Conference proceedings WG 2006

DOI: 10.1007/11917496

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

Table of contents (31 papers)

  1. Front Matter
  2. Jiří Fiala, Jan Kratochvíl
    Pages 15-26
  3. Jan Foniok, Jaroslav Nešetřil, Claude Tardif
    Pages 27-36
  4. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
    Pages 58-67
  5. Masashi Kiyomi, Shuji Kijima, Takeaki Uno
    Pages 68-77
  6. Łukasz Kowalik
    Pages 90-101
  7. Yasuhiko Takenaga, Kenichi Higashide
    Pages 102-112
  8. Seok-Hee Hong, Hiroshi Nagamochi
    Pages 113-124
  9. Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz
    Pages 125-136
  10. Magnús M. Halldórsson, Ragnar K. Karlsson
    Pages 137-146
  11. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
    Pages 147-158
  12. Andrew R. Curtis, Clemente Izurieta, Benson Joeris, Scott Lundberg, Ross M. McConnell
    Pages 168-178
  13. David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    Pages 179-190
  14. J. A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin
    Pages 191-204
  15. Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
    Pages 205-216

About these proceedings

Introduction

The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) was held on the island of Sotra close to the city of Bergen on the west coast of Norway. The workshop was organized by the Algorithms Research Group at the Department of Informatics, University of Bergen, and it took place from June 22 to June 24. The 78 participants of WG 2006 came from the universities and research institutes of 17 di?erent countries. The WG 2006 workshop continues the series of 31 previous WG workshops. Since 1975,WG has taken place 20 times in Germany, four times in The Neth- lands, twice in Austria as well as oncein France,in Italy, in Slovakia,in Switz- land and in the Czech Republic, and has now been held for the ?rst time in Norway. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer s- ence, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The talks showed how recent researchresults from algorithmic graph theory can be used in computer science and which graph-theoreticquestions arisefrom new developments in computer science. There were two fascinating invited lectures by Hans Bodlaender (Utrecht, The Netherlands) and Tandy Warnow (Austin, USA).

Keywords

Algorithms Graph Graph theory Layout algorithm complexity computer computer science modeling

Editors and affiliations

  • Fedor V. Fomin
    • 1
  1. 1.Department of InformaticsUniversity of BergenBergenNorway

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-48381-6
  • Online ISBN 978-3-540-48382-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349