Skip to search formSkip to main contentSkip to account menu

Parameterized complexity

Known as: FPT (complexity class), Fixed-parameter tractability, W(2) 
In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
1-planar graph2-satisfiabilityAlgorithmic paradigmBarrier resilience

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Parameterized Complexity of the k-Biclique Problem
Given a graph G and an integer k, the k-Biclique problem asks whether G contains a complete bipartite subgraph with k vertices on… 
Highly Cited
2017
Highly Cited
2017
On the parameterized complexity of approximating dominating set
We study the parameterized complexity of approximating the k-Dominating Set (domset) problem where an integer k and a graph G on… 
Highly Cited
2012
Highly Cited
2012
Faster Parameterized Algorithms Using Linear Programming
We investigate the parameterized complexity of Vertex Cover parameterized by the difference between the size of the optimal… 
Review
2010
Review
2010
THE EFFECT OF HOST GALAXIES ON TYPE Ia SUPERNOVAE IN THE SDSS-II SUPERNOVA SURVEY
We present an analysis of the host galaxy dependences of Type Ia Supernovae (SNe Ia) from the full three year sample of the SDSS… 
Highly Cited
2009
Highly Cited
2009
On problems without polynomial kernels
Highly Cited
2007
Highly Cited
2007
Parameterized Complexity of Vertex Cover Variants
AbstractImportant variants of theVERTEX COVER problem (among others, CONNECTED VERTEX COVER, CAPACITATED VERTEX COVER, and… 
Highly Cited
2006
Highly Cited
2006
Strong computational lower bounds via parameterized complexity
Highly Cited
2002
Highly Cited
2002
The parameterized complexity of counting problems
  • J. FlumMartin Grohe
  • The 43rd Annual IEEE Symposium on Foundations of…
  • 2002
  • Corpus ID: 16585036
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of… 
Highly Cited
2002
Highly Cited
2002
Adaptive neural network control for a class of uncertain nonlinear systems in pure-feedback form
Review
2001
Review
2001
Functional performance testing following knee ligament injury
Abstract Outcome measurement in sports physiotherapy is directed at identifying an athlete's ability to tolerate the physical… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)