default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNick Brettell
Person information
- affiliation: Victoria University of Wellington, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Nick Brettell, Rudi Pendavingh:
Computing Excluded Minors for Classes of Matroids Representable over Partial Fields. Electron. J. Comb. 31(3) (2024)- [j19]Flavia Bonomo-Braberman, Nick Brettell
, Andrea Munaro, Daniël Paulusma:
Solving problems on generalized convex graphs via mim-width. J. Comput. Syst. Sci. 140: 103493 (2024) - 2023
- [j18]Nick Brettell, Kevin Grace:
Generalized spikes with circuits and cocircuits of different cardinalities. Adv. Appl. Math. 151: 102578 (2023) - [j17]Nick Brettell, James G. Oxley, Charles Semple, Geoff Whittle:
The excluded minors for 2- and 3-regular matroids. J. Comb. Theory B 163: 133-218 (2023) - [j16]Nick Brettell, James G. Oxley, Charles Semple, Geoff Whittle:
Excluded minors are almost fragile II: Essential elements. J. Comb. Theory B 163: 272-307 (2023) - [j15]Nick Brettell, Charles Semple, Gerry Toft:
Cyclic Matroids. SIAM J. Discret. Math. 37(2): 1212-1236 (2023) - [c10]Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Computing Subset Vertex Covers in H-Free Graphs. FCT 2023: 88-102 - [i14]Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Computing Subset Vertex Covers in H-Free Graphs. CoRR abs/2307.05701 (2023) - [i13]Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang:
Comparing Width Parameters on Graph Classes. CoRR abs/2308.05817 (2023) - 2022
- [j14]Nick Brettell, Jake Horsfield, Andrea Munaro, Daniël Paulusma:
List k-colouring Pt-free graphs: A Mim-width perspective. Inf. Process. Lett. 173: 106168 (2022) - [j13]Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Odd Cycle Transversals in H-free graphs. J. Comput. Syst. Sci. 128: 71-85 (2022) - [j12]Nick Brettell, Geoff Whittle, Alan Williams:
N-detachable pairs in 3-connected matroids III: The theorem. J. Comb. Theory B 153: 223-290 (2022) - [j11]Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma:
Bounding the mim-width of hereditary graph classes. J. Graph Theory 99(1): 117-151 (2022) - [j10]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing subset transversals in H-free graphs. Theor. Comput. Sci. 902: 76-92 (2022) - 2021
- [j9]Nick Brettell, Geoff Whittle, Alan Williams:
N-detachable pairs in 3-connected matroids II: Life in X. J. Comb. Theory B 149: 222-271 (2021) - [j8]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: 30-39 (2021) - [c9]Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving Problems on Generalized Convex Graphs via Mim-Width. WADS 2021: 200-214 - [c8]Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. WADS 2021: 229-242 - 2020
- [j7]Nick Brettell, Ben Clark, James G. Oxley, Charles Semple, Geoff Whittle:
Excluded minors are almost fragile. J. Comb. Theory, Ser. B 140: 263-322 (2020) - [j6]Nick Brettell, Geoff Whittle, Alan Williams:
N-detachable pairs in 3-connected matroids I: Unveiling X. J. Comb. Theory B 141: 295-342 (2020) - [c7]Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon:
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. IPEC 2020: 3:1-3:17 - [c6]Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma:
Bounding the Mim-Width of Hereditary Graph Classes. IPEC 2020: 6:1-6:18 - [c5]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes. LATIN 2020: 613-624 - [c4]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing Subset Transversals in H-Free Graphs. WG 2020: 187-199 - [i12]Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma:
Bounding the Mim-Width of Hereditary Graph Classes. CoRR abs/2004.05018 (2020) - [i11]Nick Brettell, Jake Horsfield, Daniël Paulusma:
Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective. CoRR abs/2004.05022 (2020) - [i10]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 abs/2004.07492 (2020) - [i9]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing Subset Transversals in H-Free Graphs. CoRR abs/2005.13938 (2020) - [i8]Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon:
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth. CoRR abs/2007.14179 (2020) - [i7]Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. CoRR abs/2007.14514 (2020) - [i6]Nick Brettell, Andrea Munaro, Daniël Paulusma:
List k-Colouring Pt-Free Graphs with No Induced 1-Subdivision of K1, s: a Mim-width Perspective. CoRR abs/2008.01590 (2020) - [i5]Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving problems on generalized convex graphs via mim-width. CoRR abs/2008.09004 (2020)
2010 – 2019
- 2019
- [j5]É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): 3890-3935 (2019) - [j4]Nick Brettell, Deborah Chun, Tara Fife, Charles Semple:
Matroids with a cyclic arrangement of circuits and cocircuits. Eur. J. Comb. 81: 195-209 (2019) - [j3]Nick Brettell, Rutger Campbell, Deborah Chun, Kevin Grace, Geoff Whittle:
On a Generalization of Spikes. SIAM J. Discret. Math. 33(1): 358-372 (2019) - [c3]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: 8:1-8:20 - 2018
- [j2]Julien Bensmail, Nick Brettell:
Orienting edges to fight fire in graphs. Australas. J Comb. 71: 12-42 (2018) - 2017
- [j1]Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
Coloring Graphs with Constraints on Connectivity. J. Graph Theory 85(4): 814-838 (2017) - [c2]É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: 7:1-7:13 - [i4]É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 abs/1704.06757 (2017) - 2016
- [c1]Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. WG 2016: 233-244 - [i3]Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Parameterized vertex deletion problems for hereditary graph classes with a block property. CoRR abs/1603.05945 (2016) - 2015
- [i2]Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
Colouring graphs with constraints on connectivity. CoRR abs/1505.01616 (2015) - [i1]Julien Bensmail, Nick Brettell:
Orienting edges to fight fire in graphs. CoRR abs/1506.07338 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 23:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
