Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
From MaRDI portal
Publication:6071818
Recommendations
Cites work
- A method in graph theory
- A refined search tree technique for dominating set on planar graphs
- Bidimensionality and kernels
- Computing small partial coverings
- Connectivity is not a limit for kernelization: planar connected dominating set
- Detecting and enumerating small induced subgraphs in c-closed graphs
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Domination problems in nowhere-dense classes of graphs
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Essentially tight kernels for (weakly) closed graphs
- Exploiting c-closure in kernelization algorithms for graph problems
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Finding cliques in social networks: a new distribution-free model
- Finding cliques in social networks: a new distribution-free model
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- FPT algorithms for connected feedback vertex set
- Graph theory
- scientific article; zbMATH DE number 91051 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1929955 (Why is no real title available?)
- scientific article; zbMATH DE number 7765378 (Why is no real title available?)
- Implicit branching and parameterized partial cover problems
- Intuitive Algorithms and t-Vertex Cover
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs
- Kernels for (connected) dominating set on graphs with excluded topological minors
- Linear Kernel for Planar Connected Dominating Set
- Linear Problem Kernels for NP-Hard Problems on Planar Graphs
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Nondeterminism within $P^ * $
- On cliques in graphs
- Parameterized algorithms
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- Parameterized complexity of Vertex Cover variants
- Partial vs. Complete Domination: t-Dominating Set
- Perfect Code is \(W[1]\)-complete
- Perfect domination and small cycles
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- Polynomial kernels for \textsc{Dominating Set} in graphs of bounded degeneracy and beyond
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- The dominating set problem is fixed parameter tractable for graphs of bounded genus
- The kernelization complexity of connected domination in graphs with (no) small cycles
- The maximum vertex coverage problem on bipartite graphs
- Weighted efficient domination problem on some perfect graphs
Cited in
(3)
This page was built for publication: Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6071818)
