Colouring H-Free Graphs of Bounded Diameter. - Barnaby Martin; Daniël Paulusma; Siani Smith (MFCS, 2019)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. - Jan Bok; Nikola Jedlicková; Barnaby Martin; Daniël Paulusma; Siani Smith (ESA, 2020)

Injective Colouring for H-Free Graphs. - Jan Bok; Nikola Jedlicková; Barnaby Martin; Daniël Paulusma; Siani Smith (CSR, 2021)

Partitioning H-Free Graphs of Bounded Diameter. - Christoph Brause; Petr A. Golovach; Barnaby Martin; Daniël Paulusma; Siani Smith (ISAAC, 2021)

Disjoint Paths and Connected Subgraphs for H-Free Graphs. - Walter Kern; Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (IWOCA, 2021)

Acyclic, Star, and Injective Colouring: Bounding the Diameter. - Christoph Brause; Petr A. Golovach; Barnaby Martin; Daniël Paulusma; Siani Smith (WG, 2021)

Few Induced Disjoint Paths for H-Free Graphs. - Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (ISCO, 2022)

Acyclic, Star, and Injective Colouring: Bounding the Diameter. - Christoph Brause; Petr A. Golovach; Barnaby Martin; Pascal Ochem; Daniël Paulusma; Siani Smith (Electron. J. Comb., 2022)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. - Matthew Johnson 002; Barnaby Martin; Siani Smith; Sukanya Pandey; Daniël Paulusma; Erik Jan van Leeuwen (CoRR, 2022)

Complexity Framework For Forbidden Subgraphs. - Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (CoRR, 2022)

Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. - Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (CoRR, 2022)

Colouring graphs of bounded diameter in the absence of small cycles. - Barnaby Martin; Daniël Paulusma; Siani Smith (Discret. Appl. Math., 2022)

Hard problems that quickly become very easy. - Barnaby Martin; Daniël Paulusma; Siani Smith (Inf. Process. Lett., 2022)

Partitioning H-free graphs of bounded diameter. - Christoph Brause; Petr A. Golovach; Barnaby Martin; Daniël Paulusma; Siani Smith (Theor. Comput. Sci., 2022)

Disjoint paths and connected subgraphs for H-free graphs. - Walter Kern; Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Theor. Comput. Sci., 2022)

Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter. - Barnaby Martin; Daniël Paulusma; Siani Smith (Theor. Comput. Sci., 2022)

QCSP on Reflexive Tournaments. - Benoît Larose; Barnaby Martin; Petar Markovic; Daniël Paulusma; Siani Smith; Stanislav Zivný (ACM Trans. Comput. Log., 2022)

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. - Matthew Johnson 002; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (MFCS, 2023)

Few induced disjoint paths for H-free graphs. - Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Theor. Comput. Sci., 2023)

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. - Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Algorithmica, 2023)

The Complexity of L(p, q)-Edge-Labelling. - Gaétan Berthe; Barnaby Martin; Daniël Paulusma; Siani Smith (Algorithmica, 2023)

Graph Homomorphism, Monotone Classes and Bounded Pathwidth. - Tala Eagling-Vose; Barnaby Martin; Daniël Paulusma; Siani Smith (CiE, 2024)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. - Vadim V. Lozin; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Mark H. Siggers; Siani Smith; Erik Jan van Leeuwen (ISAAC, 2024)

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. - Matthew Johnson 002; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (SWAT, 2024)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. - Felicia Lucke; Ali Momeni 003; Daniël Paulusma; Siani Smith (WG, 2024)

Graph Homomorphism, Monotone Classes and Bounded Pathwidth. - Tala Eagling-Vose; Barnaby Martin; Daniël Paulusma; Mark H. Siggers; Siani Smith (CoRR, 2024)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. - Felicia Lucke; Ali Momeni 003; Daniël Paulusma; Siani Smith (CoRR, 2024)

Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. - Hans L. Bodlaender; Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2025)

Acyclic, star and injective colouring: A complexity picture for H-free graphs. - Jan Bok; Nikola Jedlicková; Barnaby Martin; Pascal Ochem; Daniël Paulusma; Siani Smith (J. Comput. Syst. Sci., 2025)

A forbidden subgraph study for cut problems on graphs permitting loops and multiedges. - Tala Eagling-Vose; Barnaby Martin; Daniël Paulusma; Siani Smith (CoRR, 2025)

Complexity Framework for Forbidden Subgraphs I: The Framework. - Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Algorithmica, 2025)

Finding d-Cuts in Claw-free Graphs. - Jungho Ahn; Tala Eagling-Vose; Felicia Lucke; Daniël Paulusma; Siani Smith (CoRR, 2025)