The following pages link to (Q2721971):
Displaying 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)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- (Q4257107) (← links)
- Reachability problems in interval-constrained and cardinality-constrained graphs (Q6132865) (← links)
