Sharp Upper and Lower Bounds on a Restricted Class of Convex Characters. - Steven Kelk; Ruben Meuwese (Electron. J. Comb., 2022)

Deep kernelization for the Tree Bisection and Reconnnect (TBR) distance in phylogenetics. - Steven Kelk; Simone Linz; Ruben Meuwese (CoRR, 2022)

Snakes and Ladders: A Treewidth Story. - Steven Chaplick; Steven Kelk; Ruben Meuwese; Matús Mihalák; Georgios Stamoulis (WG, 2023)

Relaxed Agreement Forests. - Virginia Aardevol Martinez; Steven Chaplick; Steven Kelk; Ruben Meuwese; Matús Mihalák; Georgios Stamoulis (CoRR, 2023)

Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance. - Steven Kelk; Simone Linz; Ruben Meuwese (Inf. Process. Lett., 2023)

Relaxed Agreement Forests. - Virginia Ardévol Martínez; Steven Chaplick; Steven Kelk; Ruben Meuwese; Matús Mihalák; Georgios Stamoulis (SOFSEM, 2024)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests. - David Mestel; Steven Chaplick; Steven Kelk; Ruben Meuwese (CoRR, 2024)

Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics. - Steven Kelk; Simone Linz; Ruben Meuwese (J. Comput. Syst. Sci., 2024)

Agreement forests of caterpillar trees: Complexity, kernelization and branching. - Steven Kelk; Ruben Meuwese (Theor. Comput. Sci., 2024)

Convex Characters, Algorithms, and Matchings. - Steven Kelk; Ruben Meuwese; Stephan Wagner (SIAM J. Discret. Math., 2024)