Skip to main content
SpringerLink
Log in

Algorithms and Computation

4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. K. W. Ng
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. P. Raghavan
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. N. V. Balasubramanian
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. F. Y. L. Chin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
Softcover Book USD 109.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

Licence this eBook for your library

Institutional subscriptions

Table of contents (57 papers)

  1. Front Matter

    Download chapter PDF

  2. Reaching a goal with directional uncertainty

    • Mark de Berg, Leonidas Guibas, Dan Halperin, Mark Overmars, Otfried Schwarzkopf, Micha Sharir et al.
    Pages 1-10

  3. Constructing degree-3 spanners with other sparseness properties

    • Gautam Das, Paul J. Heffernan
    Pages 11-20

  4. Remembering conflicts in history yields dynamic algorithms

    • Katrin Dobrindt, Mariette Yvinec
    Pages 21-30

  5. Coloring random graphs in polynomial expected time

    • Martin Furer, C. R. Subramanian, C. E. Veni Madhavan
    Pages 31-37

  6. Graphical degree sequence problems with connectivity requirements

    • Takao Asano
    Pages 38-47

  7. How to treat delete requests in semi-online problems

    • Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh
    Pages 48-57

  8. Finding the shortest watchman route in a simple polygon

    • Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
    Pages 58-67

  9. Constructing shortest watchman routes by divide-and-conquer

    • Xuehou Tan, Tomio Hirata
    Pages 68-77

  10. A graph coloring result and its consequences for some guarding problems

    • Frank Hoffmann, Klaus Kriegel
    Pages 78-87

  11. The maximum k-dependent and f-dependent set problem

    • Anders Dessmark, Klaus Jansen, Andrzej Lingas
    Pages 88-97

  12. Finding shortest non-crossing rectilinear paths in plane regions

    • Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
    Pages 98-107

  13. Treewidth of circle graphs

    • T. Kloks
    Pages 108-117

  14. A framework for constructing heap-like structures in-place

    • Jingsen Chen
    Pages 118-127

  15. Double-ended binomial queues

    • C. M. Khoong, H. W. Leong
    Pages 128-137

  16. A simple balanced search tree with O(1) worst-case update time

    • Rudolf Fleischer
    Pages 138-146

  17. Mapping dynamic data and algorithm structures into product networks

    • Sabine R. öhring, Sajal K. Das
    Pages 147-156

  18. Permutation routing on reconfigurable meshes

    • J. C. Cogolludo, S. Rajasekaran
    Pages 157-166

  19. Adaptive and oblivious algorithms for d-cube permutation routing

    • Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang
    Pages 167-175

  20. On quadratic lattice approximations

    • Anand Srivastav, Peter Stangier
    Pages 176-184
Back to top

Keywords

About this book

This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computation. Topics covered include: - automata, languages, and computability, - combinatorial, graph, geometric, and randomized algorithms, - networks and distributed algorithms, - VLSIand parallel algorithms, - theory of learning and robotics, - number theory and robotics. Three invited papers are also included.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation