The following pages link to (Q4708588):
Displayed 13 items.
- A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- New upper bounds on the decomposability of planar graphs (Q3376690) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)