Accepted papers
Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation
Beyond Helly graphs: the diameter problem on absolute retracts
Complementation in T-perfect Graphs
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
The Complexity of Gerrymandering over Graphs: Paths and Trees
The Graphs of Stably Matchable Pairs
Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs
Linearizable special cases of the quadratic shortest path problem
A linear-time parameterized algorithm for computing the width of a DAG
Block Elimination Distance
On Morphing 1-Planar Drawings
On Fair Covering and Hitting Problems
A heuristic approach to the treedepth decomposition problem for large graphs
The Largest Connected Subgraph Game
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem
On 3-Coloring of (2P_4 ,C_5)-Free Graphs
Feedback Vertex Set on Hamiltonian Graphs
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
The Perfect Matching Cut Problem Revisited
Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
Bears with Hats and Independence Polynomials
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More
Labeling Schemes for Deterministic Radio Multi-Broadcast
Interdicting Small (s,t)-Cuts by Protecting Edges
Sparse and Lightweight Spanners in Weighted Graphs with Local Additive Error
Acyclic, Star, and Injective Colouring: Bounding the Diameter
On subgraph complementation to H-free graphs
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms
Disjoint Stable Matchings in Linear Time
Odd Cycle Transversal in Mixed Graphs