Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Algorithms and Computation

7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Tetsuo Asano
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Yoshihide Igarashi
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Hiroshi Nagamochi
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Satoru Miyano
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Subhash Suri
    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 1178)

Included in the following conference series:

Conference proceedings info: ISAAC 1996.

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 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

Licence this eBook for your library

Institutional subscriptions

Table of contents (45 papers)

  1. Front Matter

    Download chapter PDF

  2. Applications of a numbering scheme for polygonal obstacles in the plane

    • Mikhail J. Atallah, Danny Z. Chen
    Pages 1-24

  3. Multicast communication in high speed networks

    • Jonathan S. Turner
    Pages 25-25

  4. Incremental convex hull algorithms are not output sensitive

    • David Bremner
    Pages 26-35

  5. Separating and shattering long line segments

    • Alon Efrat, Otfried Schwarzkopf
    Pages 36-44

  6. Optimal line bipartitions of point sets

    • Olivier Devillers, Matthew J. Katz
    Pages 45-54

  7. Interval finding and its application to data mining

    • Takeshi Fukuda, Yasuhiko Morimoto, Shinich Morishita, Takeshi Tokuyama
    Pages 55-64

  8. On the approximability of the Steiner tree problem in phylogeny

    • David Fernández-Baca, Jens Lagergren
    Pages 65-74

  9. Approximation and special cases of common subtrees and editing distance

    • Magnús M. Halldórsson, Keisuke Tanaka
    Pages 75-84

  10. Two-dimensional dynamic dictionary matching

    • Ying Choi, Tak Wah Lam
    Pages 85-94

  11. Discovering unbounded unions of regular pattern languages from positive examples

    • Alvis Brāzma, Esko Ukkonen, Jaak Vilo
    Pages 95-104

  12. Extremal problems for geometric hypergraphs

    • Tamal K. Dey, János Pach
    Pages 105-114

  13. Computing fair and bottleneck matchings in geometric graphs

    • Alon Efrat, Matthew J. Katz
    Pages 115-125

  14. Computing the maximum overlap of two convex polygons under translations

    • Mark de Berg, Olivier Devillers, Marc van Kreveld, Otfried Schwarzkopf, Monique Teillaud
    Pages 126-135

  15. OBDDs of a monotone function and of its prime implicants

    • Kazuyoshi Hayase, Hiroshi Imai
    Pages 136-145

  16. Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs

    • Maw-Shang Chang
    Pages 146-155

  17. Graph searching on chordal graphs

    • Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan-Yi Tang
    Pages 156-165

  18. An algorithm for enumerating all directed spanning trees in a directed graph

    • Takeaki Uno
    Pages 166-173

  19. Vertex ranking of asteroidal triple-free graphs

    • Ton Kloks, Haiko Müller, C. K. Wong
    Pages 174-182

  20. Recursively divisible problems

    • Rolf Niedermeier
    Pages 183-192
Back to top

Other volumes

  1. Algorithms and Computation

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation