Accepted papers: track A
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
Inapproximability of the independent set polynomial below the Shearer threshold
A (1+eps)-approximation for Unsplittable Flow on a Path in fixed-parameter running time
Sublinear Random Access Generators for Preferential Attachment Graphs
Honest signaling in zero-sum games is hard… and lying is even harder!
On the Value of Penalties in Time-Inconsistent Planning
Efficient Construction of Probabilistic Tree Embeddings
Tighter Hard Instances for PPSZ
k-Distinct In- and Out-Branchings in Digraphs
Dynamic beats fixed: On phase-based algorithms for file migration
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs
Quantum automata cannot detect biased coins, even in the limit
Separation of AC^0[⊕] Formulas and Circuits
On Finding the Jaccard Center
Linear kernels for edge deletion problems to immersion-closed graph classes
The Polytope-Collision Problem
An efficient strongly connected components algorithm in the fault tolerant model
Fast Regression with an $\ell_\infty$ Guarantee
Embeddings of Schatten Norms with Applications to Data Streams
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
Improved Hardness for Cut, Interdiction, and Firefighter Problems
Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis
Packing Cycles Faster Than Erdős-Pósa
Sensitivity Conjecture and Log-rank Conjecture for functions with small alternating numbers
Bipartite Perfect Matching in Pseudo-Deterministic NC
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback
Dynamic Parameterized Problems and Algorithms
Covering vectors by spaces: Regular matroids
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection
Interactive Oracle Proofs with Constant Rate and Query Complexity
Neighborhood complexity and kernelization for nowhere dense classes of graphs
Additive Spanners and Distance Oracles in Quadratic Time
A QPTAS for the general scheduling problem with identical release dates
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game
On the Bit Complexity of Sum-of-Squares Proofs
Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces
Conditional Lower Bounds for All-Pairs Max-Flow
Exploring the complexity of layout parameters in tournaments and semi-complete digraphs
Online Covering with Sum of lq-Norm Objectives
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs
Finding Detours is Fixed-parameter Tractable
Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultra-linear grammars are where Parsing Becomes Hard!
Testing Core Membership in Public Goods Economies
Efficient Approximations for the Online Dispersion Problem
Exact Algorithms via Multivariate Subroutines
Reusable Garbled Deterministic Finite Automata from Learning With Errors
Linear-time Kernelization for Feedback Vertex Set
Edge-Orders
Preserving Distances in Very Faulty Graphs
A new Holant dichotomy inspired by quantum computation
Revenue maximization in Stackelberg Pricing Games: Beyond the combinatorial setting
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
The Complexity of Holant Problems over Boolean Domain with Non-negative Weights
Subspace Designs based on Algebraic Function Fields
On problems equivalent to (min,+)-convolution
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
General Bounds for Incremental Maximization
A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps
Rerouting flows when links fail
All-Pairs $2$-Reachability in $O(n^{\omega}\log n)$ Time
The Infinite Server Problem
Improved Algorithms for MST and Metric-TSP Interdiction
Stochastic Control via Entropy Compression
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
Non-Uniform Attacks Against Pseudoentropy
Decremental Data Structures for Connectivity and Dominators in Directed Graphs
Randomized Communication vs. Partition Number
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
Approximate Bounded Indistinguishability
Near-optimal Closeness Testing of Discrete Histogram Distributions
Approximation Strategies for Generalized Binary Search in Weighted Trees
Polynomial-time Rademacher theorem, porosity and randomness
On the Fine-grained Complexity of One-Dimensional Dynamic Programming
Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification
Efficient Quantum Algorithms for Simulating Lindblad Evolution
Online Market Intermediation
String Inference from Longest-Common-Prefix Array
When the Optimum is also Blind: a New Perspective on Universal Optimization
Tight Lower Bounds for Multiplicative Weights Algorithmic Families
The Power of Shared Randomness in Uncertain Communication
On Fast Decoding of High-Dimensional Signals from One-Bit Measurements
Controlled quantum amplification
Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
Relaxations of Graph Isomorphisms
The Parameterized Complexity of Positional Games