Convergence of distributions on paths -- Subtree Projection for Stepwise Hedge Automata -- The rectilinear convex hull of line segments -- Domino Snake Problems on Groups -- Parsing Unranked Tree Languages, Folded Once -- The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited -- Computing Subset Vertex Covers in H-Free Graphs -- On Computing Optimal Temporal Branchings -- Contracting edges to destroy a pattern: A complexity study -- Distance-based covering problems for graphs of given cyclomatic number -- An efficient computation of the rank function of a positroid -- Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time -- Complexity of Conformant Election Manipulation -- α-β-Factorization and the Binary Case of Simon's Congruence -- Bounds for c-Ideal Hashing -- Parameterized Complexity of $\mathcal{T}_{h+1}$-Free Edge Deletion Problem -- On the Parallel Complexity of Group Isomorphism via Weisfeiler--Leman -- The Complexity of $(P_k, P_\ell)$-Arrowing -- On Computing a Center Persistence Diagram -- Robust Identification in the Limit from Incomplete Positive Data -- Cordial Forests -- Vertex ordering with precedence constraints -- Forwards- and Backwards-Reachability for Cooperating Multi-Pushdown Systems -- Shortest Dominating Set Reconfiguration under Token Sliding -- Computing Optimal Leaf Roots of Chordal Cographs in Linear Time -- Verified Exact Real Computation with Nondeterministic Functions and Limits -- Exact and Parameterized Algorithms for the Independent Cutset Problem -- Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves -- Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku -- Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata.