| 2021 | 29th Annual European Symposium on Algorithms, ESA 2021, Lisbon, Portugal (Virtual Conference), September 6-8, 2021 Petra Mutzel, Rasmus Pagh, Grzegorz Herman |
| 2021 | A General Framework for Enumerating Equivalence Classes of Solutions. Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri |
| 2021 | A Simple Algorithm for Graph Reconstruction. Claire Mathieu, Hang Zhou |
| 2021 | A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. Maor Akav, Liam Roditty |
| 2021 | A User Friendly Power Tool for Deriving Online Learning Algorithms (Invited Talk). Aaron Roth |
| 2021 | Additive Sparsification of CSPs. Eden Pelleg, Stanislav Zivný |
| 2021 | All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. Timothy M. Chan |
| 2021 | An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh |
| 2021 | An Efficient Reduction of a Gammoid to a Partition Matroid. Marilena Leichter, Benjamin Moseley, Kirk Pruhs |
| 2021 | An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes. Éric Colin de Verdière, Thomas Magnard |
| 2021 | An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. Jean Cardinal, Justin Dallant, John Iacono |
| 2021 | Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. Zdenek Dvorák, Abhiruk Lahiri |
| 2021 | Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. Alexander Braun, Matthias Buttkus, Thomas Kesselheim |
| 2021 | Balanced Crown Decomposition for Connectivity Constraints. Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif |
| 2021 | Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems. Ojas Parekh, Kevin Thompson |
| 2021 | Bi-Objective Search with Bi-Directional A. Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby |
| 2021 | Bidirectional String Anchors: A New String Sampling Mechanism. Grigorios Loukides, Solon P. Pissis |
| 2021 | Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. Alejandro Flores-Velazco, David M. Mount |
| 2021 | Certified Approximation Algorithms for the Fermat Point and n-Ellipses. Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap |
| 2021 | Closing the Gap for Single Resource Constraint Scheduling. Klaus Jansen, Malin Rau |
| 2021 | Compression by Contracting Straight-Line Programs. Moses Ganardi |
| 2021 | Computing the 4-Edge-Connected Components of a Graph in Linear Time. Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2021 | Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing. Boris Klemz |
| 2021 | Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete. David Caballero, Timothy Gomez, Robert Schweller, Tim Wylie |
| 2021 | Data Structures Lower Bounds and Popular Conjectures. Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová |
| 2021 | Deep Multilevel Graph Partitioning. Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier |
| 2021 | Determining 4-Edge-Connected Components in Linear Time. Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski |
| 2021 | Differentially Private Algorithms for Graphs Under Continual Observation. Hendrik Fichtenberger, Monika Henzinger, Lara Ost |
| 2021 | Distant Representatives for Rectangles in the Plane. Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud |
| 2021 | Dynamic Colored Orthogonal Range Searching. Timothy M. Chan, Zhengcheng Huang |
| 2021 | Efficient Algorithms for Least Square Piecewise Polynomial Regression. Daniel Lokshtanov, Subhash Suri, Jie Xue |
| 2021 | Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel |
| 2021 | Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann |
| 2021 | Efficiently Computing Maximum Flows in Scale-Free Networks. Thomas Bläsius, Tobias Friedrich, Christopher Weyand |
| 2021 | Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. Marvin Williams, Peter Sanders, Roman Dementiev |
| 2021 | Evidence for Long-Tails in SLS Algorithms. Florian Wörz, Jan-Hendrik Lorenz |
| 2021 | Experimental Comparison of PC-Trees and PQ-Trees. Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter |
| 2021 | Extension of Additive Valuations to General Valuations on the Existence of EFX. Ryoga Mahara |
| 2021 | FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees. Tomás Martínez-Muñoz, Andreas Wiese |
| 2021 | Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. Dominik Kempa, Ben Langmead |
| 2021 | Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. Fabrizio Grandoni, Tobias Mömke, Andreas Wiese |
| 2021 | Faster 3-Coloring of Small-Diameter Graphs. Michal Debski, Marta Piecyk, Pawel Rzazewski |
| 2021 | Faster Algorithms for Longest Common Substring. Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski |
| 2021 | Faster Deterministic Modular Subset Sum. Krzysztof Potepa |
| 2021 | Feature Cross Search via Submodular Optimization. Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu |
| 2021 | Finding an Approximate Mode of a Kernel Density Estimate. Jasper C. H. Lee, Jerry Li, Christopher Musco, Jeff M. Phillips, Wai Ming Tai |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2021 | Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. Sepehr Assadi, Shay Solomon |
| 2021 | Generalized Max-Flows and Min-Cuts in Simplicial Complexes. William Maxwell, Amir Nayyeri |
| 2021 | Graph Connectivity and Single Element Recovery via Linear and OR Queries. Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna |
| 2021 | Hardness of Detecting Abelian and Additive Square Factors in Strings. Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2021 | Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild |
| 2021 | Improved Approximation Algorithms for Tverberg Partitions. Sariel Har-Peled, Timothy Zhou |
| 2021 | Incremental Edge Orientation in Forests. Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein |
| 2021 | Incremental SCC Maintenance in Sparse Graphs. Aaron Bernstein, Aditi Dudeja, Seth Pettie |
| 2021 | Isomorphism Testing Parameterized by Genus and Beyond. Daniel Neuen |
| 2021 | Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu |
| 2021 | Lyndon Words Accelerate Suffix Sorting. Nico Bertram, Jonas Ellert, Johannes Fischer |
| 2021 | Minimum Common String Partition: Exact Algorithms. Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov |
| 2021 | Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. Radu Curticapean, Holger Dell, Thore Husfeldt |
| 2021 | Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. Yaron Fairstein, Ariel Kulik, Hadas Shachnai |
| 2021 | Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. Zhiyang He, Jason Li, Magnus Wahlström |
| 2021 | Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2021 | Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk). Lukas Glomb, Benno Hoch, Frauke Liers, Florian Rösel |
| 2021 | On Approximate Compressions for Connected Minor-Hitting Sets. M. S. Ramanujan |
| 2021 | Online Euclidean Spanners. Sujoy Bhore, Csaba D. Tóth |
| 2021 | Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter |
| 2021 | Parallel Computation of Combinatorial Symmetries. Markus Anders, Pascal Schweitzer |
| 2021 | Parameterized Algorithms for Diverse Multistage Problems. Leon Kellerhals, Malte Renken, Philipp Zschoche |
| 2021 | QCSP on Reflexive Tournaments. Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný |
| 2021 | Quantum Sub-Gaussian Mean Estimator. Yassine Hamoudi |
| 2021 | Restricted Adaptivity in Stochastic Scheduling. Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt |
| 2021 | Restricted t-Matchings via Half-Edges. Katarzyna Paluch, Mateusz Wasylkiewicz |
| 2021 | Space Efficient Two-Dimensional Orthogonal Colored Range Counting. Younan Gao, Meng He |
| 2021 | Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning. Hu Ding |
| 2021 | Synchronized Planarity with Applications to Constrained Planarity Problems. Thomas Bläsius, Simon D. Fink, Ignaz Rutter |
| 2021 | Telescoping Filter: A Practical Adaptive Filter. David J. Lee, Samuel McCauley, Shikha Singh, Max Stein |
| 2021 | The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential. Nikhil Ayyadevara, Ashish Chiplunkar |
| 2021 | The Visibility Center of a Simple Polygon. Anna Lubiw, Anurag Murty Naredla |
| 2021 | The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Hendrik Schrezenmaier, Carlos Seara, Martin Suderland |
| 2021 | Worst-Case Efficient Dynamic Geometric Independent Set. Jean Cardinal, John Iacono, Grigorios Koumoutsos |
| 2021 | k-Center Clustering with Outliers in the Sliding-Window Model. Mark de Berg, Morteza Monemizadeh, Yu Zhong |
| 2021 | k-Distinct Branchings Admits a Polynomial Kernel. Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh |
| 2021 | ℓ Karthekeyan Chandrasekaran, Weihang Wang |