Table of contents

  1. Front Matter
  2. Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
    Pages 4-15
  3. Madhav V. Marathe, R. Ravi, R. Sundaram
    Pages 28-40
  4. Pierre Kelsen, Sanjeev Mahajan, Hariharan Ramesh
    Pages 41-52
  5. Barun Chandra, Magnús M. Halldórsson
    Pages 53-65
  6. R. Ravi, M. X. Goemans
    Pages 66-75
  7. Hoong Chuin Lau, Osamu Watanabe
    Pages 76-87
  8. Takao Asano, Takao Ono, Tomio Hirata
    Pages 100-111
  9. Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara
    Pages 112-123
  10. T. W. Lam, W. K. Sung, H. F. Ting
    Pages 124-135
  11. Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
    Pages 136-148
  12. David Fernández-Baca, Giora Slutzki, David Eppstein
    Pages 149-160
  13. Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Tom Shermer
    Pages 161-172
  14. Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
    Pages 173-184
  15. Arne Andersson
    Pages 185-197

About these proceedings

Introduction

This book constitutes the refereed proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, SWAT '96, held in Reykjavik, Iceland, in July 1996.
The 35 full papers included in the book in revised version were carefully selected from a total of 95 submissions; also included are abstracts or full versions of three invited talks by prominent researchers. All in all, the collection of articles reports state-of-the-art results on various topics of current design and analysis of algorithms.

Keywords

Algorithmen Algorithms Complexity Theory Data Structures Datenstrukturen Discrete Mathematics Graph Algorithms Graphalgorithmen Komplexitaetstheorie algorithm

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-61422-2
  • Copyright Information Springer-Verlag 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-61422-7
  • Online ISBN 978-3-540-68529-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book