5. ESA 1997: Graz, Austria

• Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis:
  Scheduling Independent Multiprocessor Tasks. 1-12
  
• Esther M. Arkin, Refael Hassin:
  On Local Search for Weighted k-Set Packing. 13-22
  
• Yossi Azar, Leah Epstein:
  On-Line Machine Covering. 23-36
  
• Therese C. Biedl, Michael Kaufmann:
  Area-Efficient Static and Incremental Graph Drawings. 37-52
  
• Johannes Blömer:
  Denesting by Bounded Degree Radicals. 53-63
  
• Ulrik Brandes, Dorothea Wagner:
  A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). 64-77
  
• Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
  Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). 78-91
  
• Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey:
  Decomposition of Integer Programs and of Generating Sets. 92-102
  
• Artur Czumaj, Willy-Bernhard Strothmann:
  Bounded Degree Spanning Trees (Extended Abstract). 104-117
  
• Krzysztof Diks, Andrzej Pelc:
  Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). 118-129
  
• Hristo Djidjev:
  Weighted Graph Separators and Their Applications. 130-143
  
• Sándor P. Fekete, Jörg Schepers:
  A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems. 144-156
  
• Matthias Fischer, Friedhelm Meyer auf der Heide, Willy-Bernhard Strothmann:
  Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract). 157-170
  
• Ulrich Fößmeier, Michael Kaufmann:
  Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. 171-185
  
• Daniele Frigioni, Giuseppe F. Italiano:
  Dynamically Switching Vertices in Planar Graphs (Extended Abstract). 186-199
  
• Theodoulos Garefalakis:
  A New Family of Randomized Algorithms for List Accessing. 200-216
  
• Raffaele Giancarlo, Daniela Guaiana:
  On-Line Construction of Two-Dimensional Suffix Trees. 217-231
  
• Kevin D. Glazebrook, José Niño-Mora:
  Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov's Priority Rule. 232-245
  
• Vladimir Grebinski, Gregory Kucherov:
  Optimal Reconstruction of Graphs Under the Additive Model. 246-258
  
• Christoph Helmberg:
  Fixing Variables in Semidefinite Relaxations. 259-270
  
• Martin Henk, Robert Weismantel:
  Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. 271-283
  
• Kazuo Iwama, Eiji Miyano:
  Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. 284-295
  
• Bala Kalyanasundaram, Kirk Pruhs:
  Fault-Tolerant Real-Time Scheduling. 296-307
  
• Dmitry Kogan, Assaf Schuster:
  Collecting Garbage Pages in a Distributed Shared Memory with Reduced Memory and Communication Overhead. 308-325
  
• Madhukar R. Korupolu, Vijaya Ramachandran:
  Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems. 326-340
  
• Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson:
  Minimum Spanning Trees in d Dimensions. 341-349
  
• Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen:
  Relaxed Balance for Search Trees with Local Rebalancing. 350-363
  
• Matthias Müller-Hannemann, Karsten Weihe:
  Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. 364-377
  
• Joseph Naor, Ariel Orda, Yael Petruschka:
  Dynamic Storage Allocation with Known Durations. 378-387
  
• Andreas Nolte, Rainer Schrader:
  Coloring in Sublinear Time. 388-401
  
• Jochen Rethmann, Egon Wanke:
  Competivive Analysis of on-line Stack-Up Algorithms. 402-415
  
• Andreas S. Schulz, Martin Skutella:
  Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. 416-429
  
• Michael Segal:
  On Piercing Sets of Axis-Parallel Rectangles and Rings. 430-442
  
• Sergey V. Sevastianov:
  Seven Problems: So Different yet Close. 443-458
  
• Jack Snoeyink, Marc J. van Kreveld:
  Linear-Time Reconstruction of Delaunay Triangulations with Applications. 459-471
  
• Luca Trevisan:
  Approximating Satisfiable Satisfiability Problems (Extended Abstract). 472-485
  
• Brigitte Vallée:
  Algorithms for Computing Signs of 2×2 Determinants: Dynamics and Average-Case Analysis. 486-499
  
• Karsten Weihe, Thomas Willhalm:
  Reconstructing the Topology of a CAD Model: A Discrete Approach. 500-513
  

Last update Wed May 22 03:37:27 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page