Solving partial dominating set and related problems using twin-width
From MaRDI portal
Cites work
- An efficient algorithm for finding a maximum weight k-independent set of trapezoid graphs
- An improved fixed-parameter algorithm for vertex cover
- Deciding first-order properties of locally tree-decomposable structures
- Deciding first-order properties of nowhere dense graphs
- Domination problems in nowhere-dense classes of graphs
- Evaluating restricted first-order counting properties on nowhere dense classes and beyond
- Exploiting c-closure in kernelization algorithms for graph problems
- First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!
- First-order model checking on monadically stable graph classes
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Fixed-parameter tractability, definability, and model-checking
- FPT approximation and subexponential algorithms for covering few or many edges
- Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
- scientific article; zbMATH DE number 1304341 (Why is no real title available?)
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 1979504 (Why is no real title available?)
- scientific article; zbMATH DE number 1508265 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- scientific article; zbMATH DE number 7788442 (Why is no real title available?)
- Improved upper bounds for vertex cover
- On efficient fixed-parameter algorithms for weighted vertex cover
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- Parameterized complexity of Vertex Cover variants
- Partial vs. Complete Domination: t-Dominating Set
- Refined memorization for vertex cover
- Solving a family of multivariate optimization and decision problems on classes of bounded expansion
- Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
- Sparsity. Graphs, structures, and algorithms
- 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
- Twin-width and types
- Twin-width. I: Tractable FO model checking
- Twin-width. III: Max independent set, min dominating set, and coloring
- Vertex cover: Further observations and further improvements
This page was built for publication: Solving partial dominating set and related problems using twin-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310172)
