Table of contents

  1. Front Matter
  2. Akira Tajima, Shinji Misono
    Pages 2-11
  3. Satoshi Horie, Osamu Watanabe
    Pages 22-31
  4. Miroslaw Kutyłowski, Rolf Wanka
    Pages 32-41
  5. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Pages 52-61
  6. Leqiang Bail, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda
    Pages 62-71
  7. Qian-Ping Gu, Hisao Tamaki
    Pages 72-81
  8. Tzuoo-Hawn Yeh, heng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
    Pages 82-91
  9. Ishii Toshimasa, Nagamochi Hiroshi, Ibaraki Toshihide
    Pages 102-111
  10. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Pages 112-121
  11. Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
    Pages 122-131
  12. Charles E. Leiserson
    Pages 132-132
  13. Hisao Tamaki, Takeshi Tokuyama
    Pages 133-142
  14. Petri§or Panaite, Andrzej Pelc
    Pages 143-152
  15. Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata
    Pages 153-162

About these proceedings


This book constitutes the refereed proceedings of the 8th International Symposium on Algorithms and Computation, ISAAC'97, held in Singapore in December 1997. The 42 revised full papers presented were selected from a total of 98 submissions. The scope of the volume spans the whole area of algorithms from discrete mathematics and complexity theory to algorithms design and evaluation in a variety of applicational areas. Among the topics addressed are scheduling and logistics, networking and routing, combinatorial optimization, graph-computations, algorithmic learning, computational geometry, etc.


Algorithms Computational Geometry Discrete Mathematics Matchings Scientific Computing complexity geometry sets

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-63890-2
  • Online ISBN 978-3-540-69662-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors