Table of contents

  1. Front Matter
  2. Jyrki Katajainen, Alistair Moffat, Andrew Turpin
    Pages 12-21
  3. Amitava Datta, Christoph A. Hipke, Sven Schuierer
    Pages 32-41
  4. Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
    Pages 42-51
  5. Satyanarayana V. Lokam, Meena Mahajan, V. Vinay
    Pages 52-61
  6. Christoph Karg, Rainer Schuler
    Pages 62-71
  7. Hank Chien, William Steiger
    Pages 72-81
  8. András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
    Pages 92-101
  9. Yuichi Asahiro, Kazuo Iwama
    Pages 102-111
  10. Arvind Gupta, Naomi Nishimura
    Pages 112-121
  11. Maw-Shang Chang
    Pages 122-131
  12. A. E. Andreev, A. Clementi, P. Crescenzi, E. Dahlhaus, S. de Agostino, J. D. P. Rolim
    Pages 132-141
  13. Magnús M. Halldórsson, Kiyohito Yoshihara
    Pages 152-161
  14. John N. Crossley
    Pages 162-162
  15. Takao Ono, Tomio Hirata, Takao Asano
    Pages 163-170

About these proceedings


This book presents the refereed proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC '95, held in Cairns, Australia, in December 1995.
The 45 revised full papers presented together with the abstracts of three invited talks were selected from a total of 130 submissions. The papers address many current aspects of research and advanced applications of algorithms and computations; among the topics covered are graph theory and graph algorithms, computational geometry, computational logics, searching and sorting, approximation and optimization, algebraic manipulation, and coding.


3-SAT Algorithmen Algorithmic Mathematics Algorithmische Mathematik Algorithms Combinatories Erfüllbarkeitsproblem der Aussagenlogik Graph Algorithms Graph-Algorithmen Komplexität Partition coding complexity geometry optimization

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60573-7
  • Online ISBN 978-3-540-47766-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book