Conferences in DBLP

European Symposium on Algorithms (ESA) (esa)
1997 (conf/esa/1997)

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