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):
Displaying 50 items.
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- 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)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← 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)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← 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)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Online dominating set (Q1741855) (← links)
- Fast minor testing in planar graphs (Q1759679) (← 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)
- Exact algorithms for edge domination (Q1945174) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
- A generic convolution algorithm for join operations on tree decompositions (Q2117110) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- A fixed-parameter algorithm for guarding 1.5D terrains (Q2354771) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
