Accepted Papers

ESA 2001

9th Annual European Symposium on Algorithms
BRICS, University of Aarhus, Denmark, August 28-31, 2001

ALGO 2002
September 16-21
Rome ``La Sapienza''
ALGO 2001
-Online Registration (closed)
-Registration fees
-Travel and tourist Information
-Author index
ESA 2001
-Accepted papers
-Call for papers
WAE 2001
-Accepted papers
-Call for papers
WABI 2001
-Accepted papers
-Accepted posters
-Call for papers
-Call for posters
-Accepted papers
-Call for papers
[ Site map ]
  1. Online Bin-Coloring
    Sven Oliver Krumke and Willem de Paepe and Joerg Rambau and Leen Stougie
  2. Fast Pricing of European Asian Options with Provable Accuracy: Single-stock and Basket Options
    Karhan Akcoglu and Ming-Yang Kao and Shuba V. Raghavan
  3. A Heuristic for Dijkstra's Algorithm with Many Targets and its Use in Weighted Matching Algorithms
    Kurt Mehlhorn and Guido Schaefer
  4. A General Decomposition Theorem for the k-Server Problem
    Steve Seiden
  5. Approximation algorithms for scheduling malleable tasks under precedence constraints
    R. Lepere and D. Trystram and G.J. Woeginger
  6. Strongly Competitive Algorithms for Caching with Pipelined Prefetching
    Alexander Gaysinsky and Alon Itai and Hadas Shachnai
  7. Computing Cycle Covers without Short Cycles
    Markus Blaeser and Bodo Siebert
  8. Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation
    John Douceur and Roger Wattenhofer
  9. A Separation Bound for Real Algebraic Expressions
    Christoph Burnikel and Stefan Funke and Kurt Mehlhorn and Stefan Schirra and Susanne Schmitt
  10. A FPTAS for approximating the unrelated parallel machines scheduling problem with costs
    E. Angel and E. Bampis and A. Kononov
  11. Buying a constant competitive ratio for paging
    J. Csirik and C. Imreh and J. Noga and S. Seiden and G. Woeginger
  12. Splitting a Delaunay triangulation in linear time
    Bernard Chazelle and Olivier Devillers and Ferran Hurtado and Merce Mora and Vera Sacristan and Monique Teillaud
  13. A Simple Shortest Path Algorithm with Linear Average Time
    Andrew V. Goldberg
  14. A fast algorithm for approximating the detour of a polygonal chain
    Annette Ebbers-Baumann and Rolf Klein and Elmar Langetepe and Andrzej Lingas
  15. Algorithms for Efficient Filtering in Content-Based Multicast
    Rahul Shah and Stefan Langerman and Sachin Lodha
  16. On the Approximability of the Minimum Test Collection Problem
    B.V. Halldorsson and M.M. Halldorsson and R. Ravi
  17. Finding approximate repetitions under Hamming distance
    Roman Kolpakov and Gregory Kucherov
  18. Simple minimal perfect hashing in less space
    Martin Dietzfelbinger and Torben Hagerup
  19. A general model of web graphs
    Colin Cooper and Alan Frieze
  20. Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
    Pierre Fraigniaud
  21. On-line and Off-line distance constrained labeling of disk graphs
    Jiri Fiala and Aleksei V. Fishkin and Fedor V. Fomin
  22. Smallest Color-Spanning Objects
    Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Belen Palop and Vera Sacristan
  23. A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth
    Dimitrios M. Thilikos and Maria Serna and Hans L. Bodlaender
  24. Lossy Dictionaries
    Rasmus Pagh and Flemming Friche Rodler
  25. Cuckoo Hashing
    Rasmus Pagh and Flemming Friche Rodler
  26. An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
    Stephan Eidenbenz and Peter Widmayer
  27. On the Parameterized Complexity of Layered Graph Drawing
    V. Dujmovic and M. Fellows and M. Hallett and M. Kitching and G. Liotta and C. McCartin and N. Nishimura and P. Ragde and F. Rosamond and M. Suderman and S. Whitesides and D. R. Wood
  28. Grouping techniques for scheduling problems: simpler and faster
    Aleksei V. Fishkin and Klaus Jansen and Monaldo Mastrolilli
  29. Lower Bounds and Exact Algorithms for the Graph Partitioning Problem using Multicommodity Flows
    Norbert Sensen
  30. Distributed O(Delta log n)-edge-coloring algorithm
    A. Czygrinow and M. Hanckowiak and M. Karonski
  31. Property Testing with Geometric Queries
    Artur Czumaj and Christian Sohler
  32. Coupling Variable Fixing Algorithms for the Automatic Recording Problem
    Meinolf Sellmann and Torsten Fahle
  33. Greedy algorithms for minimisation problems in random regular graphs
    Michele Zito
  34. A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times
    Y. Karuno and H. Nagamochi
  35. Round Robin is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
    A. Clementi and A. Monti and and R. Silvestri
  36. Packing Cycles and Cuts in Undirected Graphs
    Alberto Caprara and Alessandro Panconesi and Romeo Rizzi
  37. SNPs Problems, Complexity and Algorithms
    Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert and Russell Schwartz
  38. Duality Between Prefetching and Queued Writing with Applications to Integrated Caching and Prefetching and to External Sorting
    David A. Hutchinson and Peter Sanders and Jeffrey Scott Vitter
  39. Explicit Deterministic Constructions for Set Membership in Bitprobe Model
    Jaikumar Radhakrishnan and Venkatesh Raman and S. Srinivasa Rao
  40. Approximate Distance Labeling Schemes
    C. Gavoille and M. Katz and N. Katz and C. Paul and D. Peleg
  41. Competitive Auctions for Multiple Digital Goods
    Andrew V. Goldberg and Jason D. Hartline

Page maintained by Gerth Stølting Brodal