Table of Contents

• The Online Replacement Path ProblemDavid Adjiashvili, Gianpaolo Oriolo, Marco Senatore. 1-12 [doi]
• Flip Distance between Triangulations of a Simple Polygon is NP-CompleteOswin Aichholzer, Wolfgang Mulzer, Alexander Pilz. 13-24 [doi]
• Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore ArchitecturesDeepak Ajwani, Nodari Sitchinava. 25-36 [doi]
• Computing the Greedy Spanner in Linear SpaceSander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin. 37-48 [doi]
• Friendship and Stable MatchingElliot Anshelevich, Onkar Bhardwaj, Martin Hoefer. 49-60 [doi]
• An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution RastersLars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis. 61-72 [doi]
• Logit Dynamics with Concurrent Updates for Local Interaction GamesVincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano. 73-84 [doi]
• On Resilient Graph SpannersGiorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini. 85-96 [doi]
• Maximizing Barrier Coverage Lifetime with Mobile SensorsAmotz Bar-Noy, Dror Rawitz, Peter Terlecky. 97-108 [doi]
• Theory and Implementation of Online Multiselection AlgorithmsJérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson. 109-120 [doi]
• An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical ClusteringAndreas Beckmann, Ulrich Meyer, David Veith. 121-132 [doi]
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler TransformDjamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen. 133-144 [doi]
• Tight Lower and Upper Bounds for the Complexity of Canonical Colour RefinementChristoph Berkholz, Paul Bonsma, Martin Grohe. 145-156 [doi]
• A Faster Computation of All the Best Swap Edges of a Shortest Paths TreeDavide Bilò, Luciano Gualà, Guido Proietti. 157-168 [doi]
• Parallel String Sample SortTimo Bingmann, Peter Sanders. 169-180 [doi]
• Exclusive Graph SearchingLélia Blin, Janna Burman, Nicolas Nisse. 181-192 [doi]
• Largest Chordal and Interval Subgraphs Faster Than 2 nIvan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger. 193-204 [doi]
• Revisiting the Problem of Searching on a LineProsenjit Bose, Jean-Lou De Carufel, Stephane Durocher. 205-216 [doi]
• On the Existence of 0/1 Polytopes with High Semidefinite Extension ComplexityJop Briët, Daniel Dadush, Sebastian Pokutta. 217-228 [doi]
• The Encoding Complexity of Two Dimensional Range Minimum Data StructuresGerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi. 229-240 [doi]
• Computing the Fréchet Distance with a Retractable LeashKevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer. 241-252 [doi]
• Vertex Deletion for 3D Delaunay TriangulationsKevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Richard Shewchuk. 253-264 [doi]
• Economic 3-Colored Subdivision of TriangulationsLucas Moutinho Bueno, Jorge Stolfi. 265-276 [doi]
• Limitations of Deterministic Auction Design for Correlated BiddersIoannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou. 277-288 [doi]
• Connectivity Inference in Mass Spectrometry Based Structure DeterminationDeepesh Agarwal, Júlio César Silva Araújo, Christelle Caillouet, Frédéric Cazals, David Coudert, Stéphane Pérennes. 289-300 [doi]
• Secluded Connectivity ProblemsShiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg. 301-312 [doi]
• List H-Coloring a Graph by Removing Few VerticesRajesh Hemant Chitnis, László Egri, Dániel Marx. 313-324 [doi]
• Rumor Spreading in Random Evolving GraphsAndrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri. 325-336 [doi]
• Dynamic Graphs in the Sliding-Window ModelMichael S. Crouch, Andrew McGregor, Daniel Stubbs. 337-348 [doi]
• A Quantization Framework for Smoothed Analysis of Euclidean Optimization ProblemsRadu Curticapean, Marvin Künnemann. 349-360 [doi]
• Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract)Marek Cygan, Fabrizio Grandoni, Danny Hermelin. 361-372 [doi]
• Labeling Moving Points with a Trade-Off between Label Speed and Label OverlapMark de Berg, Dirk H. P. Gerrits. 373-384 [doi]
• Inefficiency of Standard Multi-unit AuctionsBart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis. 385-396 [doi]
• FPTAS for Minimizing Earth Mover's Distance under Rigid TransformationsHu Ding, Jinhui Xu. 397-408 [doi]
• Maximizing a Submodular Function with Viability ConstraintsWolfgang Dvorák, Monika Henzinger, David P. Williamson. 409-420 [doi]
• Table CartogramsWilliam S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek. 421-432 [doi]
• Network Bargaining with General CapacitiesLinda Farczadi, Konstantinos Georgiou, Jochen Könemann. 433-444 [doi]
• Nearly Optimal Private ConvolutionNadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov. 445-456 [doi]
• Tractable Parameterizations for the Minimum Linear Arrangement ProblemMichael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai. 457-468 [doi]
• Compressed Cache-Oblivious String B-treePaolo Ferragina, Rossano Venturini. 469-480 [doi]
• BICO: BIRCH Meets Coresets for k-Means ClusteringHendrik Fichtenberger, Marc Gillé, Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler. 481-492 [doi]
• Long Circuits and Large Euler SubgraphsFedor V. Fomin, Petr A. Golovach. 493-504 [doi]
• Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete DigraphFedor V. Fomin, Michal Pilipczuk. 505-516 [doi]
• Binary Jumbled Pattern Matching on Trees and Tree-Like StructuresTravis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann. 517-528 [doi]
• Kernelization Using Structural Parameters on Sparse Graph ClassesJakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sanchez Villaamil, Somnath Sikdar. 529-540 [doi]
• On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3Panos Giannopoulos, Christian Knauer, Daniel Werner. 541-552 [doi]
• Encodings for Range Selection and Top-k QueriesRoberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti. 553-564 [doi]
• Fréchet Queries in Geometric TreesJoachim Gudmundsson, Michiel H. M. Smid. 565-576 [doi]
• A Computationally Efficient FPTAS for Convex Stochastic Dynamic ProgramsNir Halman, Giacomo Nannicini, James B. Orlin. 577-588 [doi]
• An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial AuctionsThomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking. 589-600 [doi]
• Balls into Bins Made FasterMegha Khosla. 601-612 [doi]
• An Alternative Approach to Alternative Routes: HiDARMoritz Kobitzsch. 613-624 [doi]
• Efficient Indexes for Jumbled Pattern Matching with Constant-Sized AlphabetTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter. 625-636 [doi]
• Better Approximation Algorithms for Technology DiffusionJochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità. 637-646 [doi]
• On Polynomial Kernels for Integer Linear Programs: Covering, Packing and FeasibilityStefan Kratsch. 647-658 [doi]
• Balanced Neighbor Selection for BitTorrent-Like NetworksSándor Laki, Tamás Lukovszki. 659-670 [doi]
• Parameterized Complexity of Directed Steiner Tree on Sparse GraphsMark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý. 671-682 [doi]
• Improved Approximation Algorithms for Projection Games - (Extended Abstract)Pasin Manurangsi, Dana Moshkovitz. 683-694 [doi]
• The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent CohomologyJean-Daniel Boissonnat, Tamal K. Dey, Clément Maria. 695-706 [doi]
• Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree ConnectionsJannik Matuschke, Andreas Bley, Benjamin Müller. 707-718 [doi]
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is PolynomialGeorge B. Mertzios. 719-730 [doi]
• Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse DatasetsShin-ichi Minato. 731-742 [doi]
• Optimal Color Range Reporting in One DimensionYakov Nekrich, Jeffrey Scott Vitter. 743-754 [doi]
• Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed ScalingNguyen Kim Thang. 755-766 [doi]
• Euclidean Greedy Drawings of TreesMartin Nöllenburg, Roman Prutkin. 767-778 [doi]
• Sparse Fault-Tolerant BFS TreesMerav Parter, David Peleg. 779-790 [doi]
• On the Most Likely Convex Hull of Uncertain PointsSubhash Suri, Kevin Verbeek, Hakan Yildiz. 791-802 [doi]
• Top-k Document Retrieval in External MemoryRahul Shah, Cheng Sheng, Sharma V. Thankachan, Jeffrey Scott Vitter. 803-814 [doi]
• Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-Core ArchitecturesKai Xiao, Danny Ziyi Chen, Xiaobo Sharon Hu, Bo Zhou. 815-826 [doi]