Algorithms and Computation

12th International Symposium, ISAAC 2001 Christchurch, New Zealand, December 19–21, 2001 Proceedings

  • Peter Eades
  • Tadao Takaoka

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

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Invited Talk 1

  3. Combinatorial Generation and Optimization (I)

  4. Parallel and Distributed Algorithms (I)

    1. Kumiko Nomura, Toshinori Yamada, Shuichi Ueno
      Pages 86-98
    2. Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
      Pages 99-106
  5. Graph Drawing and Algorithms (I)

    1. Shin-ichi Nakano
      Pages 107-115
    2. Giulia Galbiati
      Pages 116-123
    3. Hiroshi Nagamochi, Toshimasa Ishii
      Pages 124-135
  6. Computational Geometry (I)

    1. Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama
      Pages 148-159
    2. Francis Y. L. Chin, Stanley P. Y. Fung
      Pages 172-184
    3. Christian Schindelhauer, Birgitta Weber
      Pages 185-195
  7. Computational Complexity and Cryptology

About these proceedings

Keywords

AAC Automat algorithms automata complexity computational geometry data structures formal language

Editors and affiliations

  • Peter Eades
    • 1
  • Tadao Takaoka
    • 2
  1. 1.Basser Department of Computer ScienceUniversity of SydneySydneyAustralia
  2. 2.Department of Computer ScienceUniversity of CanterburyChristchurchNew Zealand

Bibliographic information

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