Abstract is missing.
- Sorting Under Forbidden ComparisonsIndranil Banerjee, Dana S. Richards. [doi]
- Constrained Geodesic Centers of a Simple PolygonEunjin Oh, Wanbin Son, Hee-Kap Ahn. [doi]
- Time-Space Trade-offs for Triangulating a Simple PolygonBoris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen. [doi]
- Minimizing the Continuous Diameter when Augmenting Paths and Cycles with ShortcutsJean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid. [doi]
- Computation as a Scientific Weltanschauung (Invited Talk)Christos H. Papadimitriou. [doi]
- A Plane 1.88-Spanner for Points in Convex PositionMahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid. [doi]
- Cuckoo Filter: Simplification and AnalysisDavid Eppstein. [doi]
- A Simple Mergeable DictionaryAdam Karczmarz. [doi]
- Online Dominating SetJoan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen. [doi]
- Colouring Diamond-free GraphsKonrad Dabrowski, François Dross, Daniël Paulusma. [doi]
- Approximating Connected Facility Location with Lower and Upper Bounds via LP RoundingZachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour. [doi]
- Excluded Grid Theorem: Improved and Simplified (Invited Talk)Julia Chuzhoy. [doi]
- Linear-Time Recognition of Map Graphs with Outerplanar WitnessMatthias Mnich, Ignaz Rutter, Jens M. Schmidt. [doi]
- Lower Bounds for Approximation Schemes for Closest StringMarek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh. [doi]
- Optimal Online Escape Path Against a CertificateElmar Langetepe, David Kübel. [doi]
- Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable GraphsIyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen. [doi]
- Front Matter, Table of Contents, Preface, Program Committee, Subreviewers [doi]
- Approximating the Integral Fréchet DistanceAnil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer. [doi]
- The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems (Invited Talk)Dániel Marx. [doi]
- The p-Center Problem in Tree Networks RevisitedAritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song. [doi]
- Coloring Graphs Having Few Colorings Over Path DecompositionsAndreas Björklund. [doi]
- A Clustering-Based Approach to Kinetic Closest PairTimothy M. Chan, Zahed Rahmati. [doi]
- Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar GraphsJaroslaw Byrka, Mateusz Lewandowski, Carsten Moldenhauer. [doi]
- A Framework for Dynamic Parameterized Dictionary MatchingArnab Ganguly 0002, Wing-Kai Hon, Rahul Shah. [doi]
- Efficient Summing over Sliding WindowsRan Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner. [doi]
- Total Stability in Stable Matching GamesSushmita Gupta, Kazuo Iwama, Shuichi Miyazaki. [doi]
- Randomized Algorithms for Finding a Majority ElementPawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski. [doi]
- Estimating The Makespan of The Two-Valued Restricted Assignment ProblemKlaus Jansen, Kati Land, Marten Maack. [doi]
- Extension Complexity, MSO Logic, and Treewidth Petr Kolman, Martin Koutecký, Hans Raj Tiwary. [doi]
- Below All Subsets for Some Permutational Counting Problems Andreas Björklund. [doi]
- A Linear Kernel for Finding Square Roots of Almost Planar GraphsPetr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart. [doi]
- Lagrangian Duality based Algorithms in Online Energy-Efficient SchedulingNguyen Kim Thang. [doi]
- A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs Zachary Friggstad, Jochen Könemann, Mohammad Shadravan. [doi]
- On Routing Disjoint Paths in Bounded Treewidth GraphsAlina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski. [doi]