| Bounding the mim‐width of hereditary graph classes N Brettell, J Horsfield, A Munaro, G Paesani, D Paulusma Journal of Graph Theory 99 (1), 117-151, 2022 | 21 | 2022 |
| Coloring graphs with constraints on connectivity P Aboulker, N Brettell, F Havet, D Marx, N Trotignon Journal of Graph Theory 85 (4), 814-838, 2017 | 17 | 2017 |
| List k-colouring Pt-free graphs: A mim-width perspective N Brettell, J Horsfield, A Munaro, D Paulusma Information Processing Letters 173, 106168, 2022 | 16* | 2022 |
| Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms É Bonnet, N Brettell, O Kwon, D Marx Algorithmica 81, 3890-3935, 2019 | 15 | 2019 |
| A splitter theorem relative to a fixed basis N Brettell, C Semple Annals of Combinatorics 18, 1-20, 2014 | 14 | 2014 |
| Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth B Bergougnoux, É Bonnet, N Brettell, O Kwon arXiv preprint arXiv:2007.14179, 2020 | 11 | 2020 |
| Steiner trees for hereditary graph classes HL Bodlaender, N Brettell, M Johnson, G Paesani, D Paulusma, ... Latin American Symposium on Theoretical Informatics, 613-624, 2020 | 11* | 2020 |
| Solving problems on generalized convex graphs via mim-width F Bonomo-Braberman, N Brettell, A Munaro, D Paulusma Journal of Computer and System Sciences, 103493, 2023 | 10* | 2023 |
| Parameterized vertex deletion problems for hereditary graph classes with a block property É Bonnet, N Brettell, O Kwon, D Marx International Workshop on Graph-Theoretic Concepts in Computer Science, 233-244, 2016 | 10 | 2016 |
| Computing Subset Transversals in H-Free Graphs N Brettell, M Johnson, G Paesani, D Paulusma Graph-Theoretic Concepts in Computer Science: 46th International Workshop …, 2020 | 8 | 2020 |
| Terrain rendering using geometry clipmaps N Brettell Honours Project, University of Canterbury, 2005 | 8 | 2005 |
| Computing Weighted Subset Transversals in H-Free Graphs N Brettell, M Johnson, D Paulusma Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021 | 6 | 2021 |
| N-detachable pairs in 3-connected matroids I: unveiling X N Brettell, G Whittle, A Williams Journal of Combinatorial Theory, Series B 141, 295-342, 2020 | 6 | 2020 |
| The excluded minors for 2-and 3-regular matroids N Brettell, J Oxley, C Semple, G Whittle Journal of Combinatorial Theory, Series B 163, 133-218, 2023 | 5 | 2023 |
| N-detachable pairs in 3-connected matroids III: the theorem N Brettell, G Whittle, A Williams Journal of Combinatorial Theory, Series B 153, 223-290, 2022 | 5 | 2022 |
| Excluded minors are almost fragile N Brettell, B Clark, J Oxley, C Semple, G Whittle Journal of Combinatorial Theory, Series B 140, 263-322, 2020 | 5 | 2020 |
| Parameterized Streaming Algorithms for Min-Ones d-SAT A Agrawal, A Biswas, É Bonnet, N Brettell, R Curticapean, D Marx, ... 39th IARCS Annual Conference on Foundations of Software Technology and …, 2019 | 5 | 2019 |
| N-detachable pairs in 3-connected matroids II: life in X N Brettell, G Whittle, A Williams Journal of Combinatorial Theory, Series B 149, 222-271, 2020 | 4 | 2020 |
| On a generalization of spikes N Brettell, R Campbell, D Chun, K Grace, G Whittle SIAM Journal on Discrete Mathematics 33 (1), 358-372, 2019 | 4 | 2019 |
| Computing excluded minors for classes of matroids representable over partial fields N Brettell, R Pendavingh arXiv preprint arXiv:2302.13175, 2023 | 3 | 2023 |
Daniel PaulusmaDepartment of Computer Science, Durham UniversityVerified email at durham.ac.uk
