ESA 98, Accepted Papers

• Augmenting Suffix Trees with Applications
  Y. Matias and S. Muthukrishnan and S. C. Sahinalp and J. Ziv
• Geometric Searching in Walk-Through Animations with Weak Spanners in Real Time
  Matthias Fischer and Tamas Lukovszki and Martin Ziegler
• Maximizing Job Completions Online
  Bala Kalyanasundaram and Kirk Pruhs
• Fitting Points on the Real Line and its Application to RH Mapping
  Johan Hastad, Lars Ivansson and Jens Lagergren
• Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
  Phil Bradford and Mordecai Golin and Lawrence L. Larmore and Wojciech Rytter
• A Randomized Algorithm for Two Servers on the Line
  Yair Bartal, Marek Chrobak and Lawrence Larmore
• Fully dynamic shortest paths and negative cycle detection on digraphs with arbitrary arc weights
  D. Frigioni, A. Marchetti-Spaccamela and U. Nanni
• Moving-Target TSP and Related Problems
  Helvig, Robins and Zelikovsky
• Longest Common Subsequence from Fragments via Sparse Dynamic Programming
  Brenda S. Baker and Raffaele Giancarlo
• Complexity Estimates depending on Condition and Round-off Errors
  Felipe Cucker and Steve Smale
• On Nonblocking Properties of the Bene\v{s} Network
  Petr Kolman
• Analogs & Duals of the MAST Problem for Sequences & Trees
  M. Fellows, M. Hallett, C. Korostensky and U. Stege
• A Fast Random Greedy Algorithm for the Component Commonality Problem
  Ravi Kannan and Andreas Nolte
• Car-Pooling as a Data Structuring Device: The Soft Heap
  Bernard Chazelle
• Minimal Triangulations for Graphs with "Few" Minimal Separators
  V. Bouchitte' and I. Todinca
• Nearest Neighbor Load Balancing on Graphs
  Ralf Diekmann, Andreas Frommer and Burkhard Monien
• Finding all the best swaps of a minimum diameter spanning tree
  Enrico Nardelli, Guido Proietti and Peter Widmayer
• Intrinsic, Near Quadratic Complexity Bounds for Real Multivariate Root Counting
  J. Maurice Rojas
• Delta-Stepping Towards Linear-Work Poly-Logarithmic-Time Parallel Shortest Path
  Ulrich Meyer and Peter Sanders
• Finding an Optimal Path without Growing the Tree
  Danny Z. Chen, Ovidiu Daescu, Xiaobo (Sharon) Hu and Jinhui Xu
• Approximate coloring of uniform hypergraphs
  Michael Krivelevich and Benny Sudakov
• Fast Algorithms for Linear Algebra Modulo N
  Arne Storjohann and Thom Mulders
• Techniques for Scheduling with Rejection
  Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma and Joel Wein
• A robust region approach to the computation of geometric graphs
  Fabrizio d'Amore, Paolo G. Franciosa and Giuseppe Liotta
• A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers
  Johannes Bloemer
• Improved Deterministic Parallel Padded Sorting
  Ka Wong Chong and Edgar A. Ramos
• Matching medical students to pairs of hospitals: a new variation on a well-known theme
  Robert W. Irving
• Fault-Tolerant Broadcasting in Radio Networks
  Evangelos Kranakis, Danny Krizanc and Andrzej Pelc
• A Functional Approach to External Graph Algorithms
  James Abello, Adam L. Buchsbaum and Jeffery R. Westbrook
• Adaptability and the usefulness of hints
  Piotr Berman and Juan A. Garay
• Constructing Binary Space Partition for Orthogonal Rectangles in Practice
  T. M. Murali, Pankaj K. Agarwal and Jeffrey Scott Vitter
• An experimental study of dynamic algorithms for directed graphs
  D. Frigioni and T. Miller and U. Nanni and G. Pasqualone and G. Schaefer and C. Zaroliagis
• Evaluating server-assisted cache replacement in the Web
  E. Cohen, B. Krishnamurty and J. Rexford
• 2-Approximation algorithm for finding a spanning tree with maximum number of leaves
  Roberto Solis-Oba
• New Bounds for Oblivious Mesh Routing
  Kazuo Iwama and Eiji Miyano
• Analyzing an Infinite Parallel Job Allocation Process
  Micah Adler and Petra Berenbrink and Klaus Schroeder
• Computing the edit-distance between unrooted ordered trees
  Phil Klein
• Positioning guards at fixed height above a terrain - an optimum inapproximability result
  Stephan Eidenbenz and Christoph Stamm and Peter Widmayer
• Two-Center Problems for a Convex Polygon
  Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim and Kyung-Yong Chwa
• Computer-aided way to prove theorems in scheduling
  S. V. Sevast'yanov and I. D. Tchernykii