| 2024 | 2-Approximation for Prize-Collecting Steiner Forest. Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi |
| 2024 | A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams. Mélanie Cambus, Fabian Kuhn, Etna Lindy, Shreyas Pai, Jara Uitto |
| 2024 | A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese |
| 2024 | A Distributed Palette Sparsification Theorem. Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin |
| 2024 | A Faster Combinatorial Algorithm for Maximum Bipartite Matching. Julia Chuzhoy, Sanjeev Khanna |
| 2024 | A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi |
| 2024 | A PTAS for Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang |
| 2024 | A Parameterized Family of Meta-Submodular Functions. Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd |
| 2024 | A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations. Moses Charikar, Michael Kapralov, Erik Waingarten |
| 2024 | A Tight Bound for Testing Partition Properties. Asaf Shapira, Henrique Stagni |
| 2024 | A Unifying Framework for Differentially Private Sums under Continual Observation. Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay |
| 2024 | A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions. Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford |
| 2024 | A polynomial-time OPT Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki |
| 2024 | AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. Omar Alrabiah, Venkatesan Guruswami, Ray Li |
| 2024 | Adaptive Out-Orientations with Applications. Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn |
| 2024 | Adjacency Sketches in Adversarial Environments. Moni Naor, Eugene Pekel |
| 2024 | Adversarial Low Degree Testing. Dor Minzer, Kai Zhe Zheng |
| 2024 | An Yu Chen, Zihan Tan |
| 2024 | An Improved Classical Singular Value Transformation for Quantum Machine Learning. Ainesh Bakshi, Ewin Tang |
| 2024 | An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. Timothy M. Chan, Pingan Cheng, Da Wei Zheng |
| 2024 | An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation. Christian Konrad, Kheeran K. Naidu |
| 2024 | Approximating Subset Sum Ratio faster than Subset Sum. Karl Bringmann |
| 2024 | Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs. Adam Brown, Aditi Laddha, Madhusudhan Reddy Pittu, Mohit Singh |
| 2024 | Arborescences, Colorful Forests, and Popularity. Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi |
| 2024 | Bandit Algorithms for Prophet Inequality and Pandora's Box. Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla, Yifan Wang |
| 2024 | Beyond the Quadratic Time Barrier for Network Unreliability. Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi |
| 2024 | Bin Packing under Random-Order: Breaking the Barrier of 3/2. Anish Hebbar, Arindam Khan, K. V. N. Sreenivas |
| 2024 | Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. Nairen Cao, Shang-En Huang, Hsin-Hao Su |
| 2024 | Breaking the Romain Cosson |
| 2024 | Breaking the 3/4 Barrier for Approximate Maximin Share. Hannaneh Akrami, Jugal Garg |
| 2024 | Breaking the Metric Voting Distortion Barrier. Moses Charikar, Kangning Wang, Prasanna Ramakrishnan, Hongxun Wu |
| 2024 | Cactus Representation of Minimum Cuts: Derandomize and Speed up. Zhongtian He, Shang-En Huang, Thatchaphol Saranurak |
| 2024 | Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. Zhongtian He, Shang-En Huang, Thatchaphol Saranurak |
| 2024 | Cliquewidth and Dimension. Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak |
| 2024 | Code Sparsification and its Applications. Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan |
| 2024 | Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems. Zongchen Chen |
| 2024 | Combinatorial Contracts Beyond Gross Substitutes. Paul Dütting, Michal Feldman, Yoav Gal Tzur |
| 2024 | Combinatorial Stationary Prophet Inequalities. Neel Patel, David Wajc |
| 2024 | Composition of nested embeddings with an application to outlier removal. Shuchi Chawla, Kristin Sheridan |
| 2024 | Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds. Tatiana Belova, Alexander S. Kulikov, Ivan Mihajlin, Olga Ratseeva, Grigory Reznikov, Denil Sharipov |
| 2024 | Computing the 5-Edge-Connected Components in Linear Time. Evangelos Kosinas |
| 2024 | Conflict Checkable and Decodable Codes and Their Applications. Benny Applebaum, Eliran Kachlon |
| 2024 | Controlling Tail Risk in Online Ski-Rental. Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii |
| 2024 | Convex Minimization with Integer Minima in Haotian Jiang, Yin Tat Lee, Zhao Song, Lichen Zhang |
| 2024 | Count on CFI graphs for #P-hardness. Radu Curticapean |
| 2024 | Delaunay Bifiltrations of Functions on Point Clouds. Ángel Javier Alonso, Michael Kerber, Tung Lam, Michael Lesnick |
| 2024 | Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time. David G. Harris |
| 2024 | Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms. Chandra Sekhar Mukherjee, Jiapeng Zhang |
| 2024 | Determinantal Sieving. Eduard Eiben, Tomohiro Koana, Magnus Wahlström |
| 2024 | Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi |
| 2024 | Deterministic Byzantine Agreement with Adaptive Fatima Elsheimy, Giorgos Tsimos, Charalampos Papamanthou |
| 2024 | Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. Monika Henzinger, Jason Li, Satish Rao, Di Wang |
| 2024 | Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem. Nick Fischer |
| 2024 | Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. Sébastien Collette, John Iacono |
| 2024 | Dynamic Algorithms for Matroid Submodular Maximization. Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh |
| 2024 | Dynamic Dictionary with Subconstant Wasted Bits per Key. Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |
| 2024 | Dynamic Dynamic Time Warping. Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg |
| 2024 | Dynamic algorithms for Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos |
| 2024 | Dynamically Maintaining the Persistent Homology of Time Series. Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost |
| 2024 | Edge-Coloring Algorithms for Bounded Degree Multigraphs. Abhishek Dhawan |
| 2024 | Edge-disjoint paths in expanders: online with removals. Nemanja Draganic, Rajko Nenadov |
| 2024 | Edge-weighted Online Stochastic Matching: Beating. Shuyi Yan |
| 2024 | Efficient Quantum State Synthesis with One Query. Gregory Rosenthal |
| 2024 | Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources. José Correa, Tobias Harks, Anja Schedel, José Verschae |
| 2024 | Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue |
| 2024 | Exact Community Recovery in the Geometric SBM. Julia Gaudio, Xiaochun Niu, Ermin Wei |
| 2024 | Exact Shortest Paths with Rational Weights on the Word RAM. Adam Karczmarz, Wojciech Nadara, Marek Sokolowski |
| 2024 | Factoring Pattern-Free Permutations into Separable ones. Edouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé |
| 2024 | Fair Price Discrimination. Siddhartha Banerjee, Kamesh Munagala, Yiheng Shen, Kangning Wang |
| 2024 | Fast 2-Approximate All-Pairs Shortest Paths. Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos |
| 2024 | Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues. Lap Chi Lau, Kam Chuen Tung, Robert Wang |
| 2024 | Fast Algorithms for Separable Linear Programs. Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye |
| 2024 | Fast Approximation Algorithms for Piercing Boxes by Points. Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos |
| 2024 | Fast Fourier transform via automorphism groups of rational function fields. Songsong Li, Chaoping Xing |
| 2024 | Fast Sampling of Zongchen Chen, Yuzhou Gu |
| 2024 | Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings. Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao |
| 2024 | Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
| 2024 | Faster Approximate All Pairs Shortest Paths. Barna Saha, Christopher Ye |
| 2024 | Faster Rectangular Matrix Multiplication by Combination Loss Analysis. François Le Gall |
| 2024 | Faster Sublinear-Time Edit Distance. Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka |
| 2024 | Faster exact and approximation algorithms for packing and covering matroids via push-relabel. Kent Quanrud |
| 2024 | Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. Greg Bodwin, Bernhard Haeupler, Merav Parter |
| 2024 | Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber |
| 2024 | Fully Dynamic Consistent Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon |
| 2024 | Fully Dynamic Matching: -Approximation in Polylog Update Time. Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani |
| 2024 | Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. Wenyu Jin, Xiaorui Sun, Mikkel Thorup |
| 2024 | Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary. Anastasiia Alokhina, Jan van den Brand |
| 2024 | Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. Yi-Jun Chang, Da Wei Zheng |
| 2024 | Fully dynamic approximation schemes on planar and apex-minor-free graphs. Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski |
| 2024 | Gap Amplification for Reconfiguration Problems. Naoto Ohsaka |
| 2024 | Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. Rajat De, Dominik Kempa |
| 2024 | Higher-Order Cheeger Inequality for Partitioning with Buffers. Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan |
| 2024 | How Many Neurons Does it Take to Approximate the Maximum? Itay Safran, Daniel Reichman, Paul Valiant |
| 2024 | Impossibilities for Obviously Strategy-Proof Mechanisms. Shiri Ron |
| 2024 | Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints. Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David B. Shmoys |
| 2024 | Improved Approximations for Ultrametric Violation Distance. Moses Charikar, Ruiquan Gao |
| 2024 | Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. Natan Rubin |
| 2024 | Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu |
| 2024 | Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2024 | Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. Tuukka Korhonen, Daniel Lokshtanov |
| 2024 | Integer Programming with GCD Constraints. Rémy Défossez, Christoph Haase, Alessio Mansutti, Guillermo A. Pérez |
| 2024 | Learning Hard-Constrained Models with One Sample. Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros |
| 2024 | Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory. Arun Jambulapati, Victor Reis, Kevin Tian |
| 2024 | Maintaining Matroid Intersections Online. Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar |
| 2024 | Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree. Rajesh Jayaram, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong |
| 2024 | Matrix Perturbation: Davis-Kahan in the Infinity Norm. Abhinav Bhardwaj, Van Vu |
| 2024 | Max Adam Karczmarz |
| 2024 | Meta-theorems for Parameterized Streaming Algorithms‡. Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2024 | Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio |
| 2024 | Minimization is Harder in the Prophet World. Vasilis Livanos, Ruta Mehta |
| 2024 | Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger |
| 2024 | Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan |
| 2024 | Nearly Optimal Approximate Dual-Failure Replacement Paths. Shiri Chechik, Tianyi Zhang |
| 2024 | Nearly Optimal Black Box Polynomial Root-finders. Victor Y. Pan |
| 2024 | New Approximation Bounds for Small-Set Vertex Expansion. Suprovat Ghoshal, Anand Louis |
| 2024 | New Bounds for Matrix Multiplication: from Alpha to Omega. Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou |
| 2024 | New Explicit Constant-Degree Lossless Expanders. Louis Golowich |
| 2024 | New SDP Roundings and Certifiable Approximation for Cubic Optimization. Jun-Ting Hsieh, Pravesh K. Kothari, Lucas Pesenti, Luca Trevisan |
| 2024 | Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon |
| 2024 | Odd Cycle Transversal on Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma |
| 2024 | On (1 + ɛ)-Approximate Flow Sparsifiers. Yu Chen, Zihan Tan |
| 2024 | On Approximability of Steiner Tree in Henry L. Fleischmann, Surya Teja Gavva, Karthik C. S. |
| 2024 | On Deterministically Approximating Total Variation Distance. Weiming Feng, Liqiang Liu, Tianren Liu |
| 2024 | On Dynamic Graph Algorithms with Predictions. Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak |
| 2024 | On Supermodular Contracts and Dense Subgraphs. Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, Aditya Prasad |
| 2024 | On the Extremal Functions of Acyclic Forbidden 0-1 Matrices. Seth Pettie, Gábor Tardos |
| 2024 | On the Hardness of PosSLP. Peter Bürgisser, Gorav Jindal |
| 2024 | On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation. Raphael A. Meyer, Cameron Musco, Christopher Musco |
| 2024 | On the hardness of finding balanced independent sets in random bipartite graphs. Will Perkins, Yuzhou Wang |
| 2024 | Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. Sujoy Bhore, Arnold Filtser, Csaba D. Tóth |
| 2024 | Online Robust Mean Estimation. Daniel M. Kane, Ilias Diakonikolas, Hanshen Xiao, Sihan Liu |
| 2024 | Optimal Bounds on Private Graph Approximation. Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou |
| 2024 | Optimal rates for ranking a permuted isotonic matrix in polynomial time. Emmanuel Pilliat, Alexandra Carpentier, Nicolas Verzelen |
| 2024 | Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings. Vishesh Jain, Huy Tuan Pham |
| 2024 | Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation. Dmitriy Kunisky |
| 2024 | Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma |
| 2024 | Oracle Efficient Online Multicalibration and Omniprediction. Sumegha Garg, Christopher Jung, Omer Reingold, Aaron Roth |
| 2024 | Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong |
| 2024 | Parameterized algorithms for block-structured integer programs with large entries. Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak |
| 2024 | Partial Coloring Complex, Vertex Decomposability and Tverberg's Theorem with Constraints. Sharareh Alipour, Amir Jafari, Mohammad Hassan Mazidi, Seyed Abolfazl Najafian |
| 2024 | Poly-logarithmic Competitiveness for the Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2024 | Positivity Certificates for Linear Recurrences. Alaa Ibrahim, Bruno Salvy |
| 2024 | Power of Posted-price Mechanisms for Prophet Inequalities. Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski |
| 2024 | Prior-Independent Auctions for Heterogeneous Bidders. Guru Guruganesh, Aranyak Mehta, Di Wang, Kangning Wang |
| 2024 | Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024 David P. Woodruff |
| 2024 | Quantum Worst-Case to Average-Case Reductions for All Linear Problems. Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, Sathyawageeswar Subramanian |
| 2024 | Quotient sparsification for submodular functions. Kent Quanrud |
| 2024 | Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal |
| 2024 | Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. Nathaniel Harms, Viktor Zamaraev |
| 2024 | Rationality-Robust Information Design: Bayesian Persuasion under Quantal Response. Yiding Feng, Chien-Ju Ho, Wei Tang |
| 2024 | Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem. Guanzhong Li, Lvzhou Li, Jingquan Luo |
| 2024 | Representative set statements for delta-matroids and the Mader delta-matroid. Magnus Wahlström |
| 2024 | Revenue Maximization for Buyers with Costly Participation. Yannai A. Gonczarowski, Nicole Immorlica, Yingkai Li, Brendan Lucier |
| 2024 | Robust 1-bit Compressed Sensing with Iterative Hard Thresholding. Namiko Matsumoto, Arya Mazumdar |
| 2024 | Robust Sparsification for Matroid Intersection with Applications. Chien-Chung Huang, François Sellier |
| 2024 | Santa Claus meets Makespan and Matroids: Algorithms and Reductions. Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter |
| 2024 | School Redistricting: Wiping Unfairness Off the Map. Ariel D. Procaccia, Isaac Robinson, Jamie Tucker-Foltz |
| 2024 | Set Covering with Our Eyes Wide Shut. Anupam Gupta, Gregory Kehne, Roie Levin |
| 2024 | Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential Privacy. David Rasmussen Lolck, Rasmus Pagh |
| 2024 | Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than |
| 2024 | Shortest Disjoint Paths on a Grid. Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski |
| 2024 | Simple Delegated Choice. Ali Khodabakhsh, Emmanouil Pountourakis, Samuel Taggart |
| 2024 | Simpler and Higher Lower Bounds for Shortcut Sets. Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu |
| 2024 | Single-Source Unsplittable Flows in Planar Graphs. Vera Traub, Laura Vargas Koch, Rico Zenklusen |
| 2024 | Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii |
| 2024 | Smoothed Complexity of SWAP in Local Graph Partitioning. Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis |
| 2024 | Solving Fréchet Distance Problems by Algebraic Geometric Methods. Siu-Wing Cheng, Haoqiang Huang |
| 2024 | Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai |
| 2024 | Sorting and Selection in Rounds with Adversarial Comparisons. Christopher Trevisan |
| 2024 | Sparse Regular Expression Matching. Philip Bille, Inge Li Gørtz |
| 2024 | Sparse induced subgraphs in Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2024 | Strongly Polynomial Frame Scaling to High Precision. Daniel Dadush, Akshay Ramachandran |
| 2024 | Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation. Max Gläser, Marc E. Pfetsch |
| 2024 | Sublinear Time Low-Rank Approximation of Toeplitz Matrices. Cameron Musco, Kshiteej Sheth |
| 2024 | The Cost of Parallelizing Boosting. Xin Lyu, Hongxun Wu, Junzhao Yang |
| 2024 | The Effect of Sparsity on Nick Fischer, Marvin Künnemann, Mirza Redzic |
| 2024 | The Grid-Minor Theorem Revisited. Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood |
| 2024 | The Hierarchy of Hereditary Sorting Operators. Vít Jelínek, Michal Opler, Jakub Pekárek |
| 2024 | The Identity Problem in nilpotent groups of bounded class. Ruiwen Dong |
| 2024 | The Minority Dynamics and the Power of Synchronicity. Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi |
| 2024 | The Sharp Power Law of Local Search on Expanders. Simina Brânzei, Davin Choo, Nicholas J. Recker |
| 2024 | The Time Complexity of Fully Sparse Matrix Multiplication. Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann |
| 2024 | Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar |
| 2024 | Tight approximability of MAX 2-SAT and relatives, under UGC. Joshua Brakensiek, Neng Huang, Uri Zwick |
| 2024 | Time-Space Lower Bounds for Bounded-Error Computation in the Random-Query Model. Itai Dinur |
| 2024 | Tree Containment Above Minimum Degree is FPT. Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2024 | Triangulations Admit Dominating Sets of Size 2 Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann |
| 2024 | Uniformity Testing over Hypergrids with Subcube Conditioning. Xi Chen, Cassandra Marcussen |
| 2024 | Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses. Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong |
| 2024 | Untangling Graphs on Surfaces. Éric Colin de Verdière, Vincent Despré, Loïc Dubois |
| 2024 | VC Set Systems in Minor-free (Di)Graphs and Applications. Hung Le, Christian Wulff-Nilsen |
| 2024 | Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
| 2024 | Viderman's algorithm for quantum LDPC codes. Anirudh Krishna, Inbal Livni Navon, Mary Wootters |