10. ESA 2002:
Rome,
Italy
Rolf H. Möhring, Rajeev Raman (Eds.):
Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings.
Lecture Notes in Computer Science 2461 Springer 2002, ISBN 3-540-44180-8 BibTeX
@proceedings{DBLP:conf/esa/2002,
editor = {Rolf H. M{\"o}hring and
Rajeev Raman},
title = {Algorithms - ESA 2002, 10th Annual European Symposium, Rome,
Italy, September 17-21, 2002, Proceedings},
booktitle = {ESA},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2461},
year = {2002},
isbn = {3-540-44180-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Contributed Papers
- Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas:
Kinetic Medians and kd-Trees.
5-16
Electronic Edition (Springer LINK) BibTeX
- Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan:
Range Searching in Categorical Data: Colored Range Searching on Grid.
17-28
Electronic Edition (Springer LINK) BibTeX
- Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang:
Near-Linear Time Approximation Algorithms for Curve Simplification.
29-41
Electronic Edition (Springer LINK) BibTeX
- Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl:
Translating a Planar Object to Maximize Point Containment.
42-53
Electronic Edition (Springer LINK) BibTeX
- Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan:
Approximation Algorithms for k-Line Center.
54-63
Electronic Edition (Springer LINK) BibTeX
- Dino Ahr, Gerhard Reinelt:
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem.
64-74
Electronic Edition (Springer LINK) BibTeX
- Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn:
SCIL - Symbolic Constraints in Integer Linear Programming.
75-87
Electronic Edition (Springer LINK) BibTeX
- Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter:
Implementing I/O-efficient Data Structures Using TPIE.
88-100
Electronic Edition (Springer LINK) BibTeX
- Georg Baier, Ekkehard Köhler, Martin Skutella:
On the k-Splittable Flow Problem.
101-113
Electronic Edition (Springer LINK) BibTeX
- Arye Barkan, Haim Kaplan:
Partial Alphabetic Trees.
114-125
Electronic Edition (Springer LINK) BibTeX
- Christopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe:
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router.
126-138
Electronic Edition (Springer LINK) BibTeX
- Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton:
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy.
139-151
Electronic Edition (Springer LINK) BibTeX
- Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito:
Two Simplified Algorithms for Maintaining Order in a List.
152-164
Electronic Edition (Springer LINK) BibTeX
- Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Efficient Tree Layout in a Multilevel Memory Hierarchy.
165-173
Electronic Edition (Springer LINK) BibTeX
- Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer:
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons.
174-186
Electronic Edition (Springer LINK) BibTeX
- Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with Neighborhoods of Varying Size.
187-199
Electronic Edition (Springer LINK) BibTeX
- Piotr Berman, Sridhar Hannenhalli, Marek Karpinski:
1.375-Approximation Algorithm for Sorting by Reversals.
200-210
Electronic Edition (Springer LINK) BibTeX
- Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Pre-assigned Frequencies.
211-222
Electronic Edition (Springer LINK) BibTeX
- Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie:
Branch-and-Bound Algorithms for the Test Cover Problem.
223-233
Electronic Edition (Springer LINK) BibTeX
- Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight.
234-246
Electronic Edition (Springer LINK) BibTeX
- Ulrik Brandes:
Eager st-Ordering.
247-256
Electronic Edition (Springer LINK) BibTeX
- Adam L. Buchsbaum, Michael T. Goodrich:
Three-Dimensional Layers of Maxima.
257-269
Electronic Edition (Springer LINK) BibTeX
- Danny Z. Chen, Xiaobo Hu, Shuang Luan, Xiaodong Wu, Cedric X. Yu:
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy.
270-283
Electronic Edition (Springer LINK) BibTeX
- Danny Z. Chen, Michiel H. M. Smid, Bin Xu:
Geometric Algorithms for Density-Based Data Clustering.
284-296
Electronic Edition (Springer LINK) BibTeX
- Edith Cohen, Haim Kaplan:
Balanced-Replication Algorithms for Distribution Trees.
297-309
Electronic Edition (Springer LINK) BibTeX
- Mayur Datar:
Butterflies and Peer-to-Peer Networks.
310-322
Electronic Edition (Springer LINK) BibTeX
- Mayur Datar, S. Muthukrishnan:
Estimating Rarity and Similarity over Data Stream Windows.
323-334
Electronic Edition (Springer LINK) BibTeX
- Annalisa De Bonis, Ugo Vaccaro:
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels.
335-347
Electronic Edition (Springer LINK) BibTeX
- Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Frequency Estimation of Internet Packet Streams with Limited Space.
348-360
Electronic Edition (Springer LINK) BibTeX
- Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin:
Truthful and Competitive Double Auctions.
361-373
Electronic Edition (Springer LINK) BibTeX
- Anders Dessmark, Andrzej Pelc:
Optimal Graph Exploration without Good Maps.
374-386
Electronic Edition (Springer LINK) BibTeX
- Tamal K. Dey, Wulue Zhao:
Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee.
387-398
Electronic Edition (Springer LINK) BibTeX
- Benjamin Doerr, Henning Schnieder:
Non-independent Randomized Rounding and an Application to Digital Halftoning.
399-410
Electronic Edition (Springer LINK) BibTeX
- Alon Efrat, Stephen G. Kobourov, Anna Lubiw:
Computing Homotopic Shortest Paths Efficiently.
411-423
Electronic Edition (Springer LINK) BibTeX
- Khaled M. Elbassioni:
An Algorithm for Dualization in Products of Lattices and Its Applications.
424-435
Electronic Edition (Springer LINK) BibTeX
- Angela Enosh, Klara Kedem, Joel Bernstein:
Determining Similarity of Conformational Polymorphs.
436-448
Electronic Edition (Springer LINK) BibTeX
- Leah Epstein, Rob van Stee:
Minimizing the Maximum Starting Time On-line.
449-460
Electronic Edition (Springer LINK) BibTeX
- Leah Epstein, Tamir Tassa:
Vector Assignment Problems: A General Framework.
461-472
Electronic Edition (Springer LINK) BibTeX
- Eti Ezra, Dan Halperin, Micha Sharir:
Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice.
473-484
Electronic Edition (Springer LINK) BibTeX
- Torsten Fahle:
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique.
485-498
Electronic Edition (Springer LINK) BibTeX
- Amos Fiat, Manor Mendel, Steven S. Seiden:
Online Companion Caching.
499-511
Electronic Edition (Springer LINK) BibTeX
- Leszek Gasieniec, Aris Pagourtzis, Igor Potapov:
Deterministic Communication in Radio Networks with Large Labels.
512-524
Electronic Edition (Springer LINK) BibTeX
- Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel:
A Primal Approach to the Stable Set Problem.
525-537
Electronic Edition (Springer LINK) BibTeX
- Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler:
Wide-Sense Nonblocking WDM Cross-Connects.
538-549
Electronic Edition (Springer LINK) BibTeX
- Pinar Heggernes, Yngve Villanger:
Efficient Implementation of a Minimal Triangulation Algorithm.
550-561
Electronic Edition (Springer LINK) BibTeX
- Klaus Jansen:
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme.
562-573
Electronic Edition (Springer LINK) BibTeX
- Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas:
The Probabilistic Analysis of a Greedy Satisfiability Algorithm.
574-585
Electronic Edition (Springer LINK) BibTeX
- Menelaos I. Karavelas, Mariette Yvinec:
Dynamic Additively Weighted Voronoi Diagrams in 2D.
586-598
Electronic Edition (Springer LINK) BibTeX
- Ekkehard Köhler, Katharina Langkau, Martin Skutella:
Time-Expanded Graphs for Flow-Dependent Transit Times.
599-611
Electronic Edition (Springer LINK) BibTeX
- Stavros G. Kolliopoulos, George Steiner:
Partially-Ordered Knapsack and Applications to Scheduling.
612-624
Electronic Edition (Springer LINK) BibTeX
- Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis:
A Software Library for Elliptic Curve Cryptography.
625-636
Electronic Edition (Springer LINK) BibTeX
- Sven Oliver Krumke, Jörg Rambau, Luis Torres:
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows.
637-648
Electronic Edition (Springer LINK) BibTeX
- Eduardo Sany Laber, Ojas Parekh, R. Ravi:
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors.
649-661
Electronic Edition (Springer LINK) BibTeX
- Stefan Langerman, Pat Morin:
Covering Things with Things.
662-673
Electronic Edition (Springer LINK) BibTeX
- Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie:
On-Line Dial-a-Ride Problems under a Restricted Information Model.
674-685
Electronic Edition (Springer LINK) BibTeX
- Krzysztof Lorys, Grazyna Zwozniak:
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs.
686-697
Electronic Edition (Springer LINK) BibTeX
- Giovanni Manzini, Paolo Ferragina:
Engineering a Lightweight Suffix Array Construction Algorithm.
698-710
Electronic Edition (Springer LINK) BibTeX
- Jana Maxová, Jaroslav Nesetril:
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations.
711-722
Electronic Edition (Springer LINK) BibTeX
- Kurt Mehlhorn, Ulrich Meyer:
External-Memory Breadth-First Search with Sublinear I/O.
723-735
Electronic Edition (Springer LINK) BibTeX
- Michael Molloy, Mohammad R. Salavatipour:
Frequency Channel Assignment on Planar Networks.
736-747
Electronic Edition (Springer LINK) BibTeX
- Stefan Näher, Oliver Zlotowski:
Design and Implementation of Efficient Data Types for Static Graphs.
748-759
Electronic Edition (Springer LINK) BibTeX
- Benny K. Nielsen, Pawel Winter, Martin Zachariasen:
An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem.
760-771
Electronic Edition (Springer LINK) BibTeX
- Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama:
A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options.
772-784
Electronic Edition (Springer LINK) BibTeX
- Marcin Peczarski:
Sorting 13 Elements Requires 34 Comparisons.
785-794
Electronic Edition (Springer LINK) BibTeX
- Tobias Polzin, Siavash Vahdati Daneshmand:
Extending Reduction Techniques for the Steiner Tree Problem.
795-807
Electronic Edition (Springer LINK) BibTeX
- Kirk Pruhs, Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models.
808-819
Electronic Edition (Springer LINK) BibTeX
- Harald Räcke, Christian Sohler, Matthias Westermann:
Online Scheduling for Sorting Buffers.
820-832
Electronic Edition (Springer LINK) BibTeX
- Ingo Schurr, Tibor Szabó:
Finding the Sink Takes Some Time.
833-844
Electronic Edition (Springer LINK) BibTeX
- Meinolf Sellmann, Georg Kliewer, Achim Koberstein:
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design.
845-858
Electronic Edition (Springer LINK) BibTeX
- Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger:
Minimizing Makespan and Preemption Costs on a System of Uniform Machines.
859-871
Electronic Edition (Springer LINK) BibTeX
- Rob van Stee, Johannes A. La Poutré:
Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts.
872-883
Electronic Edition (Springer LINK) BibTeX
- Ron Wein:
High-Level Filtering for Arrangements of Conic Arcs.
884-895
Electronic Edition (Springer LINK) BibTeX
- Gerhard J. Woeginger:
An Approximation Scheme for Cake Division with a Linear Number of Cuts.
896-901
Electronic Edition (Springer LINK) BibTeX
- Huaming Zhang, Xin He:
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs.
902-914
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:10:38 2009
by Michael Ley (ley@uni-trier.de)