Pages that link to "Item:Q2908540"
From MaRDI portal
The following pages link to Graph Minors and Parameterized Algorithm Design (Q2908540):
Displaying 15 items.
- Compactors for parameterized counting problems (Q826317) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Dynamic Programming for H-minor-free Graphs (Q2914314) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- (Q5005146) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- (Q5391139) (← links)
- A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (Q5408591) (← links)
- A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory– (Q5741738) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- Elimination distance to bounded degree on planar graphs preprint (Q6593702) (← links)