Dynamic parameterized problems
type: Item
instance of: scholarly article
title: Dynamic parameterized problems
zbMATH Open document ID: 1393.68074
author: R. Krithika
author: Abhishek Sahu
author: Prafullkumar Tale
published in: Algorithmica
publication date: 2018-07-26T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/6936/
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6911202
zbMATH Keywords: dynamic problems
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: kernelization
describes a project that uses: tw-heuristic
MaRDI profile type: Publication
OpenAlex ID: W3003329734
cites work: Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
cites work: On the parameterized complexity of dynamic problems
cites work: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
cites work: Q4252376
cites work: Feedback Vertex Set in Mixed Graphs
cites work: Q3128894
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: On Problems as Hard as CNF-SAT
cites work: Parameterized Algorithms
cites work: Vertex cover: Further observations and further improvements
cites work: Improved upper bounds for vertex cover
cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
cites work: Q5074183
cites work: Fundamentals of parameterized complexity
cites work: Q5315023
cites work: Incompressibility through Colors and IDs
cites work: Parametrized complexity theory.
cites work: Exact Algorithms via Monotone Local Search
cites work: On two techniques of combining branching and treewidth
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4634396
cites work: Incremental list coloring of graphs, parameterized by conservation
cites work: Faster deterministic \textsc{Feedback Vertex Set}
cites work: Parameterized complexity of finding subgraphs with hereditary properties.
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: FPT algorithms for connected feedback vertex set
cites work: A 4 k 2 kernel for feedback vertex set
DOI: 10.1007/S00453-017-0349-6
description: scientific article; zbMATH DE number 6911202