Graph-Theoretic Concepts in Computer Science

27th InternationalWorkshop, WG 2001 Boltenhagen, Germany, June 14–16, 2001 Proceedings

  • Andreas Brandstädt
  • Van Bang Le
Conference proceedings WG 2001

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

Table of contents

  1. Front Matter
    Pages I-X
  2. Friedhelm Meyer auf der Heide
    Pages 8-8
  3. Sergei L. Bezrukov, Robert Elsässer
    Pages 9-20
  4. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Pino Persiano, Hervé Rivano
    Pages 21-31
  5. Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
    Pages 32-43
  6. Maw-Shang Chang, Haiko Müller
    Pages 44-54
  7. Serafino Cicerone, Gianluca D’Ermiliis, Gabriele Di Stefano
    Pages 66-77
  8. Derek G. Corneil, Udi Rotics
    Pages 78-90
  9. Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
    Pages 91-102
  10. Wolfgang Espelage, Frank Gurski, Egon Wanke
    Pages 117-128
  11. Guillaume Fertin, André Raspaud, Bruce Reed
    Pages 140-153
  12. Jiří Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
    Pages 154-165
  13. Fedor V. Fomin, Hans L. Bodlaender
    Pages 166-176
  14. Fedor V. Fomin, Dimitrios M. Thilikos
    Pages 177-188
  15. Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth
    Pages 189-200
  16. Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena
    Pages 201-216

About these proceedings

Introduction

This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001.
The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.

Keywords

Approximation Computational Discrete Mathematics Computational Geometry Geometric Algorithms Graph Graph Coloring Graph Drawing Network Algoritms Optimization algorithms computer computer science

Editors and affiliations

  • Andreas Brandstädt
    • 1
  • Van Bang Le
    • 1
  1. 1.Department of Computer ScienceUniversity of RostockRostockGermany

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45477-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42707-0
  • Online ISBN 978-3-540-45477-9
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors
Electronics
Telecommunications
Aerospace