Table of Contents

• Matching Augmentation via Simultaneous ContractionsMohit Garg 0003, Felix Hommelsheim, Nicole Megow. [doi]
• Characterising Memory in Infinite GamesAntonio Casares, Pierre Ohlmann. [doi]
• Black-Box Testing Liveness Properties of Partially Observable Stochastic SystemsJavier Esparza, Vincent P. Grande. [doi]
• The Communication Complexity of Set Intersection Under Product DistributionsRotem Oshman, Tal Roth. [doi]
• Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and ComplexityWojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid, Alexandra Silva 0001. [doi]
• Online Demand Scheduling with FailoversKonstantina Mellou, Marco Molinaro 0001, Rudy Zhou. [doi]
• Triangle Counting with Local Edge Differential PrivacyTalya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith. [doi]
• A Hyperbolic Extension of Kadison-Singer Type ResultsRuizhe Zhang 0001, Xinzhi Zhang 0002. [doi]
• Cliques in High-Dimensional Geometric Inhomogeneous Random GraphsTobias Friedrich 0001, Andreas Göbel 0001, Maximilian Katzmann, Leon Schiller. [doi]
• Stable Matching: Choosing Which Proposals to MakeIshan Agarwal, Richard Cole 0001. [doi]
• Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper BoundsRobert Ferens, Marek Szykula. [doi]
• On Sparsification of Stochastic Packing ProblemsShaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel. [doi]
• Ellipsoid Fitting up to a ConstantJun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu. [doi]
• Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled StatesMinglong Qin, Penghui Yao. [doi]
• Scheduling Under Non-Uniform Job and Machine DelaysRajmohan Rajaraman, David Stalfa, Sheng Yang. [doi]
• On the Limits of Decision: the Adjacent Fragment of First-Order LogicBartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann. [doi]
• Robust Communication Complexity of Matching: EDCS Achieves 5/6 ApproximationAmir Azarmehr, Soheil Behnezhad. [doi]
• Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite PlanarPetr Hlinený, Jan Jedelský. [doi]
• Rerouting Planar Curves and Disjoint PathsTakehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. [doi]
• On Differentially Private Counting on TreesBadih Ghazi, Pritish Kamath, Ravi Kumar 0001, Pasin Manurangsi, Kewen Wu 0001. [doi]
• Approximation Algorithms for Network Design in Non-Uniform Fault ModelsChandra Chekuri, Rhea Jain. [doi]
• An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed GraphsPan Peng 0001, Yuyang Wang. [doi]
• Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-MultilinearizationPrashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha 0001, Bhargav Thankey. [doi]
• Parameter Estimation for Gibbs DistributionsDavid G. Harris 0001, Vladimir Kolmogorov. [doi]
• The Wrong Direction of Jensen's Inequality Is Algorithmically RightOr Zamir. [doi]
• Online Learning and Disambiguations of Partial Concept ClassesTsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini. [doi]
• Parallel Self-Testing of EPR Pairs Under Computational AssumptionsHonghao Fu, Daochen Wang, Qi Zhao. [doi]
• Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?Diptarka Chakraborty, Sourav Chakraborty 0001, Gunjan Kumar, Kuldeep S. Meel. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite MatchingS. Cliff Liu, Zhao Song 0002, Hengjie Zhang, Lichen Zhang 0003, Tianyi Zhou 0002. [doi]
• New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching ProgramsLijie Chen 0001, Xin Lyu 0002, Avishay Tal, Hongxun Wu. [doi]
• On the Complexity of Diameter and Related Problems in Permutation GroupsMarkus Lohrey, Andreas Rosowski. [doi]
• How to Play Optimally for Regular Objectives?Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove. [doi]
• Locality in Online, Dynamic, Sequential, and Distributed Graph AlgorithmsAmirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi, Jukka Suomela. [doi]
• A Sparse Johnson-Lindenstrauss Transform Using Fast HashingJakob Bæk Tejs Houen, Mikkel Thorup. [doi]
• The Identity Problem in ℤ ≀ ℤ Is DecidableRuiwen Dong 0001. [doi]
• Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL AlgorithmJun-Ting Hsieh, Pravesh K. Kothari. [doi]
• On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n)Charilaos Efthymiou, Weiming Feng 0001. [doi]
• Approximate Nearest Neighbor for Polygonal Curves Under Fréchet DistanceSiu-Wing Cheng, Haoqiang Huang. [doi]
• Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling ProblemsShi Li 0001. [doi]
• Searching for Regularity in Bounded FunctionsSiddharth Iyer, Michael Whitmeyer. [doi]
• Convergence of the Number of Period Sets in StringsEric Rivals, Michelle Sweering, Pengfei Wang. [doi]
• On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small kTimothy M. Chan, Qizheng He, Yuancheng Yu. [doi]
• Improved Hardness Results for the Guided Local Hamiltonian ProblemChris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans. [doi]
• An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk)Rasmus Kyng. [doi]
• Connected k-Center and k-Diameter ClusteringLukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt 0001, Julian Wargalla. [doi]
• Network Satisfaction Problems Solved by k-ConsistencyManuel Bodirsky, Simon Knäuer. [doi]
• The Support of Open Versus Closed Random WalksThomas Sauerwald, He Sun 0001, Danny Vagnozzi. [doi]
• A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on TreesClaire Mathieu, Hang Zhou 0001. [doi]
• Quantum Algorithms and Lower Bounds for Linear Regression with Norm ConstraintsYanlin Chen, Ronald de Wolf. [doi]
• Faster Submodular Maximization for Several Classes of MatroidsMonika Henzinger, Paul Liu, Jan Vondrák, Da-Wei Zheng. [doi]
• Approximation Algorithms for Envy-Free Cake Division with Connected PiecesSiddharth Barman, Pooja Kulkarni. [doi]
• Approximating Long Cycle Above Dirac's GuaranteeFedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov. [doi]
• Finding Almost Tight Witness TreesDylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità. [doi]
• Low Sample Complexity Participatory BudgetingMohak Goyal, Sukolsak Sakshuwong, Sahasrajit Sarmasarkar, Ashish Goel. [doi]
• Flipper Games for Monadically Stable Graph ClassesJakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk. [doi]
• Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity TestingHadley Black, Iden Kalemaj, Sofya Raskhodnikova. [doi]
• Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related ParametersHans L. Bodlaender, Carla Groenland, Michal Pilipczuk. [doi]
• A 4/3 Approximation for 2-Vertex-ConnectivityMiguel Bosch Calvo, Fabrizio Grandoni 0001, Afrouz Jabal Ameli. [doi]
• Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph ClassesPierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk. [doi]
• Lasserre Hierarchy for Graph Isomorphism and Homomorphism IndistinguishabilityDavid E. Roberson, Tim Seppelt. [doi]
• Fully Dynamic Shortest Paths and Reachability in Sparse DigraphsAdam Karczmarz, Piotr Sankowski. [doi]
• Dynamic Averaging Load Balancing on Arbitrary GraphsPetra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, Malin Rau. [doi]
• Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by TreewidthMichal Wlodarczyk 0001. [doi]
• Sample-Based Distance-Approximation for Subsequence-FreenessOmer Cohen Sidon, Dana Ron. [doi]
• Cumulative Memory Lower Bounds for Randomized and Quantum ComputationPaul Beame, Niels Kornerup. [doi]
• Multi Layer Peeling for Linear Arrangement and Hierarchical ClusteringYossi Azar, Danny Vainstein. [doi]
• Faster Matroid Partition AlgorithmsTatsuya Terao. [doi]
• Efficient Caching with Reserves via MarkingSharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang. [doi]
• Local Computation Algorithms for Hypergraph Coloring - Following Beck's ApproachAndrzej Dorobisz, Jakub Kozik. [doi]
• Sublinear Time Eigenvalue Approximation via Random SamplingRajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco, Archan Ray. [doi]
• On Computing the Vertex Connectivity of 1-Plane GraphsTherese Biedl, Karthik Murali. [doi]
• Streaming k-Edit Approximate Pattern Matching via String DecompositionSudatta Bhattacharya, Michal Koucký 0001. [doi]
• Linear Insertion Deletion Codes in the High-Noise and High-Rate RegimesKuan Cheng, Zhengzhong Jin, Xin Li 0006, Zhide Wei, Yu Zheng. [doi]
• Faster Parameterized Algorithms for Modification Problems to Minor-Closed ClassesLaure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. [doi]
• Optimal Decremental Connectivity in Non-Sparse GraphsAnders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup. [doi]
• List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2Shu Liu 0004, Chaoping Xing, Chen Yuan 0003. [doi]
• Truthful Matching with Online Items and Offline AgentsMichal Feldman, Federico Fusco, Simon Mauras, Rebecca Reiffenhäuser. [doi]
• Improved Mixing for the Convex Polygon Triangulation Flip WalkDavid Eppstein, Daniel Frishberg. [doi]
• A General Framework for Learning-Augmented Online AllocationIlan Reuven Cohen, Debmalya Panigrahi. [doi]
• Broadcasting with Random MatricesCharilaos Efthymiou, Kostas Zampetakis. [doi]
• Parameterised and Fine-Grained Subgraph Counting, Modulo 2Leslie Ann Goldberg, Marc Roth. [doi]
• Positivity Problems for Reversible Linear Recurrence SequencesGeorge Kenison, Joris Nieuwveld, Joël Ouaknine, James Worrell 0001. [doi]
• Deterministic Regular Functions of Infinite WordsOlivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot, Sarah Winter. [doi]
• Frameworks for Nonclairvoyant Network Design with Deadlines or DelayNoam Touitou. [doi]
• Compound Logics for Modification ProblemsFedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. [doi]
• Action CodesFrits W. Vaandrager, Thorsten Wißmann. [doi]
• Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General MetricsYu Chen 0039, Sanjeev Khanna, Zihan Tan. [doi]
• A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk)Anna R. Karlin. [doi]
• Minimum Chain Cover in Almost Linear TimeManuel Cáceres. [doi]
• Incremental Maximization via ContinuizationYann Disser, Max Klimm, Kevin Schewior, David Weckbecker. [doi]
• Population Protocols with Unordered DataMichael Blondin, François Ladouceur. [doi]
• The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product ProblemsAusten Z. Fan, Paraschos Koutris, Hangdong Zhao. [doi]
• On Range Summary QueriesPeyman Afshani, Pingan Cheng, Aniket Basu Roy, Zhewei Wei. [doi]
• Breaking the All Subsets Barrier for Min k-CutDaniel Lokshtanov, Saket Saurabh 0001, Vaishali Surianarayanan. [doi]
• Nondeterministic Interactive Refutations for Nearest Boolean VectorAndrej Bogdanov, Alon Rosen. [doi]
• Indiscernibles and Flatness in Monadically Stable and Monadically NIP ClassesJan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk. [doi]
• New Partitioning Techniques and Faster Algorithms for Approximate Interval SchedulingSpencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld. [doi]
• On Finding Constrained Independent Sets in CyclesIshay Haviv. [doi]
• Protecting Single-Hop Radio Networks from Message DropsKlim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena. [doi]
• Improved Product-State Approximation Algorithms for Quantum Local HamiltoniansThiago Bergamaschi. [doi]
• The Skolem Landscape (Invited Talk)James Worrell 0001. [doi]
• Simulating Markovian Open Quantum Systems Using Higher-Order Series ExpansionXiantao Li, Chunhao Wang. [doi]
• Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant ViewpointJin-yi Cai, Ben Young. [doi]
• The Complexity of Presburger Arithmetic with Power or PowersMichael Benedikt, Dmitry Chistikov 0001, Alessio Mansutti. [doi]
• An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative SetsIlan Doron Arad, Ariel Kulik, Hadas Shachnai. [doi]
• Context-Bounded Analysis of Concurrent Programs (Invited Talk)Pascal Baumann 0001, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche. [doi]
• An Efficient Algorithm for All-Pairs Bounded Edge ConnectivityShyan Akmal, Ce Jin. [doi]
• New Additive EmulatorsShimon Kogan, Merav Parter. [doi]
• Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-CalculusTitouan Carette, Etienne Moutot, Thomas Perez, Renaud Vilmart. [doi]
• Ortho-Radial Drawing in Near-Linear TimeYi-Jun Chang. [doi]
• Hardness of Finding Combinatorial Shortest Paths on Graph AssociahedraTakehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto. [doi]
• The Geometry of Tree-Based SortingGuy E. Blelloch, Magdalen Dobson. [doi]
• Monadic NIP in Monotone Classes of Relational StructuresSamuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos. [doi]
• Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional OptimalityMarvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki. [doi]
• The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-AssemblyDaniel Hader, Matthew J. Patitz. [doi]
• A Dichotomy for Succinct Representations of HomomorphismsChristoph Berkholz, Harry Vinall-Smeeth. [doi]
• On Semantically-Deterministic AutomataBader Abu Radi, Orna Kupferman. [doi]
• Algebraic Recognition of Regular FunctionsMikolaj Bojanczyk, Lê Thành Dung Nguyên. [doi]
• Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable FunctionsIshan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur. [doi]
• Fault-Tolerant ST-Diameter OraclesDavide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, Simon Krogmann, Martin Schirneck. [doi]
• Regular Methods for Operator Precedence LanguagesThomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi, N. Ege Saraç. [doi]
• Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and MoreAlexandru Gheorghiu, Tony Metger, Alexander Poremba. [doi]
• Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-RecoveryNicolas Resch, Chen Yuan 0003, Yihan Zhang 0001. [doi]
• First Order Logic on Pathwidth Revisited AgainMichael Lampis. [doi]
• Efficient Data Structures for Incremental Exact and Approximate Maximum FlowGramoz Goranci, Monika Henzinger. [doi]
• Fast Approximation of Search Trees on Trees with Centroid TreesBenjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma 0002. [doi]
• Optimal (Degree+1)-Coloring in Congested CliqueSam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra. [doi]
• Average-Case to (Shifted) Worst-Case Reduction for the Trace Reconstruction ProblemIttai Rubinstein. [doi]
• Nominal Topology for Data LanguagesFabian Birkmann, Stefan Milius, Henning Urbat. [doi]
• Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with CountingMoritz Lichter. [doi]
• Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk)Thomas Vidick. [doi]
• An O(log k)-Approximation for Directed Steiner Tree in Planar GraphsZachary Friggstad, Ramin Mousavi. [doi]
• Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut PlayerDaniel Agassy, Dani Dorfman, Haim Kaplan. [doi]
• Checking Refinement of Asynchronous Programs Against Context-Free SpecificationsPascal Baumann 0001, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche. [doi]
• Optimal Adjacency Labels for Subgraphs of Cartesian ProductsLouis Esperet, Nathaniel Harms, Viktor Zamaraev. [doi]
• Lower Bounds for Pseudo-Deterministic Counting in a StreamVladimir Braverman, Robert Krauthgamer, Aditya Krishnan 0001, Shay Sapir. [doi]
• Nearly Tight Spectral Sparsification of Directed HypergraphsKazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa. [doi]