Abstract is missing.
- The Robustness of Level SetsPaul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel. 1-10 [doi]
- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-MethodsFriedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese. 11-22 [doi]
- Non-clairvoyant Speed Scaling for Weighted Flow TimeSze-Hang Chan, Tak Wah Lam, Lap-Kei Lee. 23-35 [doi]
- A Robust PTAS for Machine Covering and PackingMartin Skutella, José Verschae. 36-47 [doi]
- Balancing Degree, Diameter and Weight in Euclidean SpannersShay Solomon, Michael Elkin. 48-59 [doi]
- Testing Euclidean SpannersFrank Hellweg, Melanie Schmidt, Christian Sohler. 60-71 [doi]
- Fast Approximation in Subspaces by Doubling Metric DecompositionMarek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski. 72-83 [doi]
- ::::f::::-Sensitivity Distance Oracles and Routing SchemesShiri Chechik, Michael Langberg, David Peleg, Liam Roditty. 84-96 [doi]
- Fast Minor Testing in Planar GraphsIsolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos. 97-109 [doi]
- On the Number of Spanning Trees a Planar Graph Can HaveKevin Buchin, André Schulz. 110-121 [doi]
- Contractions of Planar Graphs in Polynomial TimeMarcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos. 122-133 [doi]
- Communication Complexity of Quasirandom Rumor SpreadingPetra Berenbrink, Robert Elsässer, Thomas Sauerwald. 134-145 [doi]
- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-SharingEmmanouil Pountourakis, Angelina Vidali. 146-157 [doi]
- Contribution Games in Social NetworksElliot Anshelevich, Martin Hoefer. 158-169 [doi]
- Improved Bounds for Online Stochastic MatchingBahman Bahmani, Michael Kapralov. 170-181 [doi]
- Online Stochastic Packing Applied to Display Ad AllocationJon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein. 182-194 [doi]
- Caching Is Hard - Even in the Fault ModelMarek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu. 195-206 [doi]
- Superselectors: Efficient Constructions and ApplicationsFerdinando Cicalese, Ugo Vaccaro. 207-218 [doi]
- Estimating the Average of a Lipschitz-Continuous Function from One SampleAbhimanyu Das, David Kempe. 219-230 [doi]
- Streaming Graph Computations with a Helpful AdvisorGraham Cormode, Michael Mitzenmacher, Justin Thaler. 231-242 [doi]
- Algorithms for Dominating Set in Disk Graphs: Breaking the log::::n:::: Barrier - (Extended Abstract)Matt Gibson, Imran A. Pirwani. 243-254 [doi]
- Minimum Vertex Cover in Rectangle GraphsReuven Bar-Yehuda, Danny Hermelin, Dror Rawitz. 255-266 [doi]
- Feedback Vertex Sets in TournamentsSerge Gaspers, Matthias Mnich. 267-277 [doi]
- ::::n::::-Level Graph PartitioningVitaly Osipov, Peter Sanders. 278-289 [doi]
- Fast Routing in Very Large Public Transportation Networks Using Transfer PatternsHannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, Fabien Viger. 290-301 [doi]
- Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper BoundPierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino. 302-313 [doi]
- Budgeted Red-Blue Median and Its GeneralizationsMohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz. 314-325 [doi]
- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of VariablesGregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo. 326-337 [doi]
- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation SystemsLaura Galli, Sebastian Stiller. 338-349 [doi]
- Robust Algorithms for Sorting Railway CarsChristina Büsing, Jens Maue. 350-361 [doi]
- Cloning Voronoi Diagrams via Retroactive Data StructuresMatthew T. Dickerson, David Eppstein, Michael T. Goodrich. 362-373 [doi]
- A Unified Approach to Approximate Proximity SearchingSunil Arya, Guilherme Dias da Fonseca, David M. Mount. 374-385 [doi]
- Spatio-temporal Range Searching over Compressed Kinetic Sensor DataSorelle A. Friedler, David M. Mount. 386-397 [doi]
- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Point-LocationMichael Hemmer, Ophir Setter, Dan Halperin. 398-409 [doi]
- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded StringsKuan-Yu Chen, Kun-Mao Chao. 415-426 [doi]
- Fast Prefix Search in Little Space, with ApplicationsDjamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. 427-438 [doi]
- On the Huffman and Alphabetic Tree Problem with General Cost FunctionsHiroshi Fujiwara, Tobias Jacobs. 439-450 [doi]
- Medium-Space Algorithms for Inverse BWTJuha Kärkkäinen, Simon J. Puglisi. 451-462 [doi]
- Median TrajectoriesKevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma. 463-474 [doi]
- Optimal Cover of Points by Disks in a Simple PolygonHaim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir. 475-486 [doi]
- Stability of ::::epsilon::::-KernelsPankaj K. Agarwal, Jeff M. Phillips, Hai Yu. 487-499 [doi]
- The Geodesic Diameter of Polygonal DomainsSang Won Bae, Matias Korman, Yoshio Okamoto. 500-511 [doi]
- Polyhedral and Algorithmic Properties of Quantified Linear ProgramsUlf Lorenz, Alexander Martin, Jan Wolf. 512-523 [doi]
- Approximating Parameterized Convex Optimization ProblemsJoachim Giesen, Martin Jaggi, Sören Laue. 524-535 [doi]
- Approximation Schemes for Multi-Budgeted Independence SystemsFabrizio Grandoni, Rico Zenklusen. 536-548 [doi]
- Algorithmic Meta-theorems for Restrictions of TreewidthMichael Lampis. 549-560 [doi]
- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded GenusViresh Patel. 561-572 [doi]
- Constructing the R* Consensus Tree of Two Trees in Subcubic TimeJesper Jansson, Wing-Kin Sung. 573-584 [doi]