Nick Brettell

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 41

Top Topics

Top Venues

J. Comb. Theory, Ser. B

J. Comput. Syst. Sci.

Publications

Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma
Solving problems on generalized convex graphs via mim-width. J. Comput. Syst. Sci. 140 (2024)
Nick Brettell, James G. Oxley, Charles Semple, Geoff Whittle
Excluded minors are almost fragile II: Essential elements. J. Comb. Theory, Ser. B 163 (2023)
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Computing Subset Vertex Covers in H-Free Graphs. FCT (2023)
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Computing Subset Vertex Covers in H-Free Graphs. CoRR (2023)
Nick Brettell, Kevin Grace
Generalized spikes with circuits and cocircuits of different cardinalities. Adv. Appl. Math. 151 (2023)
Nick Brettell, James G. Oxley, Charles Semple, Geoff Whittle
The excluded minors for 2- and 3-regular matroids. J. Comb. Theory, Ser. B 163 (2023)
Nick Brettell, Charles Semple, Gerry Toft
Cyclic Matroids. SIAM J. Discret. Math. 37 (2) (2023)
Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang
Comparing Width Parameters on Graph Classes. CoRR (2023)
Nick Brettell, Matthew Johnson, Daniël Paulusma
-free graphs. J. Comput. Syst. Sci. 128 (2022)
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
-free graphs. Theor. Comput. Sci. 902 (2022)
Nick Brettell, Geoff Whittle, Alan Williams
-detachable pairs in 3-connected matroids III: The theorem. J. Comb. Theory, Ser. B 153 (2022)
Nick Brettell, Jake Horsfield, Andrea Munaro, Daniël Paulusma
-free graphs: A Mim-width perspective. Inf. Process. Lett. 173 (2022)
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
Bounding the mim-width of hereditary graph classes. J. Graph Theory 99 (1) (2022)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. 867 (2021)
Nick Brettell, Geoff Whittle, Alan Williams
. J. Comb. Theory, Ser. B 149 (2021)
Nick Brettell, Matthew Johnson, Daniël Paulusma
Computing Weighted Subset Transversals in H-Free Graphs. WADS (2021)
Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma
Solving Problems on Generalized Convex Graphs via Mim-Width. WADS (2021)
Nick Brettell, Andrea Munaro, Daniël Paulusma
: a Mim-width Perspective. CoRR (2020)
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
Computing Subset Transversals in H-Free Graphs. WG (2020)
Nick Brettell, Geoff Whittle, Alan Williams
. J. Comb. Theory, Ser. B 141 (2020)
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. IPEC (2020)
Nick Brettell, Ben Clark, James G. Oxley, Charles Semple, Geoff Whittle
Excluded minors are almost fragile. J. Comb. Theory, Ser. B 140 (2020)
Nick Brettell, Matthew Johnson, Daniël Paulusma
Computing Weighted Subset Transversals in H-Free Graphs. CoRR (2020)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR (2020)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner Trees for Hereditary Graph Classes. LATIN (2020)
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
Computing Subset Transversals in H-Free Graphs. CoRR (2020)
Nick Brettell, Andrea Munaro, Daniël Paulusma
Solving problems on generalized convex graphs via mim-width. CoRR (2020)
Nick Brettell, Jake Horsfield, Daniël Paulusma
Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective. CoRR (2020)
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
Bounding the Mim-Width of Hereditary Graph Classes. CoRR (2020)
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth. CoRR (2020)
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
Bounding the Mim-Width of Hereditary Graph Classes. IPEC (2020)
Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS (2019)
Nick Brettell, Rutger Campbell, Deborah Chun, Kevin Grace, Geoff Whittle
On a Generalization of Spikes. SIAM J. Discret. Math. 33 (1) (2019)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. Algorithmica 81 (10) (2019)
Nick Brettell, Deborah Chun, Tara Fife, Charles Semple
Matroids with a cyclic arrangement of circuits and cocircuits. Eur. J. Comb. 81 (2019)
Julien Bensmail, Nick Brettell
Orienting edges to fight fire in graphs. Australas. J Comb. 71 (2018)
Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
Coloring Graphs with Constraints on Connectivity. J. Graph Theory 85 (4) (2017)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. CoRR (2017)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. IPEC (2017)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Parameterized vertex deletion problems for hereditary graph classes with a block property. CoRR (2016)
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. WG (2016)
Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
Colouring graphs with constraints on connectivity. CoRR (2015)
Julien Bensmail, Nick Brettell
Orienting edges to fight fire in graphs. CoRR (2015)