The following pages link to Nick Brettell (Q404381):
Displaying 31 items.
- A splitter theorem relative to a fixed basis (Q404382) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Computing weighted subset transversals in \(H\)-free graphs (Q832863) (← links)
- Steiner trees for hereditary graph classes (Q2081657) (← links)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Excluded minors are almost fragile (Q2284732) (← links)
- Matroids with a cyclic arrangement of circuits and cocircuits (Q2323095) (← links)
- An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid (Q2343464) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property (Q3181061) (← links)
- (Q4616090) (← links)
- On a Generalization of Spikes (Q4625215) (← links)
- Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
- (Q5111866) (← links)
- (Q5875640) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918592) (← links)
- The excluded minors for 2- and 3-regular matroids (Q6051051) (← links)
- Excluded minors are almost fragile. II: Essential elements (Q6051055) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Generalized spikes with circuits and cocircuits of different cardinalities (Q6094850) (← links)
- Cyclic Matroids (Q6161258) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Computing Weighted Subset Transversals in $H$-Free Graphs (Q6346052) (← links)
- Computing excluded minors for classes of matroids representable over partial fields (Q6614174) (← links)
- Flexipaths in matroids (Q6729916) (← links)
- Detachable pairs in $3$-connected matroids and simple $3$-connected graphs (Q6745386) (← links)
- Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms (Q6762959) (← links)
