Table of Contents

• On Big Data AlgorithmicsYossi Matias. 1 [doi]
• Open Problems in Throughput SchedulingJiri Sgall. 2-11 [doi]
• Preemptive Coordination Mechanisms for Unrelated MachinesFidaa Abed, Chien-Chung Huang. 12-23 [doi]
• Hierarchical Hub Labelings for Shortest PathsIttai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck. 24-35 [doi]
• Bottleneck Non-crossing Matching in the PlaneA. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi. 36-47 [doi]
• Lower Bounds for Sorted Geometric Queries in the I/O ModelPeyman Afshani, Norbert Zeh. 48-59 [doi]
• Constructing Street Networks from GPS TrajectoriesMahmuda Ahmed, Carola Wenk. 60-71 [doi]
• I/O-efficient Hierarchical Diameter ApproximationDeepak Ajwani, Ulrich Meyer, David Veith. 72-83 [doi]
• On the Value of Job Migration in Online Makespan MinimizationSusanne Albers, Matthias Hellwig. 84-95 [doi]
• Simplifying Massive Contour MapsLars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen. 96-107 [doi]
• Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a StashMartin Aumüller, Martin Dietzfelbinger, Philipp Woelfel. 108-120 [doi]
• On Online Labeling with Polynomially Many LabelsMartin Babka, Jan Bulánek, Vladimír Cunát, Michal Koucký, Michael Saks. 121-132 [doi]
• A 5-Approximation for Capacitated Facility LocationManisha Bansal, Naveen Garg, Neelima Gupta. 133-144 [doi]
• Weighted Geometric Set Multi-cover via Quasi-uniform SamplingNikhil Bansal, Kirk Pruhs. 145-156 [doi]
• A Bicriteria Approximation for the Reordering Buffer ProblemSiddharth Barman, Shuchi Chawla, Seeun Umboh. 157-168 [doi]
• Time-Dependent Route Planning with Generalized Objective FunctionsGernot Veit Batz, Peter Sanders. 169-180 [doi]
• New Lower and Upper Bounds for Representing SequencesDjamal Belazzougui, Gonzalo Navarro. 181-192 [doi]
• Span Programs and Quantum Algorithms for st-Connectivity and Claw DetectionAleksandrs Belovs, Ben W. Reichardt. 193-204 [doi]
• The Stretch Factor of L 1- and L ∞ -Delaunay TriangulationsNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. 205-216 [doi]
• Two Dimensional Range Minimum Queries and Fibonacci LatticesGerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao 0001. 217-228 [doi]
• Locally Correct Fréchet MatchingsKevin Buchin, Maike Buchin, Wouter Meulemans, Bettina Speckmann. 229-240 [doi]
• The Clique Problem in Ray Intersection GraphsSergio Cabello, Jean Cardinal, Stefan Langerman. 241-252 [doi]
• Revenue Guarantees in Sponsored Search AuctionsIoannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou. 253-264 [doi]
• Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and SpiteT.-H. Hubert Chan, Fei Chen, Li Ning. 265-276 [doi]
• Optimal Lower Bound for Differentially Private Multi-party AggregationT.-H. Hubert Chan, Elaine Shi, Dawn Song. 277-288 [doi]
• A Model for Minimizing Active Processor TimeJessica Chang, Harold N. Gabow, Samir Khuller. 289-300 [doi]
• Polynomial-Time Algorithms for Energy Games with Special Weight StructuresKrishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai. 301-312 [doi]
• Data Structures on Event GraphsBernard Chazelle, Wolfgang Mulzer. 313-324 [doi]
• Improved Distance Oracles and Spanners for Vertex-Labeled GraphsShiri Chechik. 325-336 [doi]
• The Quantum Query Complexity of Read-Many FormulasAndrew M. Childs, Shelby Kimmel, Robin Kothari. 337-348 [doi]
• A Path-Decomposition Theorem with Applications to Pricing and Covering on TreesMarek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski. 349-360 [doi]
• Steiner Forest Orientation ProblemsMarek Cygan, Guy Kortsarz, Zeev Nutov. 361-372 [doi]
• A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph ProblemsJames M. Davis, David P. Williamson. 373-382 [doi]
• Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density ScenesMark de Berg, Marcel Roeloffzen, Bettina Speckmann. 383-394 [doi]
• Finding Social Optima in Congestion Games with Positive ExternalitiesBart de Keijzer, Guido Schäfer. 395-406 [doi]
• Better Bounds for Graph BisectionDaniel Delling, Renato Fonseca F. Werneck. 407-418 [doi]
• On the Complexity of Metric DimensionJosep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen. 419-430 [doi]
• Embedding Paths into Trees: VM Placement to Minimize CongestionDebojyoti Dutta, Michael Kapralov, Ian Post, Rajendra Shinde. 431-442 [doi]
• Faster Geometric Algorithms via Dynamic Determinant ComputationVissarion Fisikopoulos, Luis Mariano Peñaranda. 443-454 [doi]
• Lines through Segments in 3D SpaceEfi Fogel, Michael Hemmer, Asaf Porat, Dan Halperin. 455-466 [doi]
• A Polynomial Kernel for Proper Interval Vertex DeletionFedor V. Fomin, Saket Saurabh, Yngve Villanger. 467-478 [doi]
• Knowledge, Level of Symmetry, and Time of Leader ElectionEmanuele G. Fusco, Andrzej Pelc. 479-490 [doi]
• An Experimental Study of Dynamic DominatorsLoukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni. 491-502 [doi]
• Optimizing over the Growing SpectrahedronJoachim Giesen, Martin Jaggi, Sören Laue. 503-514 [doi]
• Induced Disjoint Paths in Claw-Free GraphsPetr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen. 515-526 [doi]
• On Min-Power Steiner TreeFabrizio Grandoni. 527-538 [doi]
• Maximum Multicommodity Flows over Time without Intermediate StorageMartin Groß, Martin Skutella. 539-550 [doi]
• Approximating Earliest Arrival Flows in Arbitrary NetworksMartin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt. 551-562 [doi]
• Resource Buying GamesTobias Harks, Britta Peis. 563-574 [doi]
• Succinct Data Structures for Path QueriesMeng He, J. Ian Munro, Gelin Zhou. 575-586 [doi]
• Approximation of Minimum Cost HomomorphismsPavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey. 587-598 [doi]
• Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-FreenessFrank Hellweg, Christian Sohler. 599-610 [doi]
• Improved Implementation of Point Location in General Two-Dimensional SubdivisionsMichael Hemmer, Michal Kleinbort, Dan Halperin. 611-623 [doi]
• Parameterized Complexity of Induced H-Matching on Claw-Free GraphsDanny Hermelin, Matthias Mnich, Erik Jan van Leeuwen. 624-635 [doi]
• Solving Simple Stochastic Games with Few Coin Toss PositionsRasmus Ibsen-Jensen, Peter Bro Miltersen. 636-647 [doi]
• Efficient Communication Protocols for Deciding Edit DistanceHossein Jowhari. 648-658 [doi]
• Approximation Algorithms for Wireless Link Scheduling with Flexible Data RatesThomas Kesselheim. 659-670 [doi]
• Extending Partial Representations of Function Graphs and Permutation GraphsPavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak. 671-682 [doi]
• A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing MinimizationYasuaki Kobayashi, Hisao Tamaki. 683-694 [doi]
• Minimum Average Distance TriangulationsLászló Kozma. 695-706 [doi]
• Colouring AT-Free GraphsDieter Kratsch, Haiko Müller. 707-718 [doi]
• Routing Regardless of Network StabilityBundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong. 719-730 [doi]
• The Simplex Tree: An Efficient Data Structure for General Simplicial ComplexesJean-Daniel Boissonnat, Clément Maria. 731-742 [doi]
• Succinct PosetsJ. Ian Munro, Patrick K. Nicholson. 743-754 [doi]
• Polynomial-Time Approximation Schemes for Shortest Path with AlternativesTim Nonner. 755-765 [doi]
• On Computing Straight Skeletons by Means of Kinetic TriangulationsPeter Palfrader, Martin Held, Stefan Huber. 766-777 [doi]
• A Self-adjusting Data Structure for Multidimensional Point SetsEunhui Park, David M. Mount. 778-789 [doi]
• TSP Tours in Cubic Graphs: Beyond 4/3José R. Correa, Omar Larré, José A. Soto. 790-801 [doi]
• FPT Algorithms for Domination in Biclique-Free GraphsJan Arne Telle, Yngve Villanger. 802-812 [doi]
• Maximum Flow Networks for Stability Analysis of LEGO®StructuresMartin Waßmann, Karsten Weicker. 813-824 [doi]
• Average Case Analysis of Java 7's Dual Pivot QuicksortSebastian Wild, Markus E. Nebel. 825-836 [doi]