Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) General topics in the theory of algorithms (68W01)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The kernelization complexity of connected domination in graphs with (no) small cycles
Implicit branching and parameterized partial cover problems
Fixed-parameter tractability and completeness II: On completeness for W[1]
FPT algorithms for connected feedback vertex set
Kernelization hardness of connectivity problems in $d$-degenerate graphs
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
Short cycles make $W$-hard problems hard: FPT algorithms for $W$-hard problems in graphs with no short cycles
Computing small partial coverings
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
A method in graph theory
Weighted efficient domination problem on some perfect graphs
Perfect Code is $W[1$-complete]
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
Detecting and enumerating small induced subgraphs in $c$-closed graphs
Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
The maximum vertex coverage problem on bipartite graphs
Parameterized complexity of Vertex Cover variants
A refined search tree technique for dominating set on planar graphs
Domination Problems in Nowhere-Dense Classes
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
Linear Kernel for Planar Connected Dominating Set
Nondeterminism within $P^ * $
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems
Finding Cliques in Social Networks: A New Distribution-Free Model
Parameterized Complexity for Domination Problems on Degenerate Graphs
Perfect domination and small cycles
Bidimensionality and Geometric Graphs
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Partial vs. Complete Domination: t-Dominating Set
Intuitive Algorithms and t-Vertex Cover
Parameterized Algorithms
Exploiting c-Closure in Kernelization Algorithms for Graph Problems
On cliques in graphs
Essentially tight kernels for (weakly) closed graphs

This page was built for publication: Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems