Invited papers.- Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps.- Some Observations on Dynamic Random Walks and Network Renormalization.- Highly Succinct Dynamic Data Structures.- Formal methods.- Largest Common Prefix of a Regular Tree Language.- Winning Strategies for Streaming Rewriting Games.- Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting.- Two characterizations of finite-state dimension.- Complexity.- Optimal channel utilization with limited feedback.- Deterministic Preparation of Dicke States.- Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle.- On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties.- Algorithms.- An Efficient Algorithm for the Fast Delivery Problem.- Extension of some edge graph problems: standard and parameterized complexity.- Space Efficient Algorithms for Breadth-Depth Search.- Circular Pattern Matching with k Mismatches.- SuccinctRepresentations of Finite Groups.- On the Tractability of Covering a Graph with 2-Clubs.- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.- Maximum rectilinear convex subsets.- Computing Digraph Width Measures on Directed Co-Graphs.- Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel.- Rare Siblings Speed-up Deterministic Detection and Counting of Small Pattern Graphs.- Bivariate B-splines from convex pseudo-circle configurations.- The Fault-Tolerant Metric Dimension of Cographs.
