Abstract is missing.
- On the Optimality of Pseudo-polynomial Algorithms for Integer ProgrammingFedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh 0001. [doi]
- On the Tractability of Optimization Problems on H-GraphsFedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond. [doi]
- Online Facility Location with DeletionsMarek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski. [doi]
- An Exact Algorithm for the Steiner Forest ProblemDaniel R. Schmidt, Bernd Zey, François Margot. [doi]
- Light Spanners for High Dimensional Norms via Stochastic DecompositionsArnold Filtser, Ofer Neiman. [doi]
- Near-Optimal Distance Emulator for Planar GraphsHsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann. [doi]
- A Polynomial Kernel for Diamond-Free EditingYixin Cao 0001, Ashutosh Rai 0001, R. B. Sandeep, Junjie Ye. [doi]
- Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs FastMarkus Chimani, Tilo Wiedera. [doi]
- Truthful Prompt Scheduling for Minimizing Sum of Completion TimesAlon Eden, Michal Feldman, Amos Fiat, Tzahi Taub. [doi]
- Improved Routing on the Delaunay TriangulationNicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid. [doi]
- Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing RunsJ. Ian Munro, Sebastian Wild. [doi]
- Symmetry Exploitation for Online Machine Covering with Bounded MigrationWaldo Gálvez, José A. Soto, José Verschae. [doi]
- Generalized Coloring of PermutationsVít Jelínek, Michal Opler, Pavel Valtr. [doi]
- Solving Partition Problems Almost Always Requires Pushing Many Vertices AroundIyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen. [doi]
- Algorithms for Inverse Optimization ProblemsSara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy. [doi]
- Large Low-Diameter Graphs are Good ExpandersMichael Dinitz, Michael Schapira, Gal Shahaf. [doi]
- Improved Dynamic Graph ColoringShay Solomon, Nicole Wein. [doi]
- Average Whenever You Meet: Opportunistic Protocols for Community DetectionLuca Becchetti, Andrea E. F. Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan. [doi]
- A Framework for In-place Graph AlgorithmsSankardeep Chakraborty, Anish Mukherjee 0001, Venkatesh Raman 0001, Srinivasa Rao Satti. [doi]
- Practical Low-Dimensional Halfspace Range Space SamplingMichael Matheny, Jeff M. Phillips. [doi]
- Improved Time and Space Bounds for Dynamic Range ModeHicham El-Zein, Meng He 0001, J. Ian Munro, Bryce Sandlund. [doi]
- Weighted Model Counting on the GPU by Exploiting Small TreewidthJohannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser. [doi]
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and ExperimentsViatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche. [doi]
- Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball TradesCorrie Jacobien Carstens, Michael Hamann, Ulrich Meyer 0001, Manuel Penschuck, Hung Tran, Dorothea Wagner. [doi]
- On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic ProgressMarvin Künnemann. [doi]
- Dynamic Effective Resistances and Approximate Schur Complement on Separable GraphsGramoz Goranci, Monika Henzinger, Pan Peng. [doi]
- A New and Improved Algorithm for Online Bin PackingJános Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin. [doi]
- Equilibrium Computation in Atomic Splittable Routing GamesUmang Bhaskar, Phani Raj Lolakapuri. [doi]
- Fine-grained Lower Bounds on Cops and RobbersSebastian Brandt, Seth Pettie, Jara Uitto. [doi]
- Searching a Tree with Permanently Noisy AdviceLucas Boczkowski, Amos Korman, Yoav Rodeh. [doi]
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated MachinesGiorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram. [doi]
- On the Worst-Case Complexity of TimSortNicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau. [doi]
- Scalable Katz Ranking Computation in Large Static and Dynamic GraphsAlexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke. [doi]
- A Tree Structure For Dynamic Facility LocationGramoz Goranci, Monika Henzinger, Dariusz Leniowski. [doi]
- Planar Support for Non-piercing Regions and ApplicationsRajiv Raman, Saurabh Ray. [doi]
- Approximation Schemes for Geometric Coverage ProblemsSteven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase. [doi]
- On Learning Linear Functions from Subset and Its Applications in Quantum ComputingGábor Ivanyos, Anupam Prakash, Miklos Santha. [doi]
- Online Makespan Scheduling with Job Migration on Uniform MachinesMatthias Englert, David Mezlaf, Matthias Westermann. [doi]
- Parameterized Approximation Algorithms for Bidirected Steiner Network ProblemsRajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi. [doi]
- Self-Assembly of Any Shape with Constant Tile Types using High TemperatureCameron T. Chalk, Austin Luchsinger, Robert T. Schweller, Tim Wylie. [doi]
- Approximate Convex Intersection Detection with Applications to Width and Minkowski SumsSunil Arya, Guilherme Dias da Fonseca, David M. Mount. [doi]
- Strong Collapse for PersistenceJean-Daniel Boissonnat, Siddharth Pritam, Divyansh Pareek. [doi]
- On a Problem of DanzerNabil H. Mustafa, Saurabh Ray. [doi]
- Decremental SPQR-trees for Planar GraphsJacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg. [doi]
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway DimensionAmariah Becker, Philip N. Klein, David Saulpic. [doi]
- The Stochastic Score Classification ProblemDimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik. [doi]
- Disconnected Cuts in Claw-free GraphsBarnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen. [doi]
- Computing the Chromatic Number Using Graph Decompositions via Matrix RankBart M. P. Jansen, Jesper Nederlof. [doi]
- Dynamic Trees with Almost-Optimal Access CostMordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich. [doi]
- Efficient and Adaptive Parameterized Algorithms on Modular DecompositionsStefan Kratsch, Florian Nelles. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Amortized Analysis of Asynchronous Price DynamicsYun Kuen Cheung, Richard Cole 0001. [doi]
- Improved Space-Time Tradeoffs for kSUMIsaac Goldstein, Moshe Lewenstein, Ely Porat. [doi]
- Finding Stable Matchings That Are Robust to Errors in the InputTung Mai, Vijay V. Vazirani. [doi]
- Edit Distance with Block OperationsMichal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka. [doi]
- Soft Subdivision Motion Planning for Complex Planar RobotsBo Zhou, Yi-Jen Chiang, Chee Yap. [doi]
- Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar GraphsMichal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese. [doi]
- Practical Access to Dynamic Programming on Tree DecompositionsMax Bannach, Sebastian Berndt. [doi]
- Polynomial Kernels for Hitting Forbidden Minors under Structural ParameterizationsBart M. P. Jansen, Astrid Pieterse. [doi]
- A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling MetricsT.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang. [doi]
- Space-Optimal Quasi-Gray Codes with Logarithmic Read ComplexityDiptarka Chakraborty, Debarati Das 0001, Michal Koucký, Nitin Saurabh. [doi]
- Buffered Count-Min Sketch on SSD: Theory and ExperimentsMayank Goswami, Dzejla Medjedovic, Emina Mekic, Prashant Pandey. [doi]
- Optimal Online Contention Resolution Schemes via Ex-Ante Prophet InequalitiesEuiwoong Lee, Sahil Singla. [doi]
- Round-Hashing for Data Storage: Distributed Servers and External-Memory TablesRoberto Grossi, Luca Versari. [doi]
- Quantum Algorithms for Connectivity and Related ProblemsMichael Jarret, Stacey Jeffery, Shelby Kimmel, Alvaro Piedrafita. [doi]
- On the Complexity of the (Approximate) Nearest Colored Node ProblemMaximilian Probst. [doi]
- On the Decision Tree Complexity of String MatchingXiaoyu He, Neng Huang, Xiaoming Sun. [doi]
- Algorithmic Building Blocks for Asymmetric MemoriesYan Gu 0001, Yihan Sun 0001, Guy E. Blelloch. [doi]
- Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search TreesDani Dorfman, Haim Kaplan, László Kozma 0002, Seth Pettie, Uri Zwick. [doi]
- Two-Dimensional Maximal RepetitionsAmihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol. [doi]
- String Attractors: Verification and OptimizationDominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg. [doi]
- FPT Algorithms for Embedding into Low Complexity Graphic MetricsArijit Ghosh, Sudeshna Kolay, Gopinath Mishra. [doi]
- A QPTAS for Gapless MECShilpa Garg, Tobias Mömke. [doi]
- On Geometric Prototype and ApplicationsHu Ding, Manni Liu. [doi]