Table of Contents

• Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix ParametersCarla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski. [doi]
• On the Streaming Complexity of Expander DecompositionYu Chen 0039, Michael Kapralov, Mikhail Makarov, Davide Mazzali. [doi]
• Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of HardnessBaris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski. [doi]
• Two-Sets Cut-Uncut on Planar GraphsMatthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen. [doi]
• Non-Linear PagingIlan Doron Arad, Joseph (Seffi) Naor. [doi]
• Forcing, Transition Algebras, and CalculiHashimoto Go, Daniel Gaina, Ionut Tutu. [doi]
• An Efficient Quantifier Elimination Procedure for Presburger ArithmeticChristoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche. [doi]
• New Tradeoffs for Decremental Approximate All-Pairs Shortest PathsMichal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos. [doi]
• List Update with Delays or Time WindowsYossi Azar, Shahar Lewkowicz, Danny Vainstein. [doi]
• Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov ComplexityZhenjian Lu, Rahul Santhanam. [doi]
• From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSPLeonid Gurvits, Nathan Klein, Jonathan Leake. [doi]
• On the Cut-Query Complexity of Approximating Max-CutOrestis Plevrakis, Seyoon Ragavan, S. Matthew Weinberg. [doi]
• Streaming Edge Coloring with Subquadratic Palette SizeShiri Chechik, Doron Mukhtar, Tianyi Zhang 0008. [doi]
• Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity OraclesSurender Baswana, Koustav Bhanja. [doi]
• Lower Bounds on 0-Extension with Steiner NodesYu Chen 0039, Zihan Tan. [doi]
• Subquadratic Submodular Maximization with a General Matroid ConstraintYusuke Kobayashi 0001, Tatsuya Terao. [doi]
• Optimal PSPACE-Hardness of Approximating Set Cover ReconfigurationShuichi Hirahara, Naoto Ohsaka. [doi]
• The 2-Dimensional Constraint Loop Problem Is DecidableQuentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell 0001. [doi]
• p-Group Steiner TreeYury Makarychev, Max Ovsiankin, Erasmo Tani. [doi]
• Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph ConnectivityYaowei Long, Yunfan Wang. [doi]
• Additive Spanner Lower Bounds with Optimal Inner Graph StructureGreg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu. [doi]
• Bayesian Calibrated Click-Through AuctionsJunjie Chen, Minming Li, Haifeng Xu, Song Zuo. [doi]
• Streaming Algorithms for Connectivity AugmentationCe Jin 0001, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian. [doi]
• Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETHShuangle Li, Bingkai Lin, Yuwei Liu. [doi]
• The Group Access Bounds for Binary Search TreesParinya Chalermsook, Manoj Gupta 0002, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai. [doi]
• Lookahead Games and Efficient Determinisation of History-Deterministic Büchi AutomataRohan Acharya, Marcin Jurdzinski, Aditya Prakash 0002. [doi]
• Exploiting Automorphisms of Temporal Graphs for Fast Exploration and RendezvousKonstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.. [doi]
• Isomorphism for Tournaments of Small Twin WidthMartin Grohe, Daniel Neuen. [doi]
• A Complete Quantitative Axiomatisation of Behavioural Distance of Regular ExpressionsWojciech Rozowski. [doi]
• Fully Dynamic Strongly Connected Components in Planar DigraphsAdam Karczmarz, Marcin Smulewicz. [doi]
• Detecting Disjoint Shortest Paths in Linear Time and MoreShyan Akmal, Virginia Vassilevska Williams, Nicole Wein. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear TimeKevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak. [doi]
• Streaming Edge Coloring with Asymptotically Optimal ColorsMohammad Saneian, Soheil Behnezhad. [doi]
• The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5Sophia Heimann, Hung P. Hoang 0001, Stefan Hougardy. [doi]
• Separability in Büchi VASS and Singly Non-Linear Systems of InequalitiesPascal Baumann 0001, Eren Keskin, Roland Meyer 0001, Georg Zetzsche. [doi]
• Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete ClassificationEsther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma. [doi]
• A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite GraphsCharlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi. [doi]
• Parameterized Approximation For Robust Clustering in Discrete Geometric SpacesFateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase. [doi]
• Cut Sparsification and Succinct Representation of Submodular HypergraphsYotam Kenneth, Robert Krauthgamer. [doi]
• Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole PrincipleAaron Potechin, Aaron Zhang. [doi]
• On Homomorphism Indistinguishability and Hypertree DepthBenjamin Scheidt. [doi]
• An Improved Integrality Gap for Disjoint Cycles in Planar GraphsNiklas Schlomberg. [doi]
• Tight Bounds on Adjacency Labels for Monotone Graph ClassesÉdouard Bonnet, Julien Duron, John Sylvester 0001, Viktor Zamaraev, Maksim Zhukovskii. [doi]
• Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided ErrorGuy Goldberg. [doi]
• The Structure of Trees in the Pushdown HierarchyArnaud Carayol, Lucien Charamond. [doi]
• Another Hamiltonian Cycle in Bipartite Pfaffian GraphsAndreas Björklund, Petteri Kaski, Jesper Nederlof. [doi]
• Domain Reasoning in TopKATCheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi. [doi]
• Better Sparsifiers for Directed Eulerian GraphsSushant Sachdeva, Anvith Thudi, Yibin Zhao 0003. [doi]
• On the Length of Strongly Monotone Descending Chains over ℕ^dSylvain Schmitz, Lia Schütze. [doi]
• Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum CommunicationMohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski. [doi]
• Function Spaces for Orbit-Finite SetsMikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski. [doi]
• Graphs Shortcuts: New Bounds and Algorithms (Invited Talk)Merav Parter. [doi]
• Lipschitz Continuous Allocations for Optimization GamesSoh Kumabe, Yuichi Yoshida. [doi]
• Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing ProblemsSerge Gaspers, Jerry Zirui Li. [doi]
• Dynamic PageRank: Algorithms and Lower BoundsRajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski. [doi]
• Better Space-Time-Robustness Trade-Offs for Set ReconciliationDjamal Belazzougui, Gregory Kucherov, Stefan Walzer. [doi]
• The Threshold Problem for Hypergeometric Sequences with Quadratic ParametersGeorge Kenison. [doi]
• Path-Reporting Distance Oracles with Logarithmic Stretch and Linear SizeShiri Chechik, Tianyi Zhang 0008. [doi]
• p-Norms in Correlation ClusteringSami Davies, Benjamin Moseley, Heather Newman. [doi]
• FO Logic on Cellular Automata Orbits Equals MSO LogicGuillaume Theyssier. [doi]
• Testing C_k-Freeness in Bounded-Arboricity GraphsTalya Eden, Reut Levi, Dana Ron. [doi]
• Almost-Tight Bounds on Preserving Cuts in Classes of Submodular HypergraphsSanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan 0001. [doi]
• Optimal Electrical Oblivious Routing on ExpandersCella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva. [doi]
• Algorithms for the Generalized Poset Sorting ProblemShaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, Yuhao Zhang 0001. [doi]
• Homogeneity and Homogenizability: Hard Problems for the Logic SNPJakub Rydval. [doi]
• T-Rex: Termination of Recursive Functions Using Lexicographic Linear CombinationsRaphael Douglas Giles, Vincent Jackson, Christine Rizkallah. [doi]
• Approximate Counting for Spin Systems in Sub-Quadratic TimeKonrad Anand, Weiming Feng 0001, Graham Freifeld, Heng Guo 0001, Jiaheng Wang 0002. [doi]
• Vertex-Minor Universal Graphs for Generating Entangled Quantum SubsystemsMaxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé. [doi]
• Õptimal Dynamic Time Warping on Run-Length Encoded StringsItai Boneh, Shay Golan 0001, Shay Mozes, Oren Weimann. [doi]
• A Note on Approximating Weighted Nash Social Welfare with Additive ValuationsYuda Feng, Shi Li 0001. [doi]
• Deciding Linear Height and Linear Size-To-Height Increase of Macro Tree TransducersPaul Gallot, Sebastian Maneth, Keisuke Nakano 0001, Charles Peyrat. [doi]
• Computing Tree Decompositions with Small Independence NumberClément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic. [doi]
• It's Hard to HAC Average Linkage!MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki. [doi]
• Learning Low-Degree Quantum ObjectsSrinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, Carlos Palazuelos. [doi]
• Faster Algorithms for Dual-Failure Replacement PathsShiri Chechik, Tianyi Zhang 0008. [doi]
• Kernelization Dichotomies for Hitting Subgraphs Under Structural ParameterizationsMarin Bougeret, Bart M. P. Jansen, Ignasi Sau. [doi]
• Regular Expressions with Backreferences and Lookaheads Capture NLOGYuya Uezato. [doi]
• Oracle-Augmented Prophet InequalitiesSariel Har-Peled, Elfarouk Harb, Vasilis Livanos. [doi]
• An O(loglog n)-Approximation for Submodular Facility LocationFateme Abbasi, Marek Adamczyk, Miguel Bosch Calvo, Jaroslaw Byrka, Fabrizio Grandoni 0001, Krzysztof Sornat, Antoine Tinguely. [doi]
• A Tight Subexponential-Time Algorithm for Two-Page Book EmbeddingRobert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki. [doi]
• Group Fairness: Multiwinner Voting and Beyond (Invited Talk)Edith Elkind. [doi]
• High-Accuracy Multicommodity Flows via Iterative RefinementLi Chen 0028, Mingquan Ye. [doi]
• Optimal Non-Adaptive Cell Probe Dictionaries and HashingKasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir. [doi]
• Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPsMohan Dantam, Richard Mayr. [doi]
• Parameterized Algorithms for Coordinated Motion Planning: Minimizing EnergyArgyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan 0001. [doi]
• An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and ApproximationsMónika Csikós, Nabil H. Mustafa. [doi]
• Two Choices Are Enough for P-LCPs, USOs, and Colorful TangentsMichaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber 0001. [doi]
• Two-Source and Affine Non-Malleable Extractors for Small EntropyXin Li, Yan Zhong. [doi]
• Robot Positioning Using Torus Packing for MultisetsChung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta. [doi]
• Cross-Paradigm Graph Algorithms (Invited Talk)Danupon Nanongkai. [doi]
• On the Smoothed Complexity of Combinatorial Local SearchYiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos. [doi]
• On the Space Usage of Approximate Distance Oracles with Sub-2 StretchTsvi Kopelowitz, Ariel Korin, Liam Roditty. [doi]
• A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-WidthNarek Bojikian, Stefan Kratsch. [doi]
• Automata-Theoretic Characterisations of Branching-Time Temporal LogicsMassimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron. [doi]
• BQP, Meet NP: Search-To-Decision Reductions and Approximate CountingSevag Gharibian, Jonas Kamminga. [doi]
• A Characterization of Complexity in Public Goods GamesMatan Gilboa. [doi]
• Constrained Level Planarity Is FPT with Respect to the Vertex Cover NumberBoris Klemz, Marie Diana Sieper. [doi]
• Problems on Group-Labeled Matroid BasesFlorian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz. [doi]
• The Discrepancy of Shortest PathsGreg Bodwin, Chengyuan Deng, Jie Gao 0001, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang 0027. [doi]
• Splitting-Off in HypergraphsKristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni. [doi]
• On Classes of Bounded Tree Rank, Their Interpretations, and Efficient SparsificationJakub Gajarský, Rose McCarty. [doi]
• Towards an Analysis of Quadratic ProbingWilliam Kuszmaul, Zoe Xi. [doi]
• Sharp Noisy Binary Search with Monotonic ProbabilitiesLucas Gretta, Eric Price 0001. [doi]
• An FPRAS for Two Terminal Reliability in Directed Acyclic GraphsWeiming Feng 0001, Heng Guo 0001. [doi]
• An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}sAntoine Mottet, Tomás Nagy, Michael Pinsker. [doi]
• Fast Approximate Counting of CyclesKeren Censor Hillel, Tomer Even, Virginia Vassilevska Williams. [doi]
• Solution Discovery via Reconfiguration for Problems in PMario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz. [doi]
• Satisfiability to Coverage in Presence of Fairness, Matroid, and Global ConstraintsTanmay Inamdar 0002, Pallavi Jain 0001, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh 0001, Anannya Upasana. [doi]
• Smoothed Analysis of Deterministic Discounted and Mean-Payoff GamesBruno Loff, Mateusz Skomra. [doi]
• A Multivariate to Bivariate Reduction for Noncommutative Rank and Related ResultsVikraman Arvind, Pushkar S. Joglekar. [doi]
• Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic GamesAndrei Constantinescu 0001, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio. [doi]
• Sublinear Algorithms for TSP via Path CoversSoheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi. [doi]
• An Improved Quantum Max Cut Approximation via Maximum MatchingEunou Lee, Ojas Parekh. [doi]
• Lower Bounds for Matroid Optimization Problems with a Linear ConstraintIlan Doron Arad, Ariel Kulik, Hadas Shachnai. [doi]
• A Sublinear Time Tester for Max-Cut on Clusterable GraphsAgastya Vibhuti Jha, Akash Kumar 0009. [doi]
• Caching Connections in MatchingsYaniv Sadeh, Haim Kaplan. [doi]
• Nearly Optimal Independence Oracle Algorithms for Edge Estimation in HypergraphsHolger Dell, John Lapinskas, Kitty Meeks. [doi]
• Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex SetsYasushi Kawase, Koichi Nishimura, Hanna Sumita. [doi]
• Decidability of Graph Neural Networks via Logical CharacterizationsMichael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan. [doi]
• Solving Promise Equations over Monoids and GroupsAlberto Larrauri, Stanislav Zivný. [doi]
• A Finite Presentation of Graphs of Treewidth at Most ThreeAmina Doumane, Samuel Humeau 0002, Damien Pous. [doi]
• Integer Linear-Exponential Programming in NP by Quantifier EliminationDmitry Chistikov 0001, Alessio Mansutti, Mikhail R. Starchak. [doi]
• Testing Spreading Behavior in Networks with Arbitrary TopologiesAugusto Modanese, Yuichi Yoshida. [doi]
• Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern MatchingKento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara. [doi]
• Edit Distance of Finite State TransducersC. Aiswarya, Amaldev Manuel, Saina Sunny. [doi]
• Flattability of Priority Vector Addition SystemsRoland Guttenberg. [doi]
• Decremental Matching in General Weighted GraphsAditi Dudeja. [doi]
• On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy WordsPavol Kebis, Florian Luca, Joël Ouaknine, Andrew Scoones, James Worrell 0001. [doi]
• Limits of Symmetric Computation (Invited Talk)Anuj Dawar. [doi]
• Parameterized Algorithms for Steiner Forest in Bounded Width GraphsAndreas Emil Feldmann, Michael Lampis. [doi]
• Identifying Tractable Quantified Temporal Constraints Within Ord-HornJakub Rydval, Zaneta Semanisinová, Michal Wrona. [doi]
• Oracle Separation of QMA and QCMA with Bounded AdaptivityShalev Ben-David, Srijita Kundu. [doi]
• Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of SurfacesChristophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht. [doi]
• Adaptive Sparsification for Matroid IntersectionKent Quanrud. [doi]
• One-Way Communication Complexity of Partial XOR FunctionsVladimir V. Podolskii, Dmitrii Sluch. [doi]
• Functional Closure Properties of Finite ℕ-Weighted AutomataJulian Dörfler, Christian Ikenmeyer. [doi]
• Minimizing Tardy Processing Time on a Single Machine in Near-Linear TimeNick Fischer, Leo Wennmann. [doi]
• Alphabet Reduction for Reconfiguration ProblemsNaoto Ohsaka. [doi]
• A Faster Algorithm for Pigeonhole Equal SumsCe Jin 0001, Hongxun Wu. [doi]
• No Polynomial Kernels for KnapsackKlaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay. [doi]
• Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex CoverFlorent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li 0005, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale. [doi]
• Improved Algorithm for Reachability in d-VASSYuxi Fu, Qizhe Yang, Yangluo Zheng. [doi]
• Verification of Population Protocols with Unordered DataSteffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy. [doi]
• Limits of Sequential Local Algorithms on the Random k-XORSAT ProblemKingsley Yung. [doi]
• Random Separating Hyperplane Theorem and Learning PolytopesChiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar 0001. [doi]
• Low-Memory Algorithms for Online Edge ColoringPrantar Ghosh, Manuel Stoeckl. [doi]
• From Proof Complexity to Circuit Complexity via Interactive ProtocolsNoel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam. [doi]
• Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat ObjectsPritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan 0001, Bratin Mondal, Andreas Wiese. [doi]
• Exponential Lower Bounds via Exponential SumsSomnath Bhattacharjee, Markus Bläser, Pranjal Dutta, Saswata Mukherjee. [doi]
• The Complexity of Computing in Continuous Time: Space Complexity Is PrecisionManon Blanc, Olivier Bournez. [doi]
• Finer-Grained Reductions in Fine-Grained Hardness of ApproximationElie Abboud, Noga Ron-Zewi. [doi]
• Fully-Scalable MPC Algorithms for Clustering in High DimensionArtur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý 0001. [doi]
• Refuting Approaches to the Log-Rank Conjecture for XOR FunctionsHamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni. [doi]
• NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support PolynomialsOmkar Baraskar, Agrim Dewan, Chandan Saha 0001, Pulkit Sinha. [doi]
• The Bit Complexity of Dynamic Algebraic Formulas and Their DeterminantsEmile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang. [doi]
• Optimal Bounds for Distinct QuarticsPanagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi. [doi]
• Polylogarithmic Approximations for Robust s-t PathShi Li 0001, Chenyang Xu 0002, Ruilong Zhang 0001. [doi]