Dynamic Parameterized Problems
From MaRDI portal
Recommendations
- Dynamic parameterized problems
- Dynamic Parameterized Problems and Algorithms
- Dynamic parameterized problems and algorithms
- On the parameterized complexity of dynamic problems
- scientific article; zbMATH DE number 7650849
- Parametric continuity in dynamic programming problems
- Parametric continuity in dynamic programming problems
- Fast dynamic graph algorithms for parameterized problems
- scientific article; zbMATH DE number 6160040
Cited in
(11)- Dynamic min-max problems
- A generic framework for computing parameters of sequence-based dynamic graphs
- On the parameterized complexity of dynamic problems with connectivity constraints
- Fast dynamic graph algorithms for parameterized problems
- Dominating sets and connected dominating sets in dynamic graphs
- The set cover conjecture and subgraph isomorphism with a tree pattern
- Dynamic parameterized problems and algorithms
- Dynamic Parameterized Problems and Algorithms
- Parametric continuity in dynamic programming problems
- Dynamic parameterized problems
- On the parameterized complexity of dynamic problems
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 Q4634402)