Table of Contents

• Social Distancing Network CreationTobias Friedrich 0001, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko. [doi]
• Deciding Twin-Width at Most 4 Is NP-CompletePierre Bergé, Édouard Bonnet, Hugues Déprés. [doi]
• Reconstructing Decision TreesGuy Blanc, Jane Lange, Li-Yang Tan. [doi]
• On Computing the k-Shortcut Fréchet DistanceJacobus Conradi, Anne Driemel. [doi]
• Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower BoundsSurya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu. [doi]
• Improved Reconstruction of Random Geometric GraphsVarsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore. [doi]
• Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed kCalvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang 0002. [doi]
• A Structural Investigation of the Approximability of Polynomial-Time ProblemsKarl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann. [doi]
• Circuit Extraction for ZX-Diagrams Can Be #P-HardNiel de Beaudrap, Aleks Kissinger, John van de Wetering. [doi]
• Almost Tight Approximation Hardness for Single-Source Directed k-Edge-ConnectivityChao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang 0001. [doi]
• New Additive Approximations for Shortest Paths and CyclesMingyang Deng, Yael Kirkpatrick, Victor Rong, Virginia Vassilevska Williams, Ziqian Zhong. [doi]
• Parameterized Sensitivity Oracles and Dynamic Algorithms Using Exterior AlgebrasJosh Alman, Dean Hirsch. [doi]
• Beating Matrix Multiplication for n^{1/3}-Directed ShortcutsShimon Kogan, Merav Parter. [doi]
• Streaming and Sketching Complexity of CSPs: A Survey (Invited Talk)Madhu Sudan 0001. [doi]
• Linearly Ordered Colourings of HypergraphsTamio-Vesa Nakajima, Stanislav Zivný. [doi]
• Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP SolverParinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai. [doi]
• Sublinear-Round Parallel Matroid IntersectionJoakim Blikstad. [doi]
• Near-Optimal Algorithms for Stochastic Online Bin PackingNikhil Ayyadevara, Rajni Dabas, Arindam Khan 0001, K. V. N. Sreenivas. [doi]
• Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial ComplexesMitchell Black, Amir Nayyeri. [doi]
• Set Membership with Two Classical and Quantum Bit ProbesShyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan. [doi]
• The Decision Problem for Perfect Matchings in Dense HypergraphsLuyining Gan, Jie Han 0002. [doi]
• High-Probability List-Recovery, and Applications to Heavy HittersDean Doron, Mary Wootters. [doi]
• Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in MultigraphsAlexandra Lassota, Aleksander Lukasiewicz, Adam Polak 0001. [doi]
• The Variance-Penalized Stochastic Shortest Path ProblemJakob Piribauer, Ocan Sankur, Christel Baier. [doi]
• Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete GadgetsMing Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang 0052. [doi]
• Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex FailuresMichal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny. [doi]
• On Lower Bounds of Approximating Parameterized k-CliqueBingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang. [doi]
• A Generic Solution to Register-Bounded Synthesis with an Application to Discrete OrdersLéo Exibard, Emmanuel Filiot, Ayrat Khalimov 0001. [doi]
• Graph Reconstruction from Random SubgraphsAndrew McGregor 0001, Rik Sengupta. [doi]
• Strategy Synthesis for Global Window PCTLBenjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin. [doi]
• Tight Approximation Algorithms for Two-Dimensional Guillotine Strip PackingArindam Khan 0001, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese. [doi]
• Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer ProgrammingMarcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, Felix Schröder. [doi]
• Functions and References in the Pi-Calculus: Full Abstraction and Proof TechniquesEnguerrand Prebet. [doi]
• A Perfect Sampler for Hypergraph Independent SetsGuoliang Qiu, Yanheng Wang, Chihao Zhang 0001. [doi]
• Near-Optimal Decremental Hopsets with ApplicationsJakub Lacki, Yasamin Nazari. [doi]
• Downsampling for Testing and Learning in Product DistributionsNathaniel Harms, Yuichi Yoshida. [doi]
• Smoothed Analysis of the Komlós ConjectureNikhil Bansal 0001, Haotian Jiang, Raghu Meka, Sahil Singla 0001, Makrand Sinha. [doi]
• Online Weighted Cardinality Joint Replenishment Problem with DelayRyder Chen, Jahanvi Khatkar, Seeun William Umboh. [doi]
• Faster Cut-Equivalent Trees in Simple GraphsTianyi Zhang. [doi]
• Competitive Vertex RecoloringYossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou. [doi]
• The Dimension Spectrum Conjecture for Planar LinesDonald M. Stull. [doi]
• LCC and LDC: Tailor-Made Distance Amplification and a Refined SeparationGil Cohen, Tal Yankovitz. [doi]
• Equilibrium Computation, Deep Learning, and Multi-Agent Reinforcement Learning (Invited Talk)Constantinos Daskalakis. [doi]
• Expander Random Walks: The General Case and LimitationsGil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma. [doi]
• Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-ApproximationAviad Rubinstein, Junyao Zhao 0001. [doi]
• Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time ReductionsMing Ding, Rasmus Kyng, Peng Zhang 0052. [doi]
• Improved Approximation Algorithms and Lower Bounds for Search-Diversification ProblemsAmir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi. [doi]
• A Fixed-Parameter Algorithm for the Kneser ProblemIshay Haviv. [doi]
• Parameterized Complexity of Untangling KnotsClément Legrand-Duchesne, Ashutosh Rai 0001, Martin Tancer. [doi]
• The Complexity of SPEs in Mean-Payoff GamesLéonard Brice, Jean-François Raskin, Marie van den Bogaard. [doi]
• Unique Assembly Verification in Two-Handed Self-AssemblyDavid Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie. [doi]
• What Can Oracles Teach Us About the Ultimate Fate of Life?Ville Salo, Ilkka Törmä. [doi]
• Backdoor Sets on Nowhere Dense SATDaniel Lokshtanov, Fahad Panolan, M. S. Ramanujan 0001. [doi]
• Polylogarithmic Sketches for ClusteringMoses Charikar, Erik Waingarten. [doi]
• Strongly Sublinear Algorithms for Testing Pattern FreenessIlan Newman, Nithin Varma. [doi]
• Round-Optimal Lattice-Based Threshold Signatures, RevisitedShweta Agrawal, Damien Stehlé, Anshu Yadav. [doi]
• Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs DistancesDavide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, Martin Schirneck. [doi]
• Streaming Algorithms for Geometric Steiner ForestArtur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý. [doi]
• Fully Functional Parameterized Suffix Trees in Compact SpaceArnab Ganguly 0002, Rahul Shah, Sharma V. Thankachan. [doi]
• Fully-Dynamic α + 2 Arboricity Decompositions and Implicit ColouringAleksander B. G. Christiansen, Eva Rotenberg. [doi]
• Streaming Submodular Maximization Under Matroid ConstraintsMoran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen. [doi]
• Polynomial Delay Algorithm for Minimal Chordal CompletionsCaroline Brosse, Vincent Limouzy, Arnaud Mary. [doi]
• Improved Sublinear-Time Edit Distance for Preprocessed StringsKarl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos. [doi]
• Tolerant Bipartiteness Testing in Dense GraphsArijit Ghosh, Gopinath Mishra, Rahul Raychaudhury, Sayantan Sen. [doi]
• Delegation for Search ProblemsJustin Holmgren, Andrea Lincoln, Ron D. Rothblum. [doi]
• Understanding the Moments of Tabulation Hashing via ChaosesJakob Bæk Tejs Houen, Mikkel Thorup. [doi]
• Some New (And Old) Results on Contention Resolution (Invited Talk)Leslie Ann Goldberg. [doi]
• Strong Approximations and Irrationality in Financial Networks with DerivativesStavros D. Ioannidis, Bart de Keijzer, Carmine Ventre. [doi]
• Memoryless Worker-Task Assignment with Polylogarithmic Switching CostAaron Berger, William Kuszmaul, Adam Polak 0001, Jonathan Tidor, Nicole Wein. [doi]
• Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE SufficesZvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta. [doi]
• A Faster Interior-Point Method for Sum-Of-Squares OptimizationShunhua Jiang, Bento Natura, Omri Weinstein. [doi]
• Parameterized Safety Verification of Round-Based Shared-Memory SystemsNathalie Bertrand 0001, Nicolas Markey, Ocan Sankur, Nicolas Waldburger. [doi]
• Reachability in Bidirected Pushdown VASSMoses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche. [doi]
• Approximating Observables Is as Hard as CountingAndreas Galanis, Daniel Stefankovic, Eric Vigoda. [doi]
• Monotone Arithmetic Complexity of Graph Homomorphism PolynomialsBalagopal Komarath, Anurag Pandey 0001, Chengot Sankaramenon Rahul. [doi]
• Lower Bounds for Unambiguous Automata via Communication ComplexityMika Göös, Stefan Kiefer, Weiqiang Yuan 0002. [doi]
• A PTAS for Packing Hypercubes into a KnapsackKlaus Jansen, Arindam Khan 0001, Marvin Lira, K. V. N. Sreenivas. [doi]
• Fully-Dynamic Graph Sparsifiers Against an Adaptive AdversaryAaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun 0001. [doi]
• The Manifold Joys of Sampling (Invited Talk)Yin Tat Lee, Santosh S. Vempala. [doi]
• Testability and Local Certification of Monotone Properties in Minor-Closed ClassesLouis Esperet, Sergey Norin. [doi]
• Regular Expressions for Tree-Width 2 GraphsAmina Doumane. [doi]
• Fast Sampling via Spectral Independence Beyond Bounded-Degree GraphsIvona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic. [doi]
• Satisfiability Problems for Finite GroupsPawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß. [doi]
• (Re)packing Equal Disks into RectangleFedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Meirav Zehavi. [doi]
• An Optimal-Time RLBWT Construction in BWT-Runs Bounded SpaceTakaaki Nishimoto, Shunsuke Kanda, Yasuo Tabei. [doi]
• Decremental Matching in General GraphsSepehr Assadi, Aaron Bernstein, Aditi Dudeja. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Galloping in Fast-Growth Natural Merge SortsElahe Ghasemi, Vincent Jugé, Ghazal Khalighinejad. [doi]
• The Complexity of Finding Fair Many-To-One MatchingsNiclas Boehmer, Tomohiro Koana. [doi]
• Metastability of the Potts Ferromagnet on Random Regular GraphsAmin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda. [doi]
• Privately Estimating Graph Parameters in Sublinear TimeJeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee. [doi]
• Polynomial-Time Approximation of Zero-Free Partition FunctionsPenghui Yao, Yitong Yin, Xinyuan Zhang. [doi]
• Processes Parametrised by an Algebraic TheoryTodd Schmid, Wojciech Rozowski, Alexandra Silva 0001, Jurriaan Rot. [doi]
• Computability of Finite Simplicial ComplexesDjamel Eddine Amir, Mathieu Hoyrup. [doi]
• Optimal Coding Theorems in Time-Bounded Kolmogorov ComplexityZhenjian Lu, Igor Carboni Oliveira, Marius Zimand. [doi]
• Distributed Controller Synthesis for Deadlock AvoidanceHugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz. [doi]
• Pairwise Reachability Oracles and Preservers Under FailuresDiptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary. [doi]
• Twin-Width and TypesJakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk. [doi]
• Towards a Theory of Algorithmic Proof Complexity (Invited Talk)Albert Atserias. [doi]
• Finding Monotone Patterns in Sublinear Time, AdaptivelyOmri Ben-Eliezer, Shoham Letzter, Erik Waingarten. [doi]
• Explicit and Efficient Construction of Nearly Optimal Rate Codes for the Binary Deletion Channel and the Poisson Repeat ChannelIttai Rubinstein. [doi]
• Threshold Rates of Code Ensembles: Linear Is BestNicolas Resch, Chen Yuan 0003. [doi]
• Dynamic Meta-Theorems for Distance and MatchingSamir Datta, Chetan Gupta 0002, Rahul Jain 0015, Anish Mukherjee 0001, Vimal Raj Sharma, Raghunath Tewari. [doi]
• A Study of Weisfeiler-Leman Colorings on Planar GraphsSandra Kiefer, Daniel Neuen. [doi]
• Minimum+1 (s, t)-cuts and Dual Edge Sensitivity OracleSurender Baswana, Koustav Bhanja, Abhyuday Pandey. [doi]
• Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path ArgumentKonrad Majewski, Tomás Masarík, Jana Novotná 0001, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski. [doi]
• A Brief Tour in Twin-Width (Invited Talk)Stéphan Thomassé. [doi]
• Approximate Triangle Counting via Sampling and Fast Matrix MultiplicationJakub Tetek. [doi]
• Separations Between Combinatorial Measures for Transitive FunctionsSourav Chakraborty 0001, Chandrima Kayal, Manaswi Paraashar. [doi]
• Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity GraphsTalya Eden, Dana Ron, Will Rosenbaum. [doi]
• p Subspace ApproximationAmit Deshpande 0001, Rameshwar Pratap. [doi]
• Unboundedness for Recursion Schemes: A Simpler Type SystemDavid Barozzini, Pawel Parys, Jan Wroblewski. [doi]
• Homomorphism Tensors and Linear EquationsMartin Grohe, Gaurav Rattan, Tim Seppelt. [doi]
• Faster Knapsack Algorithms via Bounded Monotone Min-Plus-ConvolutionKarl Bringmann, Alejandro Cassis. [doi]
• Learning Algorithms Versus Automatability of Frege SystemsJán Pich, Rahul Santhanam. [doi]
• Approximation Algorithms for Interdiction Problem with Packing ConstraintsLin Chen, Xiaoyu Wu, Guochuan Zhang. [doi]
• Space Characterizations of Complexity Measures and Size-Space Trade-Offs in Propositional Proof SystemsTheodoros Papamakarios, Alexander A. Razborov. [doi]
• On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and HypergraphsCharilaos Efthymiou. [doi]
• A PTAS for Capacitated Vehicle Routing on TreesClaire Mathieu, Hang Zhou 0001. [doi]
• Regularized Box-Simplex Games and Dynamic Decremental Bipartite MatchingArun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian. [doi]
• Limitations of Local Quantum Algorithms on Random MAX-k-XOR and BeyondChi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, Jonathan Shi. [doi]
• Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random GraphsAkash Kumar 0003, Anand Louis, Rameesh Paul. [doi]
• The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-WidthRobert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov. [doi]
• Faster Cut Sparsification of Weighted GraphsSebastian Forster, Tijn de Vos. [doi]
• Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup GameWilliam Kuszmaul, Shyam Narayanan. [doi]
• Low-Degree Polynomials Extract From Local SourcesOmar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li 0006, João L. Ribeiro 0001. [doi]
• Hiding Pebbles When the Output Alphabet Is UnaryGaëtan Douéneau-Tabot. [doi]
• Passive Learning of Deterministic Büchi Automata by Combinations of DFAsLeón Bohn, Christof Löding. [doi]
• Improved Approximation Algorithms for Dyck Edit Distance and RNA FoldingDebarati Das 0001, Tomasz Kociumaka, Barna Saha. [doi]
• Universal Complexity Bounds Based on Value Iteration and Application to Entropy GamesXavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz, Mateusz Skomra. [doi]
• In-Range Farthest Point Queries and Related Problem in High DimensionsZiyun Huang, Jinhui Xu 0001. [doi]
• On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller GamesAntonio Casares, Thomas Colcombet, Karoliina Lehtinen. [doi]
• The SDP Value of Random 2CSPsAmulya Musipatla, Ryan O'Donnell, Tselil Schramm, Xinyu Wu. [doi]
• Sublinear Dynamic Interval Scheduling (On One or Multiple Machines)Pawel Gawrychowski, Karol Pokorski. [doi]