© 2005

Graph-Theoretic Concepts in Computer Science

30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004. Revised Papers

  • Juraj Hromkovič
  • Manfred Nagl
  • Bernhard Westfechtel
Conference proceedings WG 2004

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

Table of contents

  1. Front Matter
  2. Invited Papers

    1. Roger Wattenhofer
      Pages 20-32
  3. Graph Algorithms: Trees

    1. Shin-ichi Nakano, Takeaki Uno
      Pages 33-45
    2. Sabine Cornelsen, Gabriele Di Stefano
      Pages 46-57
    3. Jiří Fiala, Petr A. Golovach, Jan Kratochvíl
      Pages 58-67
    4. Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
      Pages 68-80
  4. Graph Algorithms: Recognition and Decomposition

    1. Hans L. Bodlaender, Arie M. C. A. Koster
      Pages 81-92
    2. Christophe Crespelle, Christophe Paul
      Pages 93-104
    3. Stavros D. Nikolopoulos, Leonidas Palios
      Pages 105-116
    4. Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe
      Pages 117-128
    5. Michaël Rao
      Pages 129-141
  5. Graph Algorithms: Various Problems

  6. Optimization and Approximation Algorithms

    1. Hajo J. Broersma, Daniel Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger
      Pages 189-200
    2. Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
      Pages 201-213
    3. Tim Nieberg, Johann Hurink, Walter Kern
      Pages 214-221
    4. Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen
      Pages 222-234

About these proceedings


During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment.


Graph algorithms bioinformatics combinatorics complexity computer computer science optimization

Editors and affiliations

  • Juraj Hromkovič
    • 1
  • Manfred Nagl
    • 2
  • Bernhard Westfechtel
    • 3
  1. 1.Department of Computer ScienceETH Zurich, ETH ZentrumZurichSwitzerland
  2. 2.Department of Computer ScienceRWTH Aachen, Chair of Computer Science IIIAachenGermany
  3. 3.Department of Computer Science IIIRWTH Aachen UniversityAachenGermany

Bibliographic information

Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking