Accepted Papers

Accepted Papers

Dániel Marx and Marcin Pilipczuk. Subexponential parameterized algorithms for graphs of polynomial growth
Omer Gold and Micha Sharir. Improved Bounds for 3SUM, $k$-SUM, and Linear Degeneracy
Niv Buchbinder, Danny Segev and Yevgeny Tkach. Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
János Balogh, József Békési, György Dósa, Leah Epstein and Asaf Levin. Online bin packing with cardinality constraints resolved
Sayan Bhattacharya, Manoj Gupta and Divyarthi Mohan. Improved Algorithm for Dynamic b-Matching
Marthe Bonamy, Lukasz Kowalik, Michał Pilipczuk, Arkadiusz Socała and Marcin Wrochna. Tight lower bounds for the complexity of multicoloring
Michael Wegner, Oskar Taubert, Alexander Schug and Henning Meyerhenke. Maxent-stress Optimization of 3D Biomolecular Models
Gilad Kutiel and Dror Rawitz. Local Search Algorithms for the Maximum Carpool Matching Problem
Konstantinos Mampentzidis and Gerth Stølting Brodal. Cache Oblivious Algorithms for Computing the Triplet Distance between Trees
Thomas Schibler and Subhash Suri. K-Dominance in Multidimensional Data: Theory and Applications
Alice Paul, Daniel Freund, Aaron Ferber, David Shmoys and David Williamson. Prize-Collecting TSP with a Budget Constraint
Graham Cormode, Hossein Jowhari, Morteza Monemizadeh and S Muthukrishnan. Streaming Algorithms for Matching Size Estimation in Sparse Graphs
Hisao Tamaki. Positive-instance driven dynamic programming for treewidth
Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi and Venetia Pliatsika. Profit Sharing and Efficiency in Utility Games
T-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang and Xiaowei Wu. Online Submodular Maximization Problem with Vector Packing Constraint
Dror Aiger, Haim Kaplan and Micha Sharir. Output sensitive algorithms for approximate incidences and their applications
Timothy Chan and Dimitrios Skrepetos. Faster Approximate Diameter and Distance Oracles in Planar Graphs
Marek Cygan, Lukasz Kowalik and Arkadiusz Socala. Improving TSP tours using dynamic programming over tree decompositions
Travis Gagie, Giovanni Manzini and Rossano Venturini. An Encoding for Order-Preserving Matching
Zeev Nutov. On the Tree Augmentation Problem
John Hershberger, Neeraj Kumar and Subhash Suri. Shortest Paths in the Plane with Obstacle Violations
Kristóf Bérczi and Yusuke Kobayashi. The Directed Disjoint Shortest Paths Problem
Susanne Albers and Sebastian Schraink. Tight Bounds for Online Coloring of Basic Graph Classes
Daniel Antunes, Claire Mathieu and Nabil Mustafa. Combinatorics of Local Search: An Optimal 4-Local Hall’s Theorem for Planar Graphs
Ramanujan M. S., Daniel Lokshtanov and Saket Saurabh. A Linear-Time Parameterized Algorithm for Node Unique Label Cover
Thomas Bosman and Neil Olver. Exploring the tractability of the capped hose model
Aissi Hassene, A. Ridha Mahjoub and R. Ravi. Randomized Contractions for Multiobjective Minimum Cuts
Evangelos Chatziafratis, Tim Roughgarden and Jan Vondrak. Stability and Recovery for Independence Systems
Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes and Oren Weimann. Dispersion on Trees
Sungjin Im, Benjamin Moseley, Kirk Pruhs and Clifford Stein. Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing
Syamantak Das and Andreas Wiese. On minimizing the makespan when some jobs cannot be assigned on the same machine
Peyman Afshani and Zhewei Wei. Independent Range Sampling, Revisited
Haim Kaplan, Sasanka Roy and Micha Sharir. Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
Ori Rottenstreich, Haim Kaplan and Avinatan Hassidim. Clustering in Hypergraphs to Minimize Average Edge Service Time
Pankaj Agarwal, Natan Rubin and Micha Sharir. Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats
Constantinos Daskalakis and Yasushi Kawase. Optimal Stopping Rules for Sequential Hypothesis Testing
Karl Bringmann, Ralph Keusch and Johannes Lengler. Sampling Geometric Inhomogeneous Random Graphs in Linear Time
Ramanujan M. S., Gregory Gutin, Felix Reidl and Magnus Wahström. Path-ontractions, edge deletions and connectivity preservation
Katherine Edwards, Irene Muzi and Paul Wollan. Half-integral linkages in highly connected directed graphs
Dušan Knop, Martin Koutecky and Matthias Mnich. Combinatorial n-fold Integer Programming and Applications
Zhijiang Li and Norbert Zeh. Computing Maximum Agreement Forests without Cluster Partitioning is Folly
Daniel Neuen and Pascal Schweitzer. Benchmark Graphs for Practical Graph Isomorphism
Moritz Baum, Julian Dibbelt, Dorothea Wagner and Tobias Zündorf. Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
Alon Eden, Tomer Ezra and Michal Feldman. Pricing Social Goods
Marc Roth. Counting restricted homomorphisms via Möbius inversion over matroid lattices
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald and Andrew Sutton. Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT
Monika Henzinger, Dariusz Leniowski and Claire Mathieu. Dynamic clustering to minimize the sum of radii
Shay Golan and Ely Porat. Real-time Streaming Multi-Pattern Search for Constant Alphabet
Vittorio Bilò and Cosimo Vinci. On the Impact of Singleton Strategies in Congestion Games
Antonis Thomas. Exponential lower bounds for history-based simplex pivot rules on abstract cubes
Martin R. Schuster and Maciej Liskiewicz. New Abilities and Limitations of Spectral Graph Bisection
William E. Devanny, Jeremy Fineman, Michael Goodrich and Tsvi Kopelowitz. The Online House Numbering Problem: Min-Max Online List Labeling
Gramoz Goranci, Monika Henzinger and Pan Peng. The Power of Vertex Sparsifiers in Dynamic Graph Algorithms
Gramoz Goranci, Monika Henzinger and Pan Peng. Improved Guarantees for Vertex Sparsification in Planar Graphs
Jocelyn Thiebaut, Stéphane Bessy and Marin Bougeret. Triangle packing in (sparse) tournaments: approximation and kernelization.
Dmitry Kosolobov and Dominik Kempa. LZ-End Parsing in Linear Time
Kshitij Gajjar and Jaikumar Radhakrishnan. Distance-preserving Subgraphs of Interval Graphs
Benjamin Burton, Erin Chambers, Marc van Kreveld, Wouter Meulemans, Tim Ophelders and Bettina Speckmann. Computing optimal homotopies over a spiked plane with polygonal
boundary
Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto. A Space-Optimal Grammar Compression
Aruni Choudhary, Michael Kerber and Sharath Raghvendra. Improved Approximate Rips Filtrations with Shifted Integer Lattices
Jennifer Iglesias, R Ravi, Guru Guruganesh and Laura Sanita. Single-sink Fractionally Subadditive
Network Design
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Łącki, Eva Rotenberg and Piotr Sankowski. Contracting a Planar Graph Efficiently
Prakash Saivasan, Roland Meyer, Peter Chini, Andreas Krebs and Jonathan Kolberg. On the Complexity of Bounded Context Switching
Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne and Inge Li Gørtz. Fast Dynamic Arrays
Ingo van Duijn and Peyman Afshani. Permuting and Batched Geometric Lower Bounds in the I/O model
Tobias Maier and Peter Sanders. Dynamic Space Efficient Hashing
Michael Axtmann, Sascha Witt, Daniel Ferizovic and Peter Sanders. In-place Parallel Super Scalar Samplesort (IPSSSSo)
Amariah Becker, Philip Klein and David Saulpic. A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs