default search action
16. ESA 2008: Karlsruhe, Germany
- Dan Halperin, Kurt Mehlhorn:
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
Invited Lectures
- Mark H. Overmars, Ioannis Karamouzas, Roland Geraerts:
Flexible Path Planning Using Corridor Maps. 1-12 - Leslie G. Valiant:
A Bridging Model for Multi-core Computing. 13-28
Contributed Papers
- Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Duru Türkoglu:
Robust Kinetic Convex Hulls in 3D. 29-40 - Peyman Afshani:
On Dominance Reporting in 3D. 41-51 - 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 - Pankaj K. Agarwal, Jeff M. Phillips:
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers. 64-75 - Spyros Angelopoulos:
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry. 76-87 - Lars Arge, Thomas Mølhave, Norbert Zeh:
Cache-Oblivious Red-Blue Line Segment Intersection. 88-99 - Boris Aronov, Mark de Berg, Shripad Thite:
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. 100-111 - Sunil Arya, David M. Mount
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. 112-123 - Maxim A. Babenko, Alexander V. Karzanov:
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. 124-135 - Christian Bachmaier, Wolfgang Brunner:
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs. 136-147 - Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra. 148-160 - Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara:
Randomized Competitive Analysis for Two-Server Problems. 161-172 - Mark de Berg, Chris Gray:
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra. 173-184 - Markus Bläser, Bodo Manthey, Oliver Putz:
Approximating Multi-criteria Max-TSP. 185-197 - Andreas Bley
An Integer Programming Algorithm for Routing Optimization in IP Networks. 198-209 - Vincenzo Bonifaci, Alberto Marchetti-Spaccamela
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. 210-221 - Paul S. Bonsma, Frederic Dorn:
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. 222-233 - Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. 234-245 - Daniel Cederman, Philippas Tsigas:
A Practical Quicksort Algorithm for Graphics Processors. 246-258 - Denis Xavier Charles, Kumar Chellapilla:
Bloomier Filters: A Second Look. 259-270 - Danny Z. Chen, Shuang Luan, Chao Wang:
Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy. 271-283 - Markus Chimani, Petra Mutzel
A New Approach to Exact Crossing Minimization. 284-296 - George Christodoulou
A Characterization of 2-Player Mechanisms for Scheduling. 297-307 - Tom Coleman, James Saunderson
A Local-Search 2-Approximation for 2-Correlation-Clustering. 308-319 - Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Alcuin Number of a Graph. 320-331 - Daniel Delling:
Time-Dependent SHARC-Routing. 332-343 - Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle:
Detecting Regular Visit Patterns. 344-355 - Alon Efrat
Improved Approximation Algorithms for Relay Placement. 356-367 - Leah Epstein, Elena Kleiman:
Selfish Bin Packing. 368-380 - Leah Epstein, Asaf Levin
Improved Randomized Results for That Interval Selection Problem. 381-392 - Arash Farzan, J. Ian Munro:
Succinct Representations of Arbitrary Graphs. 393-404 - Uriel Feige, Mohit Singh:
Edge Coloring and Decompositions of Weighted Graphs. 405-416 - Stefan Felsner, Martin Pergel:
The Complexity of Sorting with Networks of Stacks and Queues. 417-429 - Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Faster Steiner Tree Computation in Polynomial-Space. 430-441 - Hervé Fournier, Antoine Vigneron:
Fitting a Step Function to a Point Set. 442-453 - Beat Gfeller:
Faster Swap Edge Computation in Minimum Diameter Spanning Trees. 454-465 - Andrew V. Goldberg:
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem. 466-477 - Lee-Ad Gottlieb, Liam Roditty:
An Optimal Dynamic Spanner for Doubling Metric Spaces. 478-489 - Ajay Gulati, Peter J. Varman:
RFQ: Redemptive Fair Queuing. 490-502 - Sariel Har-Peled, S. Muthukrishnan:
Range Medians. 503-514 - Herman J. Haverkort, Freek van Walderveen:
Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. 515-527 - Benjamin Hiller, Tjark Vredeveld:
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison. 528-539 - Tobias Jacobs:
On the Complexity of Optimal Hotlink Assignment. 540-552 - Jens Jägersküpper:
Oblivious Randomized Direct Search for Real-Parameter Optimization. 553-564 - Haim Kaplan, Nira Shafrir:
Path Minima in Incremental Unrooted Trees. 565-576 - Alexander Kesselman, Kirill Kogan
Improved Competitive Performance Bounds for CIOQ Switches. 577-588 - Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-Stage Robust Network Design with Exponential Scenarios. 589-600 - Samir Khuller, Julián Mestre:
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. 601-610 - Adam Kirsch, Michael Mitzenmacher, Udi Wieder:
More Robust Hashing: Cuckoo Hashing with a Stash. 611-622 - Zoltán Király:
Better and Simpler Approximation Algorithms for the Stable Marriage Problem. 623-634 - Anthony Labarre
Edit Distances and Factorisations of Even Permutations. 635-646 - Tak Wah Lam, Lap-Kei Lee
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count. 647-659 - Christiane Lammersen, Christian Sohler:
Facility Location in Dynamic Geometric Data Streams. 660-671 - Yann Lorion, Maik Weinard:
The Effects of Local Randomness in the Adversarial Queueing Model. 672-683 - Thành Nguyen, Éva Tardos:
Parallel Imaging Problem. 684-695 - Daisuke Okanohara, Kunihiko Sadakane
An Online Algorithm for Finding the Longest Previous Factors. 696-707 - Paolo Penna, Carmine Ventre
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. 708-719 - Vasilis Samoladas:
Improved BDD Algorithms for the Simulation of Quantum Circuits. 720-731 - Peter Sanders, Dominik Schultes, Christian Vetter:
Mobile Route Planning. 732-743 - Stefan Schirra:
How Reliable Are Practical Point-in-Polygon Strategies? 744-755 - 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 - René A. Sitters:
Approximability of Average Completion Time Scheduling on Unrelated Machines. 768-779 - Mashhood Ishaque, Csaba D. Tóth:
Relative Convex Hulls in Semi-dynamic Subdivisions. 780-792 - Seung-Jin Sul, Tiffani L. Williams:
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms. 793-804 - Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides:
On the Size of the 3D Visibility Skeleton: Experimental Results. 805-816 - Hamid Zarrabi-Zadeh
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions. 817-829 - Anke van Zuylen:
Deterministic Sampling Algorithms for Network Design. 830-841
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-03 23:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: