Close Relatives (Of Feedback Vertex Set), Revisited. - Hugo Jacob 001; Thomas Bellitto; Oscar Defrain; Marcin Pilipczuk (IPEC, 2021)

List Colouring Trees in Logarithmic Space. - Hans L. Bodlaender; Carla Groenland; Hugo Jacob 001 (ESA, 2022)

On the Complexity of Problems on Tree-Structured Graphs. - Hans L. Bodlaender; Carla Groenland; Hugo Jacob 001; Marcin Pilipczuk; Michal Pilipczuk (IPEC, 2022)

Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. - Hugo Jacob 001; Marcin Pilipczuk (WG, 2022)

XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure. - Hans L. Bodlaender; Carla Groenland; Hugo Jacob 001 (CoRR, 2022)

Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron. - Paul Bastide 002; Carla Groenland; Hugo Jacob 001; Tom Johnston (Comb. Theory, 2024)

On the parameterized complexity of computing tree-partitions. - Hans L. Bodlaender; Carla Groenland; Hugo Jacob 001 (Discret. Math. Theor. Comput. Sci., 2024)

Twin-Width One. - Jungho Ahn; Hugo Jacob 001; Noleen Köhler; Christophe Paul; Amadeus Reinald; Sebastian Wiederrecht (STACS, 2025)

On a tree-based variant of bandwidth and forbidding simple topological minors. - Hugo Jacob 001; William Lochet; Christophe Paul (CoRR, 2025)

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. - Hans L. Bodlaender; Carla Groenland; Hugo Jacob 001; Lars Jaffke; Paloma T. Lima (Algorithmica, 2025)

A note on distance-hereditary graphs whose complement is also distance-hereditary. - Hugo Jacob 001 (CoRR, 2025)