Graph-Theoretic Concepts in Computer Science

26th International Workshop, WG 2000 Konstanz, Germany, June 15–17, 2000 Proceedings

  • Ulrik Brandes
  • Dorothea Wagner

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

Table of contents

  1. Front Matter
    Pages I-X
  2. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Pages 13-22
  3. Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
    Pages 23-34
  4. Sandeep Bhatt, Shimon Even, David Greenberg, Rafi Tayar
    Pages 35-46
  5. Gianfranco Bilardi, Andrea Pietracaprina, Paolo D’Alberto
    Pages 47-58
  6. Vincent Bouchitté, Ioan Todinca
    Pages 59-70
  7. Andreas Brandstädt, Van Bang Le
    Pages 71-82
  8. Edson Cáceres, Albert Chan, Frank Dehne, Giuseppe Prencipe
    Pages 83-94
  9. Serafino Cicerone, Gabriele Di Stefano
    Pages 95-106
  10. Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
    Pages 116-126
  11. Michael J. Dinneen, Bakhadyr Khoussainov
    Pages 127-136
  12. Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrťo
    Pages 149-160
  13. Fedor Fomin, Dieter Kratsch, Haiko Müller
    Pages 161-171
  14. Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
    Pages 172-183
  15. Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
    Pages 184-195
  16. Frank Gurski, Egon Wanke
    Pages 196-205

About these proceedings

Introduction

The 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) was held at Waldhaus Jakob, in Konstanz, Germany, on 15{ 17 June 2000. It was organized by the Algorithms and Data Structures Group of the Department of Computer and Information Science, University of K- stanz, and sponsored by Deutsche Forschungsgemeinschaft (DFG) and Univ- sit¨atsgesellschaft Konstanz. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions for future research. The workshop looks back on a remarkable tradition of more than a quarter of a century. Previous Workshops have been organized in various places in Europe, and submissions come from all over the world. This year, 57 attendees from 13 di erent countries gathered in the relaxing atmosphere of Lake Constance, also known as the Bodensee. Out of 51 submis- ons, the program committee carefully selected 26 papers for presentation at the workshop. This selection re?ects current research directions, among them graph and network algorithms and their complexity, algorithms for special graph cl- ses, communication networks, and distributed algorithms. The present volume contains these papers together with the survey presented in an invited lecture by Ingo Wegener (University of Dortmund) and an extended abstract of the invited lecture given by Emo Welzl (ETH Zuric ¨ h).

Keywords

Graph algorithms approximation computational discrete mathematics computational geometry computer computer science geometric algorithms graph coloring graph drawing network algorithms optimization

Editors and affiliations

  • Ulrik Brandes
    • 1
  • Dorothea Wagner
    • 1
  1. 1.Department of Computer and Information ScienceUniversity of KonstanzKonstanzGermany

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-40064-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-41183-3
  • Online ISBN 978-3-540-40064-6
  • Series Print ISSN 0302-9743
  • About this book