Dynamic Parameterized Problems and Algorithms

DOI10.4230/LIPIcs.ICALP.2017.41zbMath1441.68103arXiv1707.00362OpenAlexW2962799767MaRDI QIDQ5111372

Matthias Mnich, Josh Alman, Virginia Vassilevska Williams

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1707.00362

zbMATH Keywords

dynamic algorithmsfixed-parameter algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (7)

Multistage vertex cover ⋮ Reoptimization of parameterized problems ⋮ How fast can we play Tetris greedily with rectangular pieces? ⋮ Parameterized Dynamic Variants of Red-Blue Dominating Set ⋮ Dynamic data structures for timed automata acceptance ⋮ Dynamic kernels for hitting sets and set packing ⋮ Linear-time parameterized algorithms with limited local resources

This page was built for publication: Dynamic Parameterized Problems and Algorithms