| ESA'99 Program | p. 1 |
| Adaptively-Secure Distributed Public-Key Systems | p. 4 |
| How Long Does a Bit Live in a Computer? | p. 28 |
| Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design | p. 29 |
| The Impact of Knowledge on Broadcasting Time in Radio Networks (Extended Abstract) | p. 41 |
| Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing | p. 53 |
| IP Address Lookup Made Fast and Simple | p. 65 |
| On-Line Load Balancing in a Hierarchical Server Topology | p. 77 |
| Provably Good and Practical Strategies for Non-uniform Data Management in Networks | p. 89 |
| Approximation Algorithms for Restoration Capacity Planning | p. 101 |
| Efficient Algorithms for Integer Programs with Two Variables per Constraint (Extended Abstract) | p. 116 |
| Convex Quadratic Programming Relaxations for Network Scheduling Problems | p. 127 |
| Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems | p. 139 |
| Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines | p. 151 |
| Off-Line Temporary Tasks Assignment | p. 163 |
| Load Balancing Using Bisectors - A Tight Average-Case Analysis | p. 172 |
| On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help | p. 184 |
| Motif Statistics | p. 194 |
| Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices (Extended Abstract) | p. 212 |
| On Constructing Suffix Arrays in External Memory | p. 224 |
| Strategies for Searching with Different Access Costs | p. 236 |
| On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees | p. 248 |
| Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness | p. 257 |
| Improving Mergesort for Linked Lists | p. 267 |
| Efficient Algorithms for On-Line Symbol Ranking Compression (Extended Abstract) | p. 277 |
| On List Update and Work Function Algorithms | p. 289 |
| The 3-Server Problem in the Plane (Extended Abstract) | p. 301 |
| Quartet Cleaning: Improved Algorithms and Simulations | p. 313 |
| Fast and Robust Smallest Enclosing Balls | p. 325 |
| Efficient Searching for Multi-dimensional Data Made Simple (Extended Abstract) | p. 339 |
| Geometric Searching over the Rationals | p. 354 |
| On Computing the Diameter of a Point Set in High Dimensional Euclidean Space | p. 366 |
| A Nearly Linear-Time Approximation Scheme for the Euclidean k-median Problem | p. 378 |
| Sum Multi-coloring of Graphs | p. 390 |
| Efficient Approximation Algorithms for the Achromatic Number | p. 402 |
| Augmentinga (k - 1)-Vertex-Connected Multigraph to an l-Edge-Connected and k-Vertex-Connected Multigraph | p. 414 |
| An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling | p. 426 |
| A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees | p. 438 |
| Faster Exact Solutions for Some NP-Hard Problems (Extended Abstract) | p. 450 |
| A Polyhedral Algorithm for Packings and Designs | p. 462 |
| Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms | p. 476 |
| On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs | p. 490 |
| Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis | p. 498 |
| On 2-Coverings and 2-Packings of Laminar Families | p. 510 |
| Random Cayley Graphs with 0(log|G|) Generators Are Expanders | p. 521 |
| A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs | p. 527 |
| A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs | p. 540 |
| Author Index | p. 551 |
| Table of Contents provided by Publisher. All Rights Reserved. |