Nick Brettell

Publications

• (with S. Jowett, J. Oxley, C. Semple, and G. Whittle) What is a 4-connected matroid?
  Submitted.
• (with A. Munaro, D. Paulusma, and S. Yang) Comparing width parameters on graph classes.
  Submitted.
• The excluded minors for GF(5)-representable matroids on ten elements.
  Submitted [code].
• (with R. Pendavingh) Computing excluded minors for classes of matroids representable over partial fields.
  Submitted [code].
  
• (with J. J. Oostveen, S. Pandey, D. Paulusma, and E. J. van Leeuwen) Computing subset vertex covers in H-free graphs.
  Proceedings of FCT 2023. LNCS 14292, 88-102 [doi].
  
• (with J. Oxley, C. Semple, and G. Whittle) The excluded minors for 2- and 3-regular matroids.
  Journal of Combinatorial Theory, Series B 163 (2023) 133-218 [doi].
  
• (with J. Oxley, C. Semple, and G. Whittle) Excluded minors are almost fragile II: essential elements.
  Journal of Combinatorial Theory, Series B 163 (2023) 272-307 [doi].
  
• (with K. Grace) Generalized spikes with circuits and cocircuits of different cardinalities.
  Advances in Applied Mathematics 151 (2023), 102578 [doi].
  
• (with C. Semple and G. Toft) Cyclic matroids.
  SIAM Journal on Discrete Mathematics 37 (2023), 1212-1236 [doi].
  
• (with F. Bonomo-Braberman, A. Munaro and D. Paulusma) Solving problems on generalized convex graphs via mim-width.
  Proceedings of WADS 2021. LNCS 12808, 200-214 [doi].
  Journal of Computer and System Sciences 140 (2024), 103493 [doi].
• (with M. Johnson and D. Paulusma) Computing weighted subset odd cycle transversals in H-free graphs.
  Proceedings of WADS 2021. LNCS 12808, 229-242 [doi].
  Journal of Computer and System Sciences 128 (2022), 71-85 [doi].
• (with B. Bergougnoux, É. Bonnet, and O. Kwon) Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth.
  Proceedings of IPEC 2020. LIPIcs 180, 3:1-3:17 [doi].
  
• (with J. Horsfield, A. Munaro, and D. Paulusma) List k-colouring P_t-free graphs: a mim-width perspective.
  Information Processing Letters 173 (2022), 106168 [doi].
  
• (with A. Munaro, G. Paesani, and D. Paulusma) Bounding the mim-width of hereditary graph classes.
  Proceedings of IPEC 2020. LIPIcs 180, 6:1-6:18 [doi].
  Journal of Graph Theory 99 (2022), 117-151 [doi].
• (with M. Johnson, G. Paesani, and D. Paulusma) Computing subset transversals in H-free graphs.
  Proceedings of WG 2020. LNCS 12301, 187-199 [doi].
  Theoretical Computer Science 902 (2022), 76-92 [doi].
  
• (with H. L. Bodlaender, M. Johnson, G. Paesani, D. Paulusma, and E. J. van Leeuwen) Steiner trees for hereditary graph classes.
  Proceedings of LATIN 2020. LNCS 12118, 613-624 [doi].
  Theoretical Computer Science 867 (2021), 30-39 [doi].
  
• (with A. Agrawal, A. Biswas, É. Bonnet, R. Curticapean, D. Marx, T. Miltzow, V. Raman, and S. Saurabh) Parameterized streaming algorithms for Min-Ones-d-SAT.
  Proceedings of FSTTCS 2019. LIPIcs 150, 8:1-8:20 [doi]
  
• (with B. Clark, J. Oxley, C. Semple, and G. Whittle) Excluded minors are almost fragile.
  Journal of Combinatorial Theory, Series B 140 (2020), 263-322 [doi].
  
• (with D. Chun, T. Fife, and C. Semple) Matroids with a cyclic arrangement of circuits and cocircuits.
  European Journal of Combinatorics 81 (2019), 195-209 [doi].
  
• (with R. Campbell, D. Chun, K. Grace, and G. Whittle) On a generalization of spikes.
  SIAM Journal on Discrete Mathematics 33 (2019), 358-372 [doi].
  
• (with G. Whittle and A. Williams) N-detachable pairs in 3-connected matroids III: the theorem.
  Journal of Combinatorial Theory, Series B 153 (2022), 223-290 [doi].
• (with G. Whittle and A. Williams) N-detachable pairs in 3-connected matroids II: life in X.
  Journal of Combinatorial Theory, Series B 149 (2021), 222-271 [doi].
  
• (with G. Whittle and A. Williams) N-detachable pairs in 3-connected matroids I: unveiling X.
  Journal of Combinatorial Theory, Series B 141 (2020), 295-342 [doi].
  
• (with É. Bonnet, O. Kwon, and D. Marx) Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms.
  Proceedings of IPEC 2017. LIPIcs 89, 7:1-7:13 [doi].
  Algorithmica 81 (2019), 3890-3935 [doi].
  
• (with É. Bonnet, O. Kwon, and D. Marx) Parameterized vertex deletion problems for hereditary graph classes with a block property.
  Proceedings of WG 2016. LNCS 9941, 233-244 [doi].
  
• (with J. Bensmail) Orienting edges to fight fire in graphs.
  Australasian Journal of Combinatorics 71 (2018), 21-42 [link].
• (with P. Aboulker, F. Havet, D. Marx, and N. Trotignon) Coloring graphs with constraints on connectivity.
  Journal of Graph Theory 85 (2017), 814-838 [doi].
• (with C. Semple) An algorithm for constructing a k-tree for a k-connected matroid.
  Annals of Combinatorics 19 (2015), 29-78 [doi].
• (with C. Semple) A Splitter Theorem relative to a fixed basis.
  Annals of Combinatorics 18 (2014), 1-20 [doi].

Unpublished

• Aspects of Matroid Connectivity.
  Ph.D. Thesis (2014), University of Canterbury.
• The Tutte Polynomial.
  Honours Project (2010), University of Canterbury.

See also

•  https://orcid.org/0000-0002-1136-418X
• Articles on arXiv
• Google Scholar
• Semantic Scholar
• dblp
• zbMATH