Abstract is missing.
- Improved Approximate Rips Filtrations with Shifted Integer LatticesAruni Choudhary, Michael Kerber, Sharath Raghvendra. [doi]
- Online Submodular Maximization Problem with Vector Packing ConstraintT.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu. [doi]
- Randomized Contractions for Multiobjective Minimum CutsHassene Aissi, Ali Ridha Mahjoub, R. Ravi. [doi]
- Dynamic Clustering to Minimize the Sum of RadiiMonika Henzinger, Dariusz Leniowski, Claire Mathieu. [doi]
- Profit Sharing and Efficiency in Utility GamesSreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika. [doi]
- Contracting a Planar Graph EfficientlyJacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski. [doi]
- Computing Maximum Agreement Forests without Cluster Partitioning is FollyZhijiang Li, Norbert Zeh. [doi]
- Improved Algorithm for Dynamic b-MatchingSayan Bhattacharya, Manoj Gupta, Divyarthi Mohan. [doi]
- Independent Range Sampling, RevisitedPeyman Afshani, Zhewei Wei. [doi]
- Bounds on the Satisfiability Threshold for Power Law Distributed Random SATTobias Friedrich 0001, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton. [doi]
- The Online House Numbering Problem: Min-Max Online List LabelingWilliam E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz. [doi]
- On the Impact of Singleton Strategies in Congestion GamesVittorio Bilò, Cosimo Vinci. [doi]
- On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same MachineSyamantak Das, Andreas Wiese. [doi]
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid LatticesMarc Roth. [doi]
- Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of PointsHaim Kaplan, Sasanka Roy, Micha Sharir. [doi]
- Permuting and Batched Geometric Lower Bounds in the I/O ModelPeyman Afshani, Ingo van Duijn. [doi]
- Path-Contractions, Edge Deletions and Connectivity PreservationGregory Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström. [doi]
- Approximate Nearest Neighbor Search Amid Higher-Dimensional FlatsPankaj K. Agarwal, Natan Rubin, Micha Sharir. [doi]
- Online Bin Packing with Cardinality Constraints ResolvedJános Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin. [doi]
- Output Sensitive Algorithms for Approximate Incidences and Their ApplicationsDror Aiger, Haim Kaplan, Micha Sharir. [doi]
- Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar GraphsDaniel Antunes, Claire Mathieu, Nabil H. Mustafa. [doi]
- An Encoding for Order-Preserving MatchingTravis Gagie, Giovanni Manzini, Rossano Venturini. [doi]
- Improved Guarantees for Vertex Sparsification in Planar GraphsGramoz Goranci, Monika Henzinger, Pan Peng. [doi]
- Clustering in Hypergraphs to Minimize Average Edge Service TimeOri Rottenstreich, Haim Kaplan, Avinatan Hassidim. [doi]
- Minimizing Maximum Flow Time on Related Machines via Dynamic Posted PricingSungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein. [doi]
- Cache Oblivious Algorithms for Computing the Triplet Distance Between TreesGerth Stølting Brodal, Konstantinos Mampentzidis. [doi]
- Pricing Social GoodsAlon Eden, Tomer Ezra, Michal Feldman. [doi]
- Temporal ClusteringTamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos. [doi]
- Real-Time Streaming Multi-Pattern Search for Constant AlphabetShay Golan, Ely Porat. [doi]
- New Abilities and Limitations of Spectral Graph BisectionMartin R. Schuster, Maciej Liskiewicz. [doi]
- In-Place Parallel Super Scalar Samplesort (IPSSSSo)Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders 0001. [doi]
- Computing Optimal Homotopies over a Spiked Plane with Polygonal BoundaryBenjamin Burton, Erin W. Chambers, Marc J. van Kreveld, Wouter Meulemans, Tim Ophelders, Bettina Speckmann. [doi]
- Stability and Recovery for Independence SystemsVaggos Chatziafratis, Tim Roughgarden, Jan Vondrák. [doi]
- Shortest Paths in the Plane with Obstacle ViolationsJohn Hershberger, Neeraj Kumar, Subhash Suri. [doi]
- Distance-Preserving Subgraphs of Interval GraphsKshitij Gajjar, Jaikumar Radhakrishnan. [doi]
- Sampling Geometric Inhomogeneous Random Graphs in Linear TimeKarl Bringmann, Ralph Keusch, Johannes Lengler. [doi]
- On the Tree Augmentation ProblemZeev Nutov. [doi]
- Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric VehiclesMoritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zündorf. [doi]
- Tight Lower Bounds for the Complexity of MulticoloringMarthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna. [doi]
- Prize-Collecting TSP with a Budget ConstraintAlice Paul, Daniel Freund 0001, Aaron Ferber, David B. Shmoys, David P. Williamson. [doi]
- Improved Bounds for 3SUM, k-SUM, and Linear DegeneracyOmer Gold, Micha Sharir. [doi]
- Triangle Packing in (Sparse) Tournaments: Approximation and KernelizationStéphane Bessy, Marin Bougeret, Jocelyn Thiebaut. [doi]
- Optimal Stopping Rules for Sequential Hypothesis TestingConstantinos Daskalakis, Yasushi Kawase. [doi]
- A Linear-Time Parameterized Algorithm for Node Unique Label CoverDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh. [doi]
- The Directed Disjoint Shortest Paths ProblemKristóf Bérczi, Yusuke Kobayashi 0001. [doi]
- Dispersion on TreesPawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann. [doi]
- Faster Approximate Diameter and Distance Oracles in Planar GraphsTimothy M. Chan, Dimitrios Skrepetos. [doi]
- Sketching for Geometric Problems (Invited Talk)David P. Woodruff. [doi]
- LZ-End Parsing in Linear TimeDominik Kempa, Dmitry Kosolobov. [doi]
- Fast Dynamic ArraysPhilip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz. [doi]
- Improving TSP Tours Using Dynamic Programming over Tree DecompositionsMarek Cygan, Lukasz Kowalik, Arkadiusz Socala. [doi]
- Tight Bounds for Online Coloring of Basic Graph ClassesSusanne Albers, Sebastian Schraink. [doi]
- Combinatorial n-fold Integer Programming and ApplicationsDusan Knop, Martin Koutecký, Matthias Mnich. [doi]
- K-Dominance in Multidimensional Data: Theory and ApplicationsThomas Schibler, Subhash Suri. [doi]
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus GraphsAmariah Becker, Philip N. Klein, David Saulpic. [doi]
- Half-Integral Linkages in Highly Connected Directed GraphsKatherine Edwards, Irene Muzi, Paul Wollan. [doi]
- Benchmark Graphs for Practical Graph IsomorphismDaniel Neuen, Pascal Schweitzer. [doi]
- Positive-Instance Driven Dynamic Programming for TreewidthHisao Tamaki. [doi]
- Maxent-Stress Optimization of 3D Biomolecular ModelsMichael Wegner, Oskar Taubert, Alexander Schug, Henning Meyerhenke. [doi]
- Online Algorithms for Maximum Cardinality Matching with Edge ArrivalsNiv Buchbinder, Danny Segev, Yevgeny Tkach. [doi]
- The Power of Vertex Sparsifiers in Dynamic Graph AlgorithmsGramoz Goranci, Monika Henzinger, Pan Peng. [doi]
- Front Matter, Table of Contents, Preface, Programm Commitees, External Reviewers [doi]
- Local Search Algorithms for Maximum Carpool MatchingGilad Kutiel, Dror Rawitz. [doi]
- Dynamic Space Efficient HashingTobias Maier, Peter Sanders 0001. [doi]
- Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract CubesAntonis Thomas. [doi]
- Subexponential Parameterized Algorithms for Graphs of Polynomial GrowthDániel Marx, Marcin Pilipczuk. [doi]
- On the Complexity of Bounded Context SwitchingPeter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan. [doi]
- Exploring the Tractability of the Capped Hose ModelThomas Bosman, Neil Olver. [doi]
- A Space-Optimal Grammar CompressionYoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto. [doi]
- Single-Sink Fractionally Subadditive Network DesignGuru Guruganesh, Jennifer Iglesias, R. Ravi 0001, Laura Sanità. [doi]
- The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse GraphsGraham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan. [doi]