On the parameterized complexity of dynamic problems
DOI10.1016/J.TCS.2015.06.053zbMATH Open1333.68130OpenAlexW815725825MaRDI QIDQ896122FDOQ896122
Authors: N. E. Zubov 
Publication date: 11 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.053
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Dynamic vehicle routing: Status and prospects
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Title not available (Why is that?)
- Incremental list coloring of graphs, parameterized by conservation
- Title not available (Why is that?)
- An exact algorithm for connected red-blue dominating set
- Dynamic dominating set and turbo-charging greedy heuristics
- Reoptimization of Steiner trees: changing the terminal set
- A theory and algorithms for combinatorial reoptimization
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Monads for incremental computing
Cited In (15)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
- Parameterized Complexity of DPLL Search Procedures
- Dynamic Parameterized Problems
- Multistage graph problems on a global budget
- Parameterized Dynamic Cluster Editing
- Dynamic parameterized problems
- On the parameterized complexity of dynamic problems with connectivity constraints
- Parameterized dynamic variants of red-blue dominating set
- Parameterized dynamic cluster editing
- Multistage vertex cover
- A theory and algorithms for combinatorial reoptimization
- Reoptimization of parameterized problems
- Fast dynamic graph algorithms for parameterized problems
- Dynamic dominating set and turbo-charging greedy heuristics
- Dynamic parameterized problems and algorithms
This page was built for publication: On the parameterized complexity of dynamic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896122)
