Skip to main content
  • Conference proceedings
  • © 1995

Algorithms and Computations

6th International Symposium, ISAAC '95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings.

Editors:

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

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 1995.

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (48 papers)

  1. Front Matter

  2. A fast and space-economical algorithm for length-limited coding

    • Jyrki Katajainen, Alistair Moffat, Andrew Turpin
    Pages 12-21
  3. Competitive searching in polygons—Beyond generalised streets

    • Amitava Datta, Christoph A. Hipke, Sven Schuierer
    Pages 32-41
  4. Finding a shortest pair of paths on the plane with obstacles and crossing areas

    • Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
    Pages 42-51
  5. Logspace verifiers, NC, and NP

    • Satyanarayana V. Lokam, Meena Mahajan, V. Vinay
    Pages 52-61
  6. Structure in average case complexity

    • Christoph Karg, Rainer Schuler
    Pages 62-71
  7. Some geometric lower bounds

    • Hank Chien, William Steiger
    Pages 72-81
  8. Two arc disjoint paths in Eulerian digraphs

    • András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
    Pages 92-101
  9. Finding dense subgraphs

    • Yuichi Asahiro, Kazuo Iwama
    Pages 102-111
  10. Finding smallest supertrees

    • Arvind Gupta, Naomi Nishimura
    Pages 112-121
  11. Weighted domination on cocomparability graphs

    • Maw-Shang Chang
    Pages 122-131
  12. The parallel complexity of approximating the High Degree Subgraph problem

    • A. E. Andreev, A. Clementi, P. Crescenzi, E. Dahlhaus, S. de Agostino, J. D. P. Rolim
    Pages 132-141
  13. Greedy approximations of independent sets in low degree graphs

    • Magnús M. Halldórsson, Kiyohito Yoshihara
    Pages 152-161
  14. Practical logic

    • John N. Crossley
    Pages 162-162
  15. An approximation algorithm for MAX 3-SAT

    • Takao Ono, Tomio Hirata, Takao Asano
    Pages 163-170

Other Volumes

  1. Algorithms and Computations

About this book

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.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access