Table of contents

  1. Front Matter
  2. Jonathan S. Turner
    Pages 25-25
  3. Alon Efrat, Otfried Schwarzkopf
    Pages 36-44
  4. Olivier Devillers, Matthew J. Katz
    Pages 45-54
  5. Takeshi Fukuda, Yasuhiko Morimoto, Shinich Morishita, Takeshi Tokuyama
    Pages 55-64
  6. David Fernández-Baca, Jens Lagergren
    Pages 65-74
  7. Magnús M. Halldórsson, Keisuke Tanaka
    Pages 75-84
  8. Ying Choi, Tak Wah Lam
    Pages 85-94
  9. Alvis Brāzma, Esko Ukkonen, Jaak Vilo
    Pages 95-104
  10. Tamal K. Dey, János Pach
    Pages 105-114
  11. Alon Efrat, Matthew J. Katz
    Pages 115-125
  12. Mark de Berg, Olivier Devillers, Marc van Kreveld, Otfried Schwarzkopf, Monique Teillaud
    Pages 126-135
  13. Kazuyoshi Hayase, Hiroshi Imai
    Pages 136-145
  14. Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan-Yi Tang
    Pages 156-165
  15. Ton Kloks, Haiko Müller, C. K. Wong
    Pages 174-182
  16. Rolf Niedermeier
    Pages 183-192

About these proceedings


This book constitutes the refereed proceedings of the 7th International Symposium on Algorithms and Computation, ISAAC'96, held in Osaka, Japan, in December 1996.
The 43 revised full papers were selected from a total of 119 submissions; also included are an abstract of one invited talk and a full version of a second. Among the topics covered are computational geometry, graph theory, graph algorithms, combinatorial optimization, searching and sorting, networking, scheduling, and coding and cryptology.


Algorithmische Geometrie Graph-Algorithmen Kombinatorik Komplexitätstheorie Netzwerkbetrieb Routing Variable algorithm algorithms automata combinatorics complexity complexity theory computational geometry cryptography

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-62048-8
  • Online ISBN 978-3-540-49633-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book