16. ESA 2008:
Karlsruhe,
Germany
Dan Halperin, Kurt Mehlhorn (Eds.):
Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings.
Lecture Notes in Computer Science 5193 Springer 2008, ISBN 978-3-540-87743-1 BibTeX
Invited Lectures
Contributed Papers
- Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Duru Türkoglu:
Robust Kinetic Convex Hulls in 3D.
29-40
Electronic Edition (link) BibTeX
- Peyman Afshani:
On Dominance Reporting in 3D.
41-51
Electronic Edition (link) BibTeX
- Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang:
Stabbing Convex Polygons with a Segment or a Polygon.
52-63
Electronic Edition (link) BibTeX
- Pankaj K. Agarwal, Jeff M. Phillips:
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers.
64-75
Electronic Edition (link) BibTeX
- Spyros Angelopoulos:
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry.
76-87
Electronic Edition (link) BibTeX
- Lars Arge, Thomas Mølhave, Norbert Zeh:
Cache-Oblivious Red-Blue Line Segment Intersection.
88-99
Electronic Edition (link) BibTeX
- Boris Aronov, Mark de Berg, Shripad Thite:
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains.
100-111
Electronic Edition (link) BibTeX
- Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia:
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces.
112-123
Electronic Edition (link) BibTeX
- Maxim A. Babenko, Alexander V. Karzanov:
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem.
124-135
Electronic Edition (link) BibTeX
- Christian Bachmaier, Wolfgang Brunner:
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs.
136-147
Electronic Edition (link) BibTeX
- Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra.
148-160
Electronic Edition (link) BibTeX
- Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara:
Randomized Competitive Analysis for Two-Server Problems.
161-172
Electronic Edition (link) BibTeX
- Mark de Berg, Chris Gray:
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra.
173-184
Electronic Edition (link) BibTeX
- Markus Bläser, Bodo Manthey, Oliver Putz:
Approximating Multi-criteria Max-TSP.
185-197
Electronic Edition (link) BibTeX
- Andreas Bley:
An Integer Programming Algorithm for Routing Optimization in IP Networks.
198-209
Electronic Edition (link) BibTeX
- Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller:
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.
210-221
Electronic Edition (link) BibTeX
- Paul S. Bonsma, Frederic Dorn:
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.
222-233
Electronic Edition (link) BibTeX
- Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors.
234-245
Electronic Edition (link) BibTeX
- Daniel Cederman, Philippas Tsigas:
A Practical Quicksort Algorithm for Graphics Processors.
246-258
Electronic Edition (link) BibTeX
- Denis Xavier Charles, Kumar Chellapilla:
Bloomier Filters: A Second Look.
259-270
Electronic Edition (link) BibTeX
- Danny Z. Chen, Shuang Luan, Chao Wang:
Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy.
271-283
Electronic Edition (link) BibTeX
- Markus Chimani, Petra Mutzel, Immanuel M. Bomze:
A New Approach to Exact Crossing Minimization.
284-296
Electronic Edition (link) BibTeX
- George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A Characterization of 2-Player Mechanisms for Scheduling.
297-307
Electronic Edition (link) BibTeX
- Tom Coleman, James Saunderson, Anthony Wirth:
A Local-Search 2-Approximation for 2-Correlation-Clustering.
308-319
Electronic Edition (link) BibTeX
- Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Alcuin Number of a Graph.
320-331
Electronic Edition (link) BibTeX
- Daniel Delling:
Time-Dependent SHARC-Routing.
332-343
Electronic Edition (link) BibTeX
- Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle:
Detecting Regular Visit Patterns.
344-355
Electronic Edition (link) BibTeX
- Alon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement.
356-367
Electronic Edition (link) BibTeX
- Leah Epstein, Elena Kleiman:
Selfish Bin Packing.
368-380
Electronic Edition (link) BibTeX
- Leah Epstein, Asaf Levin:
Improved Randomized Results for That Interval Selection Problem.
381-392
Electronic Edition (link) BibTeX
- Arash Farzan, J. Ian Munro:
Succinct Representations of Arbitrary Graphs.
393-404
Electronic Edition (link) BibTeX
- Uriel Feige, Mohit Singh:
Edge Coloring and Decompositions of Weighted Graphs.
405-416
Electronic Edition (link) BibTeX
- Stefan Felsner, Martin Pergel:
The Complexity of Sorting with Networks of Stacks and Queues.
417-429
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Faster Steiner Tree Computation in Polynomial-Space.
430-441
Electronic Edition (link) BibTeX
- Hervé Fournier, Antoine Vigneron:
Fitting a Step Function to a Point Set.
442-453
Electronic Edition (link) BibTeX
- Beat Gfeller:
Faster Swap Edge Computation in Minimum Diameter Spanning Trees.
454-465
Electronic Edition (link) BibTeX
- Andrew V. Goldberg:
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem.
466-477
Electronic Edition (link) BibTeX
- Lee-Ad Gottlieb, Liam Roditty:
An Optimal Dynamic Spanner for Doubling Metric Spaces.
478-489
Electronic Edition (link) BibTeX
- Ajay Gulati, Peter J. Varman:
RFQ: Redemptive Fair Queuing.
490-502
Electronic Edition (link) BibTeX
- Sariel Har-Peled, S. Muthukrishnan:
Range Medians.
503-514
Electronic Edition (link) BibTeX
- Herman J. Haverkort, Freek van Walderveen:
Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves.
515-527
Electronic Edition (link) BibTeX
- Benjamin Hiller, Tjark Vredeveld:
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison.
528-539
Electronic Edition (link) BibTeX
- Tobias Jacobs:
On the Complexity of Optimal Hotlink Assignment.
540-552
Electronic Edition (link) BibTeX
- Jens Jägersküpper:
Oblivious Randomized Direct Search for Real-Parameter Optimization.
553-564
Electronic Edition (link) BibTeX
- Haim Kaplan, Nira Shafrir:
Path Minima in Incremental Unrooted Trees.
565-576
Electronic Edition (link) BibTeX
- Alexander Kesselman, Kirill Kogan, Michael Segal:
Improved Competitive Performance Bounds for CIOQ Switches.
577-588
Electronic Edition (link) BibTeX
- Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-Stage Robust Network Design with Exponential Scenarios.
589-600
Electronic Edition (link) BibTeX
- Samir Khuller, Julián Mestre:
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection.
601-610
Electronic Edition (link) BibTeX
- Adam Kirsch, Michael Mitzenmacher, Udi Wieder:
More Robust Hashing: Cuckoo Hashing with a Stash.
611-622
Electronic Edition (link) BibTeX
- Zoltán Király:
Better and Simpler Approximation Algorithms for the Stable Marriage Problem.
623-634
Electronic Edition (link) BibTeX
- Anthony Labarre:
Edit Distances and Factorisations of Even Permutations.
635-646
Electronic Edition (link) BibTeX
- Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong:
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count.
647-659
Electronic Edition (link) BibTeX
- Christiane Lammersen, Christian Sohler:
Facility Location in Dynamic Geometric Data Streams.
660-671
Electronic Edition (link) BibTeX
- Yann Lorion, Maik Weinard:
The Effects of Local Randomness in the Adversarial Queueing Model.
672-683
Electronic Edition (link) BibTeX
- Thành Nguyen, Éva Tardos:
Parallel Imaging Problem.
684-695
Electronic Edition (link) BibTeX
- Daisuke Okanohara, Kunihiko Sadakane:
An Online Algorithm for Finding the Longest Previous Factors.
696-707
Electronic Edition (link) BibTeX
- Paolo Penna, Carmine Ventre:
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions.
708-719
Electronic Edition (link) BibTeX
- Vasilis Samoladas:
Improved BDD Algorithms for the Simulation of Quantum Circuits.
720-731
Electronic Edition (link) BibTeX
- Peter Sanders, Dominik Schultes, Christian Vetter:
Mobile Route Planning.
732-743
Electronic Edition (link) BibTeX
- Stefan Schirra:
How Reliable Are Practical Point-in-Polygon Strategies?.
744-755
Electronic Edition (link) BibTeX
- Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich:
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach.
756-767
Electronic Edition (link) BibTeX
- René A. Sitters:
Approximability of Average Completion Time Scheduling on Unrelated Machines.
768-779
Electronic Edition (link) BibTeX
- Mashhood Ishaque, Csaba D. Tóth:
Relative Convex Hulls in Semi-dynamic Subdivisions.
780-792
Electronic Edition (link) BibTeX
- Seung-Jin Sul, Tiffani L. Williams:
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms.
793-804
Electronic Edition (link) BibTeX
- Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides:
On the Size of the 3D Visibility Skeleton: Experimental Results.
805-816
Electronic Edition (link) BibTeX
- Hamid Zarrabi-Zadeh:
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions.
817-829
Electronic Edition (link) BibTeX
- Anke van Zuylen:
Deterministic Sampling Algorithms for Network Design.
830-841
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:10:39 2009
by Michael Ley (ley@uni-trier.de)
