| 2021 | (Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems. Timothy M. Chan |
| 2021 | 2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani |
| 2021 | A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri |
| 2021 | A Deterministic Parallel APSP Algorithm and its Applications. Adam Karczmarz, Piotr Sankowski |
| 2021 | A Fast Minimum Degree Algorithm and Matching Lower Bound. Robert Cummings, Matthew Fahrbach, Animesh Fatehpuria |
| 2021 | A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki |
| 2021 | A Fine-Grained Perspective on Approximating Subset Sum and Partition. Karl Bringmann, Vasileios Nakos |
| 2021 | A Local Search Framework for Experimental Design. Lap Chi Lau, Hong Zhou |
| 2021 | A Lower Bound for Dynamic Fractional Cascading. Peyman Afshani |
| 2021 | A Polynomial Time Algorithm for the William Lochet |
| 2021 | A Refined Laser Method and Faster Matrix Multiplication. Josh Alman, Virginia Vassilevska Williams |
| 2021 | A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. Marcel de Sena Dall'Agnol, Tom Gur, Oded Lachish |
| 2021 | A Time-Optimal Randomized Parallel Algorithm for MIS. Mohsen Ghaffari, Bernhard Haeupler |
| 2021 | A Topological Characterization of Modulo- Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis |
| 2021 | A tight condition for triangle factors in pseudorandom graphs. Patrick Morris |
| 2021 | Algorithms for Persuasion with Limited Communication. Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky |
| 2021 | Algorithms for weighted independent transversals and strong colouring. Alessandra Graf, David G. Harris, Penny Haxell |
| 2021 | All-Pairs LCA in DAGs: Breaking through the Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski |
| 2021 | An Nathaniel Lahn, Sharath Raghvendra |
| 2021 | An Efficient Yang Cai, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao |
| 2021 | An FPTAS for the square lattice six-vertex and eight-vertex models at low temperatures. Jin-Yi Cai, Tianyu Liu |
| 2021 | An improved procedure for colouring graphs of bounded local density. Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang |
| 2021 | Analytic quantum weak coin flipping protocols with arbitrarily small bias. Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou |
| 2021 | Approximate Distance Oracles Subject to Multiple Vertex Failures. Ran Duan, Yong Gu, Hanlin Ren |
| 2021 | Approximate Evaluation of First-Order Counting Queries. Jan Dreier, Peter Rossmanith |
| 2021 | Approximate Nearest Neighbors Beyond Space Partitions. Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2021 | Approximating ( Maike Buchin, Anne Driemel, Dennis Rohde |
| 2021 | Approximating Pathwidth for Graphs of Small Treewidth. Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak |
| 2021 | Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. Zhengfeng Ji, Zhihan Jin, Pinyan Lu |
| 2021 | Approximating the Median under the Ulam Metric. Diptarka Chakraborty, Debarati Das, Robert Krauthgamer |
| 2021 | Approximation Algorithms and Hardness for Strong Unique Games. Suprovat Ghoshal, Anand Louis |
| 2021 | Asymptotic dimension of minor-closed families and beyond. Chun-Hung Liu |
| 2021 | Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. Michael T. Goodrich, Riko Jacob, Nodari Sitchinava |
| 2021 | Average Sensitivity of Graph Algorithms. Nithin Varma, Yuichi Yoshida |
| 2021 | Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions. Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins |
| 2021 | Beating the probabilistic lower bound on perfect hashing. Chaoping Xing, Chen Yuan |
| 2021 | Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. Peter Robinson |
| 2021 | Beyond Submodular Maximization via One-Sided Smoothness. Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd |
| 2021 | Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel |
| 2021 | Branch-and-Bound Solves Random Binary IPs in Polytime. Santanu S. Dey, Yatharth Dubey, Marco Molinaro |
| 2021 | Coloring and Maximum Weight Independent Set of Rectangles. Parinya Chalermsook, Bartosz Walczak |
| 2021 | Competitive Allocation of a Mixed Manna. Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta |
| 2021 | Competitive Data-Structure Dynamization. Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi |
| 2021 | Concentration bounds for almost Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu |
| 2021 | Connecting Robust Shuffle Privacy and Pan-Privacy. Victor Balcer, Albert Cheu, Matthew Joseph, Jieming Mao |
| 2021 | Consistent k-Clustering for General Metrics. Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson |
| 2021 | Constrained-Order Prophet Inequalities. Makis Arsenis, Odysseas Drosis, Robert Kleinberg |
| 2021 | Coresets for Clustering in Excluded-minor Graphs and Beyond. Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu |
| 2021 | Counting Homomorphisms to Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný |
| 2021 | Counting Small Permutation Patterns. Chaim Even-Zohar, Calvin Leng |
| 2021 | Decomposing the Complement of the Union of Cubes in Three Dimensions. Pankaj K. Agarwal, Micha Sharir, Alex Steiger |
| 2021 | Deep Weisfeiler Leman. Martin Grohe, Pascal Schweitzer, Daniel Wiebking |
| 2021 | Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. Julia Chuzhoy, Thatchaphol Saranurak |
| 2021 | Deterministic Replacement Path Covering. Karthik C. S., Merav Parter |
| 2021 | Dimension-Preserving Reductions Between SVP and CVP in Different Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz |
| 2021 | Directed Shortest Paths via Approximate Cost Balancing. James B. Orlin, László A. Végh |
| 2021 | Distributed Metropolis Sampler with Optimal Parallelism. Weiming Feng, Thomas P. Hayes, Yitong Yin |
| 2021 | Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model. Krzysztof Nowicki, Krzysztof Onak |
| 2021 | Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. Sebastian Forster, Gramoz Goranci, Monika Henzinger |
| 2021 | Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu |
| 2021 | EPTAS for Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov |
| 2021 | Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2021 | Efficient Document Exchange and Error Correcting Codes with Asymmetric Information. Kuan Cheng, Xin Li |
| 2021 | Efficient Linear and Affine Codes for Correcting Insertions/Deletions. Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li |
| 2021 | Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz |
| 2021 | Estimating the Nash Social Welfare for coverage and other submodular valuations. Wenzheng Li, Jan Vondrák |
| 2021 | Explicit two-deletion codes with redundancy matching the existential bound. Venkatesan Guruswami, Johan Håstad |
| 2021 | FPT-approximation for FPT Problems. Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2021 | Fast Convergence of Fictitious Play for Diagonal Payoff Matrices. Jacob D. Abernethy, Kevin A. Lai, Andre Wibisono |
| 2021 | Fast Low-Space Algorithms for Subset Sum. Ce Jin, Nikhil Vyas, Ryan Williams |
| 2021 | Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz |
| 2021 | Front Matter. |
| 2021 | Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model. Arnold Filtser, Michael Kapralov, Navid Nouri |
| 2021 | Hamiltonicity of random subgraphs of the hypercube. Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus |
| 2021 | Hardness of Approximation for Orienteering with Multiple Time Windows. Naveen Garg, Sanjeev Khanna, Amit Kumar |
| 2021 | How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga |
| 2021 | How to Morph Graphs on the Torus. Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa |
| 2021 | Improved Algorithms for Population Recovery from the Deletion Channel. Shyam Narayanan |
| 2021 | Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting. Itai Dinur |
| 2021 | Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali |
| 2021 | Improved Deterministic Network Decomposition. Mohsen Ghaffari, Christoph Grunau, Václav Rozhon |
| 2021 | Improved Sublinear Time Algorithm for Longest Increasing Subsequence. Michael Mitzenmacher, Saeed Seddighin |
| 2021 | Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. Sepehr Assadi, Thomas Kesselheim, Sahil Singla |
| 2021 | Improving the dilation of a metric graph by adding edges. Joachim Gudmundsson, Sampson Wong |
| 2021 | In which matching markets does the short side enjoy an advantage? Yash Kanoria, Seungki Min, Pengyu Qian |
| 2021 | Incremental Single Source Shortest Paths in Sparse Digraphs. Shiri Chechik, Tianyi Zhang |
| 2021 | Induced subgraphs of bounded treewidth and the container method. Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour |
| 2021 | Infinite-Duration All-Pay Bidding Games. Guy Avni, Ismaël Jecker, Dorde Zikelic |
| 2021 | Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts |
| 2021 | List-Decodable Subspace Recovery: Dimension Independent Error in Polynomial Time. Ainesh Bakshi, Pravesh K. Kothari |
| 2021 | Local Statistics, Semidefinite Programming, and Community Detection. Jess Banks, Sidhanth Mohanty, Prasad Raghavendra |
| 2021 | Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. Karthekeyan Chandrasekaran, Chandra Chekuri |
| 2021 | Minimizing Convex Functions with Integral Minimizers. Haotian Jiang |
| 2021 | Minimum-cost integer circulations in given homology classes. Sarah Morell, Ina Seidel, Stefan Weltge |
| 2021 | Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. Suman K. Bera, Noujan Pashanasangi, C. Seshadhri |
| 2021 | Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices. Timothy M. Chan |
| 2021 | Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. Shuichi Hirahara, Nobutaka Shimizu |
| 2021 | New Data Structures for Orthogonal Range Reporting and Range Minima Queries. Yakov Nekrich |
| 2021 | New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification. Jin-Yi Cai, Zhiguo Fu, Shuai Shao |
| 2021 | New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein |
| 2021 | Non-Excludable Dynamic Mechanism Design. Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo |
| 2021 | Non-linear Hamilton cycles in linear quasi-random hypergraphs. Jie Han, Xichao Shu, Guanghui Wang |
| 2021 | Non-uniform Geometric Set Cover and Scheduling on Multiple Machines. Nikhil Bansal, Jatin Batra |
| 2021 | On Approximability of Clustering Problems Without Candidate Centers. Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
| 2021 | On Efficient Distance Approximation for Graph Properties. Nimrod Fiat, Dana Ron |
| 2021 | On Indexing and Compressing Finite Automata. Nicola Cotumaccio, Nicola Prezza |
| 2021 | On Locating Paths in Compressed Tries. Nicola Prezza |
| 2021 | On Multi-Dimensional Gains from Trade Maximization. Yang Cai, Kira Goldner, Steven Ma, Mingfei Zhao |
| 2021 | On Near-Linear-Time Algorithms for Dense Subset Sum. Karl Bringmann, Philip Wellnitz |
| 2021 | On Testability of First-Order Properties in Bounded-Degree Graphs. Isolde Adler, Noleen Köhler, Pan Peng |
| 2021 | On Tolerant Distribution Testing in the Conditional Sampling Model. Shyam Narayanan |
| 2021 | On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin |
| 2021 | On a combinatorial generation problem of Knuth. Arturo Merino, Ondrej Micka, Torsten Mütze |
| 2021 | On the Competitive Analysis and High Accuracy Optimality of Profile Maximum Likelihood. Yanjun Han, Kirankumar Shiragur |
| 2021 | On the Mysteries of MAX NAE-SAT. Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2021 | On the Orbit Closure Containment Problem and Slice Rank of Tensors. Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer |
| 2021 | Online Combinatorial Auctions. Yuan Deng, Debmalya Panigrahi, Hanrui Zhang |
| 2021 | Online Discrepancy Minimization for Stochastic Arrivals. Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha |
| 2021 | Online Edge Coloring Algorithms via the Nibble Method. Sayan Bhattacharya, Fabrizio Grandoni, David Wajc |
| 2021 | Online Generalized Network Design Under (Dis)Economies of Scale. Viswanath Nagarajan, Lily Wang |
| 2021 | Online Multiserver Convex Chasing and Optimization. Sébastien Bubeck, Yuval Rabani, Mark Sellke |
| 2021 | Optimal Arvind V. Mahankali, David P. Woodruff |
| 2021 | Optimal Contextual Pricing and Extensions. Allen Liu, Renato Paes Leme, Jon Schneider |
| 2021 | Optimal Discretization is Fixed-parameter Tractable. Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge |
| 2021 | Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness. Dana Ron, Asaf Rosin |
| 2021 | Optimal Girth Approximation for Dense Directed Graphs. Shiri Chechik, Gur Lifshitz |
| 2021 | Optimal Inapproximability with Universal Factor Graphs. Per Austrin, Jonah Brown-Cohen, Johan Håstad |
| 2021 | Optimal Oblivious Priority Queues. Zahra Jafargholi, Kasper Green Larsen, Mark Simkin |
| 2021 | Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. Greg Bodwin, Michael Dinitz, Caleb Robelle |
| 2021 | PTAS for Minimum Cost Multi-covering with Disks. Ziyun Huang, Qilong Feng, Jianxin Wang, Jinhui Xu |
| 2021 | Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data Structures. Stefan Walzer |
| 2021 | Planar Distance Oracles with Better Time-Space Tradeoffs. Yaowei Long, Seth Pettie |
| 2021 | Planar Negative Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2021 | Planar Reachability Under Single Vertex or Edge Failures. Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis |
| 2021 | Polyhedral Value Iteration for Discounted Games and Energy Games. Alexander Kozachinskiy |
| 2021 | Polynomial-time trace reconstruction in the smoothed complexity model. Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha |
| 2021 | Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 Dániel Marx |
| 2021 | Quantum algorithms for graph problems with cut queries. Troy Lee, Miklos Santha, Shengyu Zhang |
| 2021 | Query strategies for priced information, revisited. Guy Blanc, Jane Lange, Li-Yang Tan |
| 2021 | Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning. Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten |
| 2021 | Randomized Cup Game Algorithms Against Strong Adversaries. Michael A. Bender, William Kuszmaul |
| 2021 | Rankwidth meets stability. Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2021 | Rapid Mixing for Colorings via Spectral Independence. Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2021 | Rapid Mixing from Spectral Independence beyond the Boolean Domain. Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang |
| 2021 | Robust Algorithms for Online Convex Problems via Primal-Dual. Marco Molinaro |
| 2021 | Robust Learning of Mixtures of Gaussians. Daniel M. Kane |
| 2021 | Rolling backwards can move you forward: on embedding problems in sparse expanders. Nemanja Draganic, Michael Krivelevich, Rajko Nenadov |
| 2021 | Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines. Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang |
| 2021 | Self-Stabilizing Clock Synchronization with 1-bit Messages. Paul Bastide, George Giakkoupis, Hayk Saribekyan |
| 2021 | Shorter Labels for Routing in Trees. Pawel Gawrychowski, Wojciech Janczewski, Jakub Lopuszanski |
| 2021 | Shortest Paths Among Obstacles in the Plane Revisited. Haitao Wang |
| 2021 | SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation. David Steurer, Stefan Tiegel |
| 2021 | Solving Sparse Linear Systems Faster than Matrix Multiplication. Richard Peng, Santosh S. Vempala |
| 2021 | Solving hard cut problems via flow-augmentation. Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström |
| 2021 | Sorting Short Keys in Circuits of Size Gilad Asharov, Wei-Kai Lin, Elaine Shi |
| 2021 | Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival Model. Michael Kapralov |
| 2021 | Spectral Clustering Oracles in Sublinear Time. Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler |
| 2021 | Spectral Sparsification of Metrics and Kernels. Kent Quanrud |
| 2021 | Static and Streaming Data Structures for Fréchet Distance Queries. Arnold Filtser, Omrit Filtser |
| 2021 | Streaming Submodular Matching Meets the Primal-Dual Method. Roie Levin, David Wajc |
| 2021 | Strong Connectivity Augmentation is FPT. Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh |
| 2021 | Strongly refuting all semi-random Boolean CSPs. Jackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari |
| 2021 | The Connectivity Threshold for Dense Graphs. Anupam Gupta, Euiwoong Lee, Jason Li |
| 2021 | The Demand Query Model for Bipartite Matching. Noam Nisan |
| 2021 | The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan |
| 2021 | The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. Andreas Björklund, Petteri Kaski |
| 2021 | The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable. Matthieu Rosenfeld |
| 2021 | The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger |
| 2021 | The Min-Cost Matching with Concave Delays Problem. Yossi Azar, Runtian Ren, Danny Vainstein |
| 2021 | The Secretary Problem with Independent Sampling. José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis |
| 2021 | Tight Bounds for Online Graph Partitioning. Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid |
| 2021 | Tight Bounds for Parallel Paging and Green Paging. Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato |
| 2021 | Tight Distributed Listing of Cliques. Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf |
| 2021 | Tight Distributed Sketching Lower Bound for Connectivity. Huacheng Yu |
| 2021 | Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms. Shi Li |
| 2021 | Treewidth-Pliability and PTAS for Max-CSPs. Miguel Romero, Marcin Wrochna, Stanislav Zivný |
| 2021 | Twin-width II: small classes. Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant |
| 2021 | Two-stage Stochastic Matching with Application to Ride Hailing. Yiding Feng, Rad Niazadeh, Amin Saberi |
| 2021 | Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers. Arun Jambulapati, Aaron Sidford |
| 2021 | Uncertainty about Uncertainty: Optimal Adaptive Algorithms for Estimating Mixtures of Unknown Coins. Jasper C. H. Lee, Paul Valiant |
| 2021 | Unlinking, splitting, and some other NP-hard problems in knot theory. Dale Koenig, Anastasiia Tsvietkova |
| 2021 | Vertex Sparsification for Edge Connectivity. Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz |