7. ESA 1999:
Prague, Czech Republic
: How Long Does a Bit Live in a Computer? (abstract).
, F. Sibel Salman
: Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design.
, Eiji Miyano
: Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing.
: Convex Quadratic Programming Relaxations for Network Scheduling Problems.
, Jiri Sgall
: Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
: Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices.
, Ming-Yang Kao
: On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees.
: Efficient Algorithms foe On-Line Symbol Ranking Compression.
, Karen Aardal
: An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling.
: A Polyhedral Algorithm for Packings and Designs.
: Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms.
Alexander A. Ageev
: On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs.
: Random Cayley Graphs with O(log[G]) Generators Are Expanders.