Graph-Theoretic Concepts in Computer Science

25th International Workshop, WG’99 Ascona, Switzerland, June 17–19, 1999 Proceedings

  • Peter Widmayer
  • Gabriele Neyer
  • Stephan Eidenbenz
Conference proceedings WG 1999

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

Table of contents

  1. Front Matter
    Pages I-XI
  2. Hartmut Noltemeier
    Pages 1-9
  3. D. Hauptmeier, S. O. Krumke, J. Rambau, H.-C. Wirth
    Pages 42-54
  4. Assaf Natanzon, Ron Shamir, Roded Sharan
    Pages 65-77
  5. Hans-Christoph Wirth, Jan Steffan
    Pages 78-89
  6. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Pages 101-109
  7. Öjvind Johansson
    Pages 110-121
  8. Benno Stein, Oliver Niggemann
    Pages 122-134
  9. Martin Charles Golumbic, Udi Rotics
    Pages 135-147
  10. Ljubomir Perković, Bruce Reed
    Pages 148-154
  11. Anne Berry, Jean-Paul Bordat, Olivier Cogis
    Pages 167-172
  12. Stefan Dobrev, Imrich Vrťo
    Pages 173-178
  13. Olivier Baudon, Guillaume Fertin, Ivan Havel
    Pages 179-190

About these proceedings

Keywords

Graph Graph computations Matching Matchings Partition Permutation algorithms approximation combinatorial optimization complexity computational geometry garph drawing geometry algorithms graph algorithms graph coloring

Editors and affiliations

  • Peter Widmayer
    • 1
  • Gabriele Neyer
    • 1
  • Stephan Eidenbenz
    • 1
  1. 1.Institute for Theoretical Computer Science ETH Zürich ETH ZentrumZürichSwitzerland

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-46784-X
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66731-5
  • Online ISBN 978-3-540-46784-7
  • Series Print ISSN 0302-9743
  • About this book