| 2022 | (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen |
| 2022 | 30th Annual European Symposium on Algorithms, ESA 2022, Berlin/Potsdam, Germany, September 5-9, 2022 Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman |
| 2022 | A Local Search Algorithm for Large Maximum Weight Independent Set Problems. Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen |
| 2022 | A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis |
| 2022 | A Simpler QPTAS for Scheduling Jobs with Precedence Constraints. Syamantak Das, Andreas Wiese |
| 2022 | A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension. Jendrik Brachter, Pascal Schweitzer |
| 2022 | A Unified Framework for Hopsets. Ofer Neiman, Idan Shabat |
| 2022 | Abstract Morphing Using the Hausdorff Distance and Voronoi Diagrams. Lex de Kogel, Marc J. van Kreveld, Jordi L. Vermeulen |
| 2022 | Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings. Bernhard Haepler, D. Ellis Hershkowitz, Goran Zuzic |
| 2022 | Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi |
| 2022 | An Empirical Evaluation of k-Means Coresets. Chris Schwiegelshohn, Omar Ali Sheikh-Omar |
| 2022 | An Improved Algorithm for Finding the Shortest Synchronizing Words. Marek Szykula, Adam Zyzik |
| 2022 | An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions. Florian Barth, Stefan Funke, Claudius Proissl |
| 2022 | Approximate Circular Pattern Matching. Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2022 | Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. Zoe Xi, William Kuszmaul |
| 2022 | Approximation Algorithms for Continuous Clustering and Facility Location Problems. Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar |
| 2022 | Approximation Algorithms for Round-UFP and Round-SAP. Debajyoti Kar, Arindam Khan, Andreas Wiese |
| 2022 | Average Sensitivity of the Knapsack Problem. Soh Kumabe, Yuichi Yoshida |
| 2022 | Bounding and Computing Obstacle Numbers of Graphs. Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff |
| 2022 | Cardinality Estimation Using Gumbel Distribution. Aleksander Lukasiewicz, Przemyslaw Uznanski |
| 2022 | Chromatic k-Nearest Neighbor Queries. Thijs van der Horst, Maarten Löffler, Frank Staals |
| 2022 | Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha |
| 2022 | Combining Predicted and Live Traffic with Time-Dependent A* Potentials. Nils Werner, Tim Zeitz |
| 2022 | Computing NP-Hard Repetitiveness Measures via MAX-SAT. Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto |
| 2022 | Computing Smallest Convex Intersecting Polygons. Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos |
| 2022 | Computing Treedepth in Polynomial Space and Linear FPT Time. Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz |
| 2022 | Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2022 | Conditional Lower Bounds for Dynamic Geometric Measure Problems. Justin Dallant, John Iacono |
| 2022 | Correlated Stochastic Knapsack with a Submodular Objective. Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik |
| 2022 | Counting Simplices in Hypergraph Streams. Amit Chakrabarti, Themistoklis Haris |
| 2022 | Data Structures for Node Connectivity Queries. Zeev Nutov |
| 2022 | Determinants from Homomorphisms. Radu Curticapean |
| 2022 | Distinct Elements in Streams: An Algorithm for the (Text) Book. Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel |
| 2022 | Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. Bartlomiej Bosek, Anna Zych-Pawlewicz |
| 2022 | Efficient Fréchet Distance Queries for Segments. Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals |
| 2022 | Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt |
| 2022 | Embedding Phylogenetic Trees in Networks of Low Treewidth. Leo van Iersel, Mark Jones, Mathias Weller |
| 2022 | Enumerating Minimal Connected Dominating Sets. Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann |
| 2022 | Fast Computation of Zigzag Persistence. Tamal K. Dey, Tao Hou |
| 2022 | Fast RSK Correspondence by Doubling Search. Alexander Tiskin |
| 2022 | Faster Algorithm for Unique (k, 2)-CSP. Or Zamir |
| 2022 | Faster Approximate Covering of Subcurves Under the Fréchet Distance. Frederik Brüning, Jacobus Conradi, Anne Driemel |
| 2022 | Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma |
| 2022 | Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product. Younan Gao, Meng He |
| 2022 | Finding a Cluster in Incomplete Data. Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2022 | Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. Monika Henzinger, Ami Paz, A. R. Sricharan |
| 2022 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2022 | Galactic Token Sliding. Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad |
| 2022 | Hardness of Token Swapping on Trees. Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein |
| 2022 | Hedonic Games and Treewidth Revisited. Tesshu Hanaka, Michael Lampis |
| 2022 | Improved Bounds for Online Balanced Graph Re-Partitioning. Rajmohan Rajaraman, Omer Wasim |
| 2022 | Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters. Zachary Friggstad, Mahya Jamshidian |
| 2022 | Improved Search of Relevant Points for Nearest-Neighbor Classification. Alejandro Flores-Velazco |
| 2022 | Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold. Stefan Walzer |
| 2022 | Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection. Esther Ezra, Micha Sharir |
| 2022 | Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter |
| 2022 | List Colouring Trees in Logarithmic Space. Hans L. Bodlaender, Carla Groenland, Hugo Jacob |
| 2022 | Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds. Clément Maria, Owen Rouillé |
| 2022 | Longest Cycle Above Erdős-Gallai Bound. Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | Lyndon Arrays Simplified. Jonas Ellert |
| 2022 | Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case. Kobi Bodek, Moran Feldman |
| 2022 | Maximum Weight b-Matchings in Random-Order Streams. Chien-Chung Huang, François Sellier |
| 2022 | Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. Jiehua Chen, Sanjukta Roy |
| 2022 | Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem. Dipan Dey, Manoj Gupta |
| 2022 | Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries. Raghavendra Addanki, Andrew McGregor, Cameron Musco |
| 2022 | O(1) Steiner Point Removal in Series-Parallel Graphs. D. Ellis Hershkowitz, Jason Li |
| 2022 | On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla |
| 2022 | On the External Validity of Average-Case Analyses of Graph Algorithms. Thomas Bläsius, Philipp Fischbeck |
| 2022 | Online Metric Allocation and Time-Varying Regularization. Nikhil Bansal, Christian Coester |
| 2022 | Online Spanners in Metric Spaces. Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth |
| 2022 | Optimizing Safe Flow Decompositions in DAGs. Shahbaz Khan, Alexandru I. Tomescu |
| 2022 | ParGeo: A Library for Parallel Computational Geometry. Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun |
| 2022 | Polynomial Kernel for Immersion Hitting in Tournaments. Lukasz Bozyk, Michal Pilipczuk |
| 2022 | Resource Sharing Revisited: Local Weak Duality and Optimal Convergence. Daniel Blankenburg |
| 2022 | SAT Backdoors: Depth Beats Size. Jan Dreier, Sebastian Ordyniak, Stefan Szeider |
| 2022 | Scheduling Kernels via Configuration LP. Dusan Knop, Martin Koutecký |
| 2022 | Search-Space Reduction via Essential Vertices. Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon |
| 2022 | Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert |
| 2022 | Simple Streaming Algorithms for Edge Coloring. Mohammad Ansari, Mohammad Saneian, Hamid Zarrabi-Zadeh |
| 2022 | Simple Worst-Case Optimal Adaptive Prefix-Free Coding. Travis Gagie |
| 2022 | Spanner Approximations in Practice. Markus Chimani, Finn Stutzenstein |
| 2022 | Sparse Temporal Spanners with Low Stretch. Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi |
| 2022 | Submodular Maximization Subject to Matroid Intersection on the Fly. Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2022 | TSP in a Simple Polygon. Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous |
| 2022 | Taming Graphs with No Large Creatures and Skinny Ladders. Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza |
| 2022 | Techniques for Generalized Colorful k-Center Problems. Georg Anegg, Laura Vargas Koch, Rico Zenklusen |
| 2022 | The Pareto Cover Problem. Bento Natura, Meike Neuwohner, Stefan Weltge |
| 2022 | The Price of Hierarchical Clustering. Anna Arutyunova, Heiko Röglin |
| 2022 | There and Back Again: On Applying Data Reduction Rules by Undoing Others. Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier |
| 2022 | Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. Susanne Albers, Sebastian Schubert |
| 2022 | Turbocharging Heuristics for Weak Coloring Numbers. Alexander Dobler, Manuel Sorge, Anaïs Villedieu |
| 2022 | Vertex Sparsifiers for Hyperedge Connectivity. Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang |
| 2022 | When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender |
| 2022 | Width Helps and Hinders Splitting Flows. Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams |