Algorithms — ESA’ 98

6th Annual European Symposium Venice, Italy, August 24–26, 1998 Proceedings

  • Gianfranco Bilardi
  • Giuseppe F. Italiano
  • Andrea Pietracaprina
  • Geppino Pucci
Conference proceedings ESA 1998

DOI: 10.1007/3-540-68530-8

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

Table of contents (42 papers)

  1. Front Matter
    Pages I-XII
  2. Invited Lectures

  3. Data Structures

    1. Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
      Phil Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
      Pages 43-54
    2. Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
      Enrico Nardelli, Guido Proietti, Peter Widmayer
      Pages 55-66
  4. Strings and Biology

    1. Augmenting Suffix Trees, with Applications
      Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv
      Pages 67-78
    2. Longest Common Subsequence from Fragments via Sparse Dynamic Programming
      Brenda S. Baker, Raffaele Giancarlo
      Pages 79-90
    3. Analogs and Duals of the MAST Problem for Sequences and Trees
      Michael Fellows, Michael Hallett, Chantal Korostensky, Ulrike Stege
      Pages 103-114
  5. Numerical Algorithms

  6. Geometry

    1. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
      Matthias Fischer, Tamás Lukovszki, Martin Ziegler
      Pages 163-174
    2. A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
      Fabrizio d’Amore, Paolo G. Franciosa, Giuseppe Liotta
      Pages 175-186
    3. Positioning Guards at Fixed Height Above a Terrain — An Optimum Inapproximability Result
      Stephan Eidenbenz, Christoph Stamm, Peter Widmayer
      Pages 187-198
    4. Two-Center Problems for a Convex Polygon (Extended Abstract)
      Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa
      Pages 199-210
    5. Constructing Binary Space Partitions for Orthogonal Rectangles in Practice
      T. M. Murali, Pankaj K. Agarwal, Jeffrey Scott Vitter
      Pages 211-222
  7. Randomized and On-Line Algorithms

About these proceedings


AES Analysis Animation Partition algorithms complexity linear algebra programming

Editors and affiliations

  • Gianfranco Bilardi
    • 1
    • 2
  • Giuseppe F. Italiano
    • 3
  • Andrea Pietracaprina
    • 4
  • Geppino Pucci
    • 1
  1. 1.Dipartimento di Elettronica e InformaticaUniversità di PadovaPadovaItaly
  2. 2.Department of Electrical Engineering and Computer ScienceThe University of Illinois at ChicagoChicagoUSA
  3. 3.Dipartimento di Matematica Applicata e InformaticaUniversità “Cá Foscari” di VeneziaVenezia MestreItaly
  4. 4.Dipartimento di Matematica Pura e ApplicataUniversità di PadovaPadovaItaly

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-64848-2
  • Online ISBN 978-3-540-68530-2
  • Series Print ISSN 0302-9743