Dynamic parameterized problems
From MaRDI portal
Recommendations
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 1003266 (Why is no real title available?)
- scientific article; zbMATH DE number 1305487 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Dynamic dominating set and turbo-charging greedy heuristics
- FPT algorithms for connected feedback vertex set
- Faster deterministic \textsc{Feedback Vertex Set}
- Feedback vertex set in mixed graphs
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fundamentals of parameterized complexity
- Graph-Theoretic Concepts in Computer Science
- Improved upper bounds for vertex cover
- Incompressibility through Colors and IDs
- Incremental list coloring of graphs, parameterized by conservation
- On problems as hard as CNF-SAT
- On the parameterized complexity of dynamic problems
- On two techniques of combining branching and treewidth
- Parameterized algorithms
- Parameterized complexity of finding subgraphs with hereditary properties.
- Parametrized complexity theory.
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The node-deletion problem for hereditary properties is NP-complete
- Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
- Turbocharging treewidth heuristics
- Vertex cover: Further observations and further improvements
Cited in
(19)- Multistage graph problems on a global budget
- Dynamic Parameterized Problems
- Computing parameters of sequence-based dynamic graphs
- Parametric continuity in dynamic programming problems
- Dynamic Parameterized Problems and Algorithms
- Parameterized Dynamic Cluster Editing
- A generic framework for computing parameters of sequence-based dynamic graphs
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming.
- On the parameterized complexity of dynamic problems with connectivity constraints
- On the parameterized complexity of dynamic problems
- Parameterized dynamic cluster editing
- Dynamic min-max problems
- Dominating sets and connected dominating sets in dynamic graphs
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
- Multistage vertex cover
- Reoptimization of parameterized problems
- Fast dynamic graph algorithms for parameterized problems
- Incremental problems in the parameterized complexity setting
- Dynamic parameterized problems and algorithms
This page was built for publication: Dynamic parameterized problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722546)
