Incremental problems in the parameterized complexity setting

DOI10.1007/s00224-016-9729-6zbMath1362.68111OpenAlexW2557257643MaRDI QIDQ519883

Bernard Mans, Luke Mathieson

Publication date: 31 March 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-016-9729-6

zbMATH Keywords

tractabilityparameterized complexitykernelizationincremental computationalgorithm complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Introduction to reconfiguration

Cites Work

• Unnamed Item
• On the parameterised complexity of string morphism problems
• Parameterized complexity of MaxSat above average
• On the parameterized complexity of reconfiguration problems
• Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
• The parameterized complexity of editing graphs for bounded degeneracy
• Complexity models for incremental computation
• On the computational complexity of dynamic graph problems
• Applying modular decomposition to parameterized cluster editing problems
• Fast algorithms for determining (generalized) core groups in social networks
• Parameterized complexity of Vertex Cover variants
• Parametrized complexity theory.
• Dynamic complexity theory revisited
• Optimal Decremental Connectivity in Planar Graphs.

This page was built for publication: Incremental problems in the parameterized complexity setting