Nick Brettell

According to our database, Nick Brettell authored at least 31 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Solving problems on generalized convex graphs via mim-width.

Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma

J. Comput. Syst. Sci., March, 2024

2023

Excluded minors are almost fragile II: Essential elements.

Nick Brettell, James G. Oxley, Charles Semple, Geoff Whittle

J. Comb. Theory, Ser. B, November, 2023

The excluded minors for 2- and 3-regular matroids.

Nick Brettell, James G. Oxley, Charles Semple, Geoff Whittle

J. Comb. Theory, Ser. B, November, 2023

Generalized spikes with circuits and cocircuits of different cardinalities.

Nick Brettell, Kevin Grace

Adv. Appl. Math., October, 2023

Cyclic Matroids.

Nick Brettell, Charles Semple, Gerry Toft

SIAM J. Discret. Math., June, 2023

Comparing Width Parameters on Graph Classes.

Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang

CoRR, 2023

Computing Subset Vertex Covers in H-Free Graphs.

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Computing subset transversals in <i>H</i>-free graphs.

Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Theor. Comput. Sci., 2022

Bounding the mim-width of hereditary graph classes.

Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma

J. Graph Theory, 2022

<i>N</i>-detachable pairs in 3-connected matroids III: The theorem.

Nick Brettell, Geoff Whittle, Alan Williams

J. Comb. Theory, Ser. B, 2022

Computing Weighted Subset Odd Cycle Transversals in <i>H</i>-free graphs.

Nick Brettell, Matthew Johnson, Daniël Paulusma

J. Comput. Syst. Sci., 2022

List <i>k</i>-colouring <i>P</i>_<i>t</i>-free graphs: A Mim-width perspective.

Nick Brettell, Jake Horsfield, Andrea Munaro, Daniël Paulusma

Inf. Process. Lett., 2022

2021

Steiner trees for hereditary graph classes: A treewidth perspective.

Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen

Theor. Comput. Sci., 2021

<i>N</i>-detachable pairs in 3-connected matroids II: Life in <i>X</i>.

Nick Brettell, Geoff Whittle, Alan Williams

J. Comb. Theory, Ser. B, 2021

Computing Weighted Subset Transversals in H-Free Graphs.

Nick Brettell, Matthew Johnson, Daniël Paulusma

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020

<i>N</i>-detachable pairs in 3-connected matroids I: Unveiling <i>X</i>.

Nick Brettell, Geoff Whittle, Alan Williams

J. Comb. Theory, Ser. B, 2020

Excluded minors are almost fragile.

Nick Brettell, Ben Clark, James G. Oxley, Charles Semple, Geoff Whittle

J. Comb. Theory, Ser. B, 2020

Solving problems on generalized convex graphs via mim-width.

Nick Brettell, Andrea Munaro, Daniël Paulusma

CoRR, 2020

List k-Colouring P_t-Free Graphs with No Induced 1-Subdivision of K_{1, s}: a Mim-width Perspective.

Nick Brettell, Andrea Munaro, Daniël Paulusma

CoRR, 2020

Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective.

Nick Brettell, Jake Horsfield, Daniël Paulusma

CoRR, 2020

Computing Subset Transversals in H-Free Graphs.

Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Steiner Trees for Hereditary Graph Classes.

Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth.

Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

On a Generalization of Spikes.

Nick Brettell, Rutger Campbell, Deborah Chun, Kevin Grace, Geoff Whittle

SIAM J. Discret. Math., 2019

Matroids with a cyclic arrangement of circuits and cocircuits.

Nick Brettell, Deborah Chun, Tara Fife, Charles Semple

Eur. J. Comb., 2019

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

Algorithmica, 2019

Parameterized Streaming Algorithms for Min-Ones d-SAT.

Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Orienting edges to fight fire in graphs.

Julien Bensmail, Nick Brettell

Australas. J Comb., 2018

2017

Coloring Graphs with Constraints on Connectivity.

Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon

J. Graph Theory, 2017

2016

Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property.

Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015

Colouring graphs with constraints on connectivity.

Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon

CoRR, 2015