Quadratic Vertex Kernel for Split Vertex Deletion -- The temporal explorer who returns to the base -- Minimum Convex Partition of Point Sets -- Parameterized Complexity of Safe Set -- Parameterized Complexity of Diameter -- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints -- Project Games -- Subgraph Isomorphism on Graph Classes that Exclude a Substructure -- Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors -- k-cuts on a path -- Extension of vertex cover and independent set in some classes of graphs -- On Hedonic Games with Common Ranking Property -- Complexity of scheduling for DARP with soft ride times -- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set -- Fair Hitting Sequence problem: scheduling activities with varied frequency requirements -- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability -- Searching by heterogeneous agents -- Finding a Mediocre Player -- Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation -- The Parameterized Position Heap of a Trie -- Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set -- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders -- Turing Tumble is P(SPACE)-Complete -- Linear-Time In-Place DFS and BFS on the Word RAM -- A Faster Algorithm for the Strongly Stable b-Matching Problem -- Eternal Domination in Grids -- On the Necessary Memory to Compute the Plurality in Multi-Agent Systems -- Complexity of Vertex Switching on Edge-Bicolored Graphs -- Independent lazy better-response dynamics on network games -- Subset Feedback Vertex Set in Chordal and Split Graphs.