Lambdas, Transducers and MSO (abstract)

Computational complexity of covering regular trees (abstract)

Isometric-Universal Graphs for Trees (abstract)

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism (abstract)

On Expansions of Monadic Second-Order Logic with Dynamical Predicates (abstract)

On Large Zeros of Linear Recurrence Sequences (abstract)

Deciding Termination of Simple Randomized Loops (abstract)

Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components (abstract)

Quasipolynomial-Time Deterministic Kernelization and Gammoid Representation (abstract)

Elimination Distance to Dominated Clusters (abstract)

Temporal Valued Constraint Satisfaction Problems (abstract)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction (abstract)

Quantum Relaxations of CSP and Structure Isomorphism (abstract)

Solving Partial Dominating Set and Related Problems Using Twin-Width (abstract)

A Note on the Complexity of Defensive Domination (abstract)

Parameterized Spanning Tree Congestion (abstract)

Positional-Player Games (abstract)

Games with ω-Automatic Preference Relations (abstract)

Deciding regular games: a playground for exponential time algorithms (abstract)

On Graph Queries and Modal Constraints (abstract)

An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines (abstract)

Counting Locally Optimal Tours in the TSP (abstract)

Approximating Prize-Collecting Variants of TSP (abstract)

Resolving Nondeterminism with Randomness (abstract)

Relative randomness and continuous translation functions (abstract)

Random Permutations in Computational Complexity (abstract)

Counting Distinct Square Substrings in Sublinear Time (abstract)

A proof of Shur's conjecture on the growth of power-free languages over large alphabets (abstract)

Reachability in symmetric VASS (abstract)

Polynomial-time Tractable Problems over the p-adic Numbers (abstract)

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space (abstract)

One-Parametric Presburger Arithmetic has Quantifier Elimination (abstract)

Linear Time Subsequence and Supersequence Regex Matching (abstract)

Efficient Matching of Some Fundamental Regular Expressions with Backreferences (abstract)

Negated String Containment is Decidable (abstract)

Model-theoretic Forcing in Transition Algebra (abstract)

Homomorphism Indistinguishability and Game Comonads for Restricted Conjunction and Requantification (abstract)

Symmetric Proofs in the Ideal Proof System (abstract)

Almost-Linear Time Algorithms for Partially Dynamic Graphs

Wait-Only Broadcast Protocols are Easier to Verify (abstract)

Broadcasting under Structural Restrictions (abstract)

Online Knapsack Problems with Estimates (abstract)

Quantitative Monoidal Algebra: Axiomatising Distance with String Diagrams (abstract)

Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings (abstract)

Right-Linear Lattices: An Algebraic Theory of ω-Regular Languages via Fixed Points (abstract)

Tight analysis of the primal-dual method for edge-covering pliable set families (abstract)

On the Performance of Mildly Greedy Players in k-Coloring Games (abstract)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity (abstract)

Quantum Programming in Polylogarithmic Time (abstract)

A Universal Uniform Approximation Theorem for Neural Networks (abstract)

Cutoff Theorems for the Equivalence of Parameterized Quantum Circuits (abstract)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows–Wheeler Transform (abstract)

Morphisms and BWT-run Sensitivity (abstract)

Word structures and their automatic presentations (abstract)

On the Reachability Problem for Two-Dimensional Branching VASS (abstract)

FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree (abstract)

On Piecewise Affine Reachability with Bellman Operators (abstract)

Higher Connectivity in Directed Graphs

Shortest Paths in Multimode Graphs (abstract)

Token Sliding Reconfiguration on DAGs (abstract)

Temporal Graph Realization With Bounded Stretch (abstract)

Regular model checking for systems with effectively regular reachability relation (abstract)

The complexity of reachability problems in strongly connected finite automata (abstract)

The complexity of separability for semilinear sets and Parikh automata (abstract)

Graphs with no long claws: An improved bound for the analog of the Gyárfás’ path argument (abstract)

Symmetry classes of Hamiltonian cycles (abstract)

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width (abstract)

Catalytic Computing and Register Programs Beyond Log-Depth (abstract)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials (abstract)

Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (abstract)

Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs (abstract)

Cops and Robbers for Graphs on Surfaces with Crossings (abstract)

Color Refinement for Relational Structures (abstract)

Lazy B-Trees (abstract)

On Synthesis of Distributed Monitors (abstract)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy (abstract)

New Hardness Results for Low-Rank Matrix Completion (abstract)

Finding equilibria: simpler for pessimists, simplest for optimists (abstract)

Subcoloring of (Unit) Disk Graphs (abstract)

Guarding Offices with Maximum Dispersion (abstract)

Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization (abstract)

Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts (abstract)

Dynamic Membership for Regular Tree Languages (abstract)

Sensitivity and Query Complexity under Uncertainty (abstract)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton (abstract)

Register Automata with Permutations (abstract)

Minimization of Deterministic Finite Automata Modulo the Edit Distance (abstract)

The Complexity of Computing Second Solutions (abstract)

Which graph motif parameters count? (abstract)

#SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank (abstract)

Universality Frontier for Asynchronous Cellular Automata (abstract)

Lexicographic transductions of finite words (abstract)

Strong keys for tensor isomorphism cryptography (abstract)