Algorithms - ESA 2010 : 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010 ; proceedings. Mark de Berg, Ulrich Meyer (eds.). Part I /
Annotation
Saved in:
| Main Authors: | , |
|---|---|
| Corporate Author: | |
| Format: | Ebook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
[2010]
|
| Series: | Lecture notes in computer science ;
6346. |
| Subjects: | |
| Online Access: | Springer eBooks |
Table of Contents:
- Invited Talk:
- The Robustness of Level Sets / Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit Patel
- Session 1a:
- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods / Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella et al.
- Non-clairvoyant Speed Scaling for Weighted Flow Time / Sze-Hang Chan, Tak-Wah Lam, Lap-Kei Lee
- A Robust PTAS for Machine Covering and Packing / Martin Skutella, José Verschae
- Session 1b:
- Balancing Degree, Diameter and Weight in Euclidean Spanners / Shay Solomon, Michael Elkin
- Testing Euclidean Spanners / Frank Hellweg, Melanie Schmidt, Christian Sohler
- Fast Approximation in Subspaces by Doubling Metric Decomposition / Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
- f-Sensitivity Distance Oracles and Routing Schemes / Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
- Session 2a:
- Fast Minor Testing in Planar Graphs / Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
- On the Number of Spanning Trees a Planar Graph Can Have / Kevin Buchin, André Schulz
- Contractions of Planar Graphs in Polynomial Time / Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos
- Session 2b:
- Communication Complexity of Quasirandom Rumor Spreading / Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing / Emmanouil Pountourakis, Angelina Vidali
- Contribution Games in Social Networks / Elliot Anshelevich, Martin Hoefer
- Session 3a:
- Improved Bounds for Online Stochastic Matching / Bahman Bahmani, Michael Kapralov
- Online Stochastic Packing Applied to Display Ad Allocation / Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Cliff Stein
- Caching Is Hard – Even in the Fault Model / Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu
- Session 3b:
- Superselectors: Efficient Constructions and Applications / Ferdinando Cicalese, Ugo Vaccaro
- Estimating the Average of a Lipschitz-Continuous Function from One Sample / Abhimanyu Das, David Kempe
- Streaming Graph Computations with a Helpful Advisor / Graham Cormode, Michael Mitzenmacher, Justin Thaler
- Session 4a:
- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier / Matt Gibson, Imran A. Pirwani
- Minimum Vertex Cover in Rectangle Graphs / Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
- Feedback Vertex Sets in Tournaments / Serge Gaspers, Matthias Mnich
- Session 4b:
- n-Level Graph Partitioning / Vitaly Osipov, Peter Sanders
- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns / Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev et al.
- Finding the Diameter in Real-World Graphs / Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino
- Session 5a:
- Budgeted Red-Blue Median and Its Generalizations / MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables / Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems / Laura Galli, Sebastian Stiller
- Robust Algorithms for Sorting Railway Cars / Christina Büsing, Jens Maue
- Session 5b:
- Cloning Voronoi Diagrams via Retroactive Data Structures / Matthew T. Dickerson, David Eppstein, Michael T. Goodrich
- A Unified Approach to Approximate Proximity Searching / Sunil Arya, Guilherme D. da Fonseca, David M. Mount
- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data / Sorelle A. Friedler, David M. Mount
- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space / Michael Hemmer, Ophir Setter, Dan Halperin
- Invited Talk:
- Local Graph Exploration and Fast Property Testing / Artur Czumaj
- Session 6a:
- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings / Kuan-Yu Chen, Kun-Mao Chao
- Fast Prefix Search in Little Space, with Applications / Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
- On the Huffman and Alphabetic Tree Problem with General Cost Functions / Hiroshi Fujiwara, Tobias Jacobs
- Medium-Space Algorithms for Inverse BWT / Juha Kärkkäinen, Simon J. Puglisi
- Median Trajectories / Kevin Buchin, Maike Buchin, Marc van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk et al.
- Optimal Cover of Points by Disks in a Simple Polygon / Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir
- Stability of ε-Kernels / Pankaj K. Agarwal, Jeff M. Phillips, Hai Yu
- The Geodesic Diameter of Polygonal Domains / Sang Won Bae, Matias Korman, Yoshio Okamoto
- Session 7a:
- Polyhedral and Algorithmic Properties of Quantified Linear Programs / U. Lorenz, A. Martin, J. Wolf
- Approximating Parameterized Convex Optimization Problems / Joachim Giesen, Martin Jaggi, Sören Laue
- Approximation Schemes for Multi-Budgeted Independence Systems / Fabrizio Grandoni, Rico Zenklusen
- Session 7b:
- Algorithmic Meta-theorems for Restrictions of Treewidth / Michael Lampis
- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus / Viresh Patel
- Constructing the R* Consensus Tree of Two Trees in Subcubic Time / Jesper Jansson, Wing-Kin Sung.