Skip to main content
  • Conference proceedings
  • © 1996

Algorithms and Computation

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

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

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

Conference proceedings info: ISAAC 1996.

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 (45 papers)

  1. Front Matter

  2. Multicast communication in high speed networks

    • Jonathan S. Turner
    Pages 25-25
  3. Separating and shattering long line segments

    • Alon Efrat, Otfried Schwarzkopf
    Pages 36-44
  4. Optimal line bipartitions of point sets

    • Olivier Devillers, Matthew J. Katz
    Pages 45-54
  5. Interval finding and its application to data mining

    • Takeshi Fukuda, Yasuhiko Morimoto, Shinich Morishita, Takeshi Tokuyama
    Pages 55-64
  6. On the approximability of the Steiner tree problem in phylogeny

    • David Fernández-Baca, Jens Lagergren
    Pages 65-74
  7. Approximation and special cases of common subtrees and editing distance

    • Magnús M. Halldórsson, Keisuke Tanaka
    Pages 75-84
  8. Two-dimensional dynamic dictionary matching

    • Ying Choi, Tak Wah Lam
    Pages 85-94
  9. Discovering unbounded unions of regular pattern languages from positive examples

    • Alvis Brāzma, Esko Ukkonen, Jaak Vilo
    Pages 95-104
  10. Extremal problems for geometric hypergraphs

    • Tamal K. Dey, János Pach
    Pages 105-114
  11. Computing fair and bottleneck matchings in geometric graphs

    • Alon Efrat, Matthew J. Katz
    Pages 115-125
  12. 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
  13. OBDDs of a monotone function and of its prime implicants

    • Kazuyoshi Hayase, Hiroshi Imai
    Pages 136-145
  14. Graph searching on chordal graphs

    • Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan-Yi Tang
    Pages 156-165
  15. Vertex ranking of asteroidal triple-free graphs

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

    • Rolf Niedermeier
    Pages 183-192

Other Volumes

  1. Algorithms and Computation

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

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