Pages that link to "Item:Q1575945"
From MaRDI portal
The following pages link to On computing graph minor obstruction sets (Q1575945):
Displaying 15 items.
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q777436) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- Properties of vertex cover obstructions (Q2455575) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Collaborating with Hans: Some Remaining Wonderments (Q5042446) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q6621238) (← links)
