Pages that link to "Item:Q958211"
From MaRDI portal
The following pages link to Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211):
Displayed 6 items.
- On the small cycle transversal of planar graphs (Q551170) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- On the Small Cycle Transversal of Planar Graphs (Q3057617) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- Parameterized Algorithms for Generalized Domination (Q5505650) (← links)
