Colouring graphs with constraints on connectivity. - Pierre Aboulker; Nick Brettell; Frédéric Havet; Dániel Marx; Nicolas Trotignon (CoRR, 2015)

Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. - Édouard Bonnet; Nick Brettell; O-joung Kwon; Dániel Marx (WG, 2016)

Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. - Édouard Bonnet; Nick Brettell; O-joung Kwon; Dániel Marx (IPEC, 2017)

Coloring Graphs with Constraints on Connectivity. - Pierre Aboulker; Nick Brettell; Frédéric Havet; Dániel Marx; Nicolas Trotignon (J. Graph Theory, 2017)

Orienting edges to fight fire in graphs. - Julien Bensmail; Nick Brettell (Australas. J Comb., 2018)

Parameterized Streaming Algorithms for Min-Ones d-SAT. - Akanksha Agrawal 001; Arindam Biswas 001; Édouard Bonnet; Nick Brettell; Radu Curticapean; Dániel Marx; Tillmann Miltzow; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2019)

Matroids with a cyclic arrangement of circuits and cocircuits. - Nick Brettell; Deborah Chun; Tara Fife; Charles Semple (Eur. J. Comb., 2019)

On a Generalization of Spikes. - Nick Brettell; Rutger Campbell; Deborah Chun; Kevin Grace 001; Geoff Whittle (SIAM J. Discret. Math., 2019)

Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. - Benjamin Bergougnoux; Édouard Bonnet; Nick Brettell; O-joung Kwon (IPEC, 2020)

Bounding the Mim-Width of Hereditary Graph Classes. - Nick Brettell; Jake Horsfield; Andrea Munaro; Giacomo Paesani; Daniël Paulusma (IPEC, 2020)

Steiner Trees for Hereditary Graph Classes. - Hans L. Bodlaender; Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Erik Jan van Leeuwen (LATIN, 2020)

Computing Subset Transversals in H-Free Graphs. - Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (WG, 2020)

Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective. - Nick Brettell; Jake Horsfield; Daniël Paulusma (CoRR, 2020)

List k-Colouring Pt-Free Graphs with No Induced 1-Subdivision of K1, s: a Mim-width Perspective. - Nick Brettell; Andrea Munaro; Daniël Paulusma (CoRR, 2020)

Solving problems on generalized convex graphs via mim-width. - Nick Brettell; Andrea Munaro; Daniël Paulusma (CoRR, 2020)

Excluded minors are almost fragile. - Nick Brettell; Ben Clark; James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory, Ser. B, 2020)

N-detachable pairs in 3-connected matroids I: Unveiling X. - Nick Brettell; Geoff Whittle; Alan Williams (J. Comb. Theory B, 2020)

Solving Problems on Generalized Convex Graphs via Mim-Width. - Flavia Bonomo-Braberman; Nick Brettell; Andrea Munaro; Daniël Paulusma (WADS, 2021)

Computing Weighted Subset Transversals in H-Free Graphs. - Nick Brettell; Matthew Johnson 002; Daniël Paulusma (WADS, 2021)

N-detachable pairs in 3-connected matroids II: Life in X. - Nick Brettell; Geoff Whittle; Alan Williams (J. Comb. Theory B, 2021)

Steiner trees for hereditary graph classes: A treewidth perspective. - Hans L. Bodlaender; Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Erik Jan van Leeuwen (Theor. Comput. Sci., 2021)

List k-colouring Pt-free graphs: A Mim-width perspective. - Nick Brettell; Jake Horsfield; Andrea Munaro; Daniël Paulusma (Inf. Process. Lett., 2022)

Computing Weighted Subset Odd Cycle Transversals in H-free graphs. - Nick Brettell; Matthew Johnson 002; Daniël Paulusma (J. Comput. Syst. Sci., 2022)

N-detachable pairs in 3-connected matroids III: The theorem. - Nick Brettell; Geoff Whittle; Alan Williams (J. Comb. Theory B, 2022)

Computing subset transversals in H-free graphs. - Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (Theor. Comput. Sci., 2022)

Computing Subset Vertex Covers in H-Free Graphs. - Nick Brettell; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Erik Jan van Leeuwen (FCT, 2023)

Cyclic Matroids. - Nick Brettell; Charles Semple; Gerry Toft (SIAM J. Discret. Math., 2023)

Generalized spikes with circuits and cocircuits of different cardinalities. - Nick Brettell; Kevin Grace 001 (Adv. Appl. Math., 2023)

The excluded minors for 2- and 3-regular matroids. - Nick Brettell; James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory B, 2023)

Excluded minors are almost fragile II: Essential elements. - Nick Brettell; James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory B, 2023)

Computing Excluded Minors for Classes of Matroids Representable over Partial Fields. - Nick Brettell; Rudi Pendavingh (Electron. J. Comb., 2024)

The excluded minors for GF(5)-representable matroids on ten elements. - Nick Brettell (Adv. Appl. Math., 2025)

What is a $4$-Connected Matroid? - Nick Brettell; Susan Jowett; James G. Oxley; Charles Semple; Geoff Whittle (Electron. J. Comb., 2025)

Comparing width parameters on graph classes. - Nick Brettell; Andrea Munaro; Daniël Paulusma; Shizhou Yang (Eur. J. Comb., 2025)

Computing subset vertex covers in H-free graphs. - Nick Brettell; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Johannes Rauch; Erik Jan van Leeuwen (Theor. Comput. Sci., 2025)

Non-crossing H-graphs: a generalization of proper interval graphs admitting FPT algorithms. - Flavia Bonomo-Braberman; Nick Brettell; Andrea Munaro; Daniël Paulusma (CoRR, 2025)

Detachable pairs in 3-connected matroids and simple 3-connected graphs. - Nick Brettell; Charles Semple; Gerry Toft (J. Comb. Theory B, 2026)