Pages that link to "Item:Q1849745"
From MaRDI portal
The following pages link to Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs (Q1849745):
Displayed 30 items.
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← 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)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Tree Decompositions of Graphs: Saving Memory in Dynamic Programming (Q3439128) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)