| Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen and Adi Shamir | Tight Bounds on Online Checkpointing Algorithms |
| Aditya Bhaskara, Samira Daruki and Suresh Venkatasubramanian | Sublinear Algorithms for MAXCUT and Correlation Clustering |
| Alexander Conway, Martin Farach-Colton and Philip Shilane | Optimal Hashing in External Memory |
| Alexandra Kolla, Ioannis Koutis, Vivek Madan and Ali Kemal Sinop | Spectrally Robust Graph Isomorphism |
| Amey Bhangale | NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors |
| Amir Abboud and Karl Bringmann | Tighter Connections Between Formula-SAT and Shaving Logs |
| Anders Aamand, Mathias Bæk Tejs Knudsen and Mikkel Thorup | Power of d Choices with Simple Tabulation |
| Anders Aamand, Niklas Hjuler, Jacob Holm and Eva Rotenberg | One-Way Trail Orientations |
| Andreas Schmid and Jens M. Schmidt | Computing Tutte Paths |
| Andrei Romashchenko and Marius Zimand | An operational characterization of mutual information in algorithmic information theory |
| Andrej Bogdanov | Small bias requires large formulas |
| Anna Adamaszek, Matthias Mnich and Katarzyna Paluch | New Approximation Algorithms for (1,2)-TSP |
| Anupam Gupta, Amit Kumar and Jason Li | Non-Preemptive Flow-Time Minimization via Rejections |
| Anupam Gupta, Ruta Mehta and Marco Molinaro | Maximizing Profit with Convex Costs in the Random-order Model |
| Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S. and Pasin Manurangsi | Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH |
| Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang and Lin Yang | Approximate Convex Hull of Data Streams |
| Bartlomiej Dudek and Pawel Gawrychowski | Edit Distance between Unrooted Trees in Cubic Time |
| Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubáček, Karel Král, Hagar Mosaad and Veronika Slívová | ARRIVAL: Next Stop in CLS |
| Bernhard Haeupler, Amirbehshad Shahrasbi and Ellen Vitercik | Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions |
| Bernhard Haeupler, Amirbehshad Shahrasbi and Madhu Sudan | Synchronization Strings: List Decoding for Insertions and Deletions |
| Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers and David Wajc | Fully-Dynamic Bin Packing with Little Repacking |
| Buddhima Gamlath, Sangxia Huang and Ola Svensson | Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering |
| Chinmay Nirkhe, Umesh Vazirani and Henry Yuen | Approximate low-weight check codes and circuit lower bounds for noisy ground states |
| Christoph Lenzen and Reut Levi | A Centralized Local Algorithm for the Sparse Spanning Graph Problem |
| Clemens Rösner and Melanie Schmidt | Privacy preserving clustering with constraints |
| Daniel Kane, Shachar Lovett and Shay Moran | Generalized comparison trees for point-location problems |
| Davide Bilò | New algorithms for Steiner tree reoptimization |
| Deeparnab Chakrabarty and Chaitanya Swamy | Interpolating between $k$-Median and $k$-Center: Approximation Algorithms for Ordered $k$-Median |
| Deeparnab Chakrabarty and Maryam Negahbani | Generalized Center Problems with Outliers |
| Eduard Eiben and Iyad Kanj | How to navigate through obstacles? |
| Elette Boyle, Abhishek Jain, Manoj Prabhakaran and Ching-Hua Yu | The Bottleneck Complexity of Secure Multiparty Computation |
| Eli Ben-Sasson, Iddo Bentov, Yinon Horesh and Michael Riabzev | Fast Reed-Solomon Interactive Oracle Proofs of Proximity |
| Fedor Fomin, Petr Golovach and Fahad Panolan | Parameterized Low-Rank Binary Matrix Approximation |
| Felix Reidl and Magnus Wahlström | Parameterized Algorithms for Zero Extension and Metric Labelling Problems |
| Friedrich Eisenbrand, Christoph Hunkenschröder and Kim-Manuel Klein | Faster Algorithms for Integer Programs with Block Structure |
| Hao Fu, Jian Li and Pan Xu | A PTAS for a Class of Stochastic Dynamic Programs |
| Hendrik Fichtenberger, Reut Levi, Yadu Vasudev and Maximilian Wötzel | A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error |
| Heng Guo and Mark Jerrum | Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling |
| Heng Guo and Mark Jerrum | A polynomial-time approximation algorithm for all-terminal network reliability |
| Holger Dell, Martin Grohe and Gaurav Rattan | Lovász Meets Weisfeiler and Leman |
| Ilias Diakonikolas, Themis Gouleakis, John Peebles and Eric Price | Sample-Optimal Identity Testing with High Probability |
| Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei and Nicole Wein | Finding Cliques in Social Networks: A New Distribution-Free Model |
| Jarosław Byrka, Piotr Skowron and Krzysztof Sornat | Proportional Approval Voting, Harmonic k-median, and Negative Association |
| Daniele Micciancio and Jessica Sorrell | Ring packing and amortized FHEW bootstrapping |
| Jiehua Chen, Danny Hermelin, Manuel Sorge and Harel Yedidsion | How hard is it to satisfy (almost) all roommates? |
| Jisu Jeong, Eun Jung Kim and Sang-Il Oum | Finding branch-decompositions of matroids, hypergraphs, and more |
| Julia Chuzhoy, David H.K. Kim and Rachit Nimavat | Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary |
| Koyo Hayashi | A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes |
| Krzysztof Onak, Baruch Schieber, Shay Solomon and Nicole Wein | Fully Dynamic MIS in Uniformly Sparse Graphs |
| L. Elisa Celis, Damian Straszak and Nisheeth K. Vishnoi | Ranking with Fairness Constraints |
| L. Sunil Chandran, Davis Issac and Yun Kuen Cheung | Spanning Tree Congestion and Computation of Generalized Gy\H{o}ri-Lov{\'{a}}sz Partition |
| Lech Duraj, Grzegorz Gutowski and Jakub Kozik | A note on two-colorability of nonuniform hypergraphs |
| Manoj Gupta and Aditi Singh | Generic Single Edge Fault Tolerant Exact Distance Oracle |
| Manuel Bodirsky and Marcello Mamino | A polynomial-time algorithm for median-closed semilinear constraints |
| Marco Carmosino, Russel Impagliazzo and Manuel Sabin | Fine-Grained Derandomization: From Problem-Centric Complexity to Resource-Centric Complexity |
| Martin Grohe, Daniel Neuen, Pascal Schweitzer and Daniel Wiebking | An improved isomorphism test for bounded-tree-width graphs |
| Martin Koutecky, Asaf Levin and Shmuel Onn | A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs |
| Michael Forbes, Sumanta Ghosh and Nitin Saxena | Towards blackbox identity testing of log-variate circuits |
| Michael Lampis | Finer Tight Bounds for Coloring on Clique-Width |
| Miriam Backens | A complete dichotomy for complex-valued Holant^c |
| Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein and David Wajc | Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms |
| Moses Charikar and Shay Solomon | Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier |
| Moses Charikar, Ofir Geri, Michael Kim and William Kuszmaul | On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings |
| Nil Mamano, David Eppstein, Michael Goodrich and Gill Barequet | Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms |
| Pankaj Agarwal, Haim Kaplan and Micha Sharir | Union of hypercubes and 3d Minkowski sums with random sizes |
| Pawel Gawrychowski and Adam Karczmarz | Improved Bounds for Shortest Paths in Dense Distance Graphs |
| Pawel Gawrychowski and Przemysław Uznański | Towards Unified Approximate Pattern Matching for Hamming and $L_1$ Distance |
| Pawel Gawrychowski, Gad Landau, Wing-Kin Sung and Oren Weimann | A Faster Construction of Greedy Consensus Tree |
| Pawel Gawrychowski, Liran Markin and Oren Weimann | A Faster FPTAS for #Knapsack |
| Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada and Kaja Wille | Gray codes and symmetric chains |
| Piotr Sankowski | NC Algorithms for Weighted Planar Perfect Matching and Related Problems |
| Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin and Luis Fernando Schultz Xavier Da Silveira | Geodesic Obstacle Representation of Graphs |
| Rafail Ostrovsky, Yuval Rabani and Arman Yousefi | Strictly Balancing Matrices in Polynomial Time Using Osborne’s Iteration |
| Anand Louis and Rakesh Venkat | Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery |
| Ran Duan and Hanlin Ren | Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time |
| Ran Duan, Kaifeng Lyu and Yuanhang Xie | Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs |
| Ran Duan, Yong Gu and Le Zhang | Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs |
| Rohit Gurjar, Thomas Thierauf and Nisheeth Vishnoi | Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces |
| Rotem Arnon-Friedman and Henry Yuen | Noise-tolerant testing of high entanglement of formation |
| Sariel Har-Peled, Piotr Indyk and Sepideh Mahabadi | Approximate Sparse Linear Regression |
| Shashwat Garg | Quasi-PTAS for Scheduling with Precedences using LP Hierarchies |
| Shay Golan, Tsvi Kopelowitz and Ely Porat | Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams |
| Siu-Wing Cheng and Yuchen Mao | Restricted Max-Min Fair Allocation |
| Sixue Liu | Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT |
| Stefan Walzer | Load Thresholds for Cuckoo Hashing with Overlapping Blocks |
| Sumit Ganguly and David Woodruff | High Probability Frequency Moment Sketches |
| Suryajith Chillara, Nutan Limaye and Srikanth Srinivasan | A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas |
| Tasuku Soma and Yuichi Yoshida | A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity |
| Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka and Jeffrey Shallit | Rollercoasters and Caterpillars |
| Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana and Marianne Thieffry | Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry |
| Timothy Johnson, Michael T. Goodrich, William E. Devanny, Juan Jose Besa Vial and David Eppstein | Optimally Sorting Evolving Data |
| Timothy M. Chan, Yakov Nekrich, Saladi Rahul and Konstantinos Tsakalidis | Orthogonal Point Location and Rectangle Stabbing Queries in 3-d |
| Tom Gur, Yang Liu and Ron Rothblum | An Exponential Separation Between MA and AM Proofs of Proximity |
| Uriel Feige, Boaz Patt-Shamir and Shai Vardi | On the Probe Complexity of Local Computation Algorithms |
| Vasileios Nakos, Xiaofei Shi, David P. Woodruff and Hongyang Zhang | Improved Algorithms for Adaptive Compressed Sensing |
| Vladimir Braverman, Emanuele Viola, David P. Woodruff and Lin Yang | Revisiting Frequency Moment Estimation in Random Order Streams |
| Zdenek Dvorak and Ken-Ichi Kawarabayashi | Additive non-approximability of chromatic number in proper minor-closed classes |
| Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu and Yuhao Zhang | Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals |
| Zhuan Khye Koh and Laura Sanità | Stabilizing Weighted Graphs |
| Achim Blumensath and Felix Wolf | Bisimulation Invariant Monadic-Second Order Logic in the Finite |
| Albert Atserias, Stephan Kreutzer and Marc Noy | On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface |
| Alejandro Aguirre, Gilles Barthe, Justin Hsu and Alexandra Silva | Almost Sure Productivity |
| Anaël Grandjean, Benjamin Hellouin de Menibus and Pascal Vanier | Aperiodic Points in $\mathbb{Z}^2$-subshifts |
| Antoine Amarilli and Charles Paperman | Constrained Topological Sorting |
| Dietrich Kuske and Nicole Schweikardt | Gaifman normal forms for counting extensions of first-order logic |
| Dirk Nowotka and Aleksi Saarela | An optimal bound on the solution sets of one-variable word equations and its consequences |
| Gaëtan Douéneau-Tabot | On the complexity of infinite advice strings |
| Géraud Sénizergues and Armin Weiss | The isomorphism problem for finite extensions of free groups is in PSPACE |
| Ines Klimann | To Infinity and Beyond |
| Jakub Gajarský, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Sebastian Siebertz and Szymon Toruńczyk | First-order interpretations of bounded expansion classes |
| Jérôme Leroux | Polynomial Vector Addition Systems With States |
| John Fearnley, Martin Gairing, Matthias Mnich and Rahul Savani | Reachability Switching Games |
| Laure Daviaud, Ranko Lazić, Marcin Jurdziński, Filip Mazowiecki, Guillermo Perez and James Worrell | When is Containment Decidable for Probabilistic Automata? |
| Lorenzo Clemente and Sławomir Lasota | Binary reachability of timed pushdown automata via quantifier elimination |
| María Emilia Descotte, Diego Figueira and Gabriele Puppis | Resynchronizing Classes of Word Relations |
| Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan and James Worrell | Costs and Rewards in Priced Timed Automata |
| Mathieu Hoyrup, Diego Nava Saucedo and Donald Stull | Semicomputable geometry |
| Michał Skrzypczak | Unambiguous languages exhaust the index hierarchy |
| Mikhail Raskin | A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton |
| Moses Ganardi, Danny Hucke and Markus Lohrey | Randomized sliding window algorithms for regular languages |
| Ramanujan M. S., Daniel Lokshtanov, Saket Saurabh and Meirav Zehavi | Reducing CMSO Model Checking to Highly Connected Graphs |
| Sam Staton, Dario Stein, Hongseok Yang, Nathanael Ackerman, Cameron Freer and Daniel Roy | The Beta-Bernoulli process and algebraic effects |
| Samir Datta, Anish Mukherjee, Nils Vortmeier and Thomas Zeume | Reachability and Distances under Multiple Changes |
| Sang-Ki Ko, Reino Niskanen and Igor Potapov | On the Identity Problem for the Special Linear Group and the Heisenberg Group |
| Sarah Winter | Uniformization Problems for Synchronizations of Automatic Relations on Words |
| Shaull Almagor, Dmitry Chistikov, Joel Ouaknine and James Worrell | O-Minimal Invariants for Linear Loops |
| Stefan Kiefer | On Computing the Total Variation Distance of Hidden Markov Models |
| Thomas Place and Marc Zeitoun | Separating without any ambiguity |
| Wojciech Czerwiński, Piotr Hofman and Georg Zetzsche | Unboundedness problems for languages of vector addition systems |
