Conferences in DBLP

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

1. Andrew V. Goldberg
   Optimization Algorithms For Large Networks. [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:1-9 [Conf]
   
2. Gaston H. Gonnet
   Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value (Abstract). [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:10-11 [Conf]
   
3. Ashim Garg, Roberto Tamassia
   Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:12-23 [Conf]
   
4. Therese C. Biedl, Goos Kant
   A Better Heuristic for Orthogonal Graph Drawings. [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:24-35 [Conf]
   
5. Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
   Hamilton Triangulations for Fast Rendering. [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:36-47 [Conf]
   
6. Sunil Arya, Michiel H. M. Smid
   Efficient Construction of a Bounded Degree Spanner with Low Weight. [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:48-59 [Conf]
   
7. Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky
   Approaching the 5/4-Approximation for Rectilinear Steiner Trees. [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:60-71 [Conf]
   
8. Andrej Brodnik, J. Ian Munro
   Membership in Constant Time and Minimum Space. [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:72-81 [Conf]
   
9. Arne Andersson, Stefan Nilsson
   Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:82-93 [Conf]
   
10. Patricio V. Poblete, Alfredo Viola, J. Ian Munro
    The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:94-105 [Conf]
    
11. Svante Carlsson, Jingsen Chen
    Some Lower Bounds for Comparison-Based Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:106-117 [Conf]
    
12. Xiao Zhou, Takao Nishizeki
    An Efficient Algorithm for Edge-Ranking Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:118-129 [Conf]
    
13. Karsten Weihe
    Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:130-140 [Conf]
    
14. Mechthild Stoer, Frank Wagner
    A Simple Min Cut Algorithm. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:141-147 [Conf]
    
15. Jun Dong Cho, Salil Raje, Majid Sarrafzadeh
    Approximation Algorithm on Multi-Way Maxcut Partitioning. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:148-158 [Conf]
    
16. Victor Chepoi, Feodor F. Dragan
    A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:159-170 [Conf]
    
17. Amos Israeli, Asaf Shirazi
    The Time Complexity of Updating Snapshot Memories. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:171-182 [Conf]
    
18. Giuseppe Parlati, Moti Yung
    Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:183-201 [Conf]
    
19. Carsten Lund, Nick Reingold, Jeffery Westbrook, Dicky C. K. Yan
    On-Line Distributed Data Management. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:202-214 [Conf]
    
20. Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
    A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:215-226 [Conf]
    
21. Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra
    How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:227-239 [Conf]
    
22. Mark H. Overmars, A. Frank van der Stappen
    Range Searching and Point Location among Fat Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:240-253 [Conf]
    
23. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec
    Convex Tours on Bounded Curvature. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:254-265 [Conf]
    
24. Yi-Jen Chiang, Roberto Tamassia
    Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:266-277 [Conf]
    
25. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:278-289 [Conf]
    
26. Ingo Schiermeyer
    Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:290-299 [Conf]
    
27. Bo Chen, André van Vliet, Gerhard J. Woeginger
    An Optimal Algorithm for Preemptive On-line Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:300-306 [Conf]
    
28. Anand Srivastav, Peter Stangier
    Tight Approximations for Resource Constrained Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:307-318 [Conf]
    
29. Dag Wedelin
    An Algorithm for 0-1 Programming with Application to Airline Crew Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:319-330 [Conf]
    
30. Sajal K. Das, Paolo Ferragina
    An o(n) Work EREW Parallel Algorithm for Updating MST. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:331-342 [Conf]
    
31. Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
    On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:343-353 [Conf]
    
32. Noga Alon, Raphael Yuster, Uri Zwick
    Finding and Counting Given Length Cycles (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:354-364 [Conf]
    
33. Ishai Ben-Aroya, Assaf Schuster
    Greedy Hot-Potato Routing on the Mesh. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:365-376 [Conf]
    
34. Jop F. Sibeyn
    Desnakification of Mesh Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:377-390 [Conf]
    
35. Andrea Pietracaprina, Geppino Pucci
    Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:391-400 [Conf]
    
36. Bogdan S. Chlebus, Anna Gambin, Piotr Indyk
    PRAM Computations Resilient to Memory Faults. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:401-412 [Conf]
    
37. Gianfranco Bilardi, Paul Bay
    An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:413-423 [Conf]
    
38. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:424-435 [Conf]
    
39. Raymond Greenlaw, Jonathan Machta
    The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:436-447 [Conf]
    
40. Arnold Schönhage, Ekkehart Vetter
    A New Approach to Resultant Computations and Other Algorithms with Exact Division. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:448-459 [Conf]
    
41. Wojciech Plandowski
    Testing Equivalence of Morphisms on Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:460-470 [Conf]
    
42. Leszek Gasieniec, Kunsoo Park
    Work-Time Optimal Parallel Prefix Matching (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:471-482 [Conf]
    
43. Dany Breslauer, Livio Colussi, Laura Toniolo
    On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:483-494 [Conf]
    
44. Paolo Ferragina
    Incremental Text Editing: A New Data Structure. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:495-507 [Conf]
    
45. Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
    Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:508- [Conf]