Subtopic Deep Dive
Parameterized Complexity
Research Guide
What is Parameterized Complexity?
Parameterized complexity analyzes the complexity of NP-hard graph problems with respect to small parameters like treewidth or solution size, classifying them as fixed-parameter tractable (FPT) or W[1]-hard.
Researchers develop FPT algorithms using techniques like bounded search trees, color coding, and dynamic programming on tree decompositions. Key results include kernelization theorems and dichotomy classifications for graph problems (Bodlaender et al., 2009, 564 citations; Grohe, 2007, 429 citations). Over 10 papers from the list exceed 200 citations, spanning 1981-2011.
Why It Matters
Parameterized complexity enables efficient algorithms for graph problems when parameters like treewidth are small, applied in bioinformatics for RNA folding and in network design for feedback vertex set (Chen et al., 2008, 291 citations). It classifies problems via dichotomies, guiding algorithm design for constraint satisfaction (Grohe, 2007). Kernelization reduces instances to polynomial size, practical for VLSI design and phylogenetic tree reconstruction (Bodlaender et al., 2009).
Key Research Challenges
Proving W[1]-hardness
Establishing W[1]-hardness requires non-constructive reductions, often using group-labeled graphs or disjoint union gadgets (Chen et al., 2006, 258 citations). These proofs resist FPT algorithms, complicating progress on problems like homomorphism (Grohe, 2007). Over 50 graph problems lack full classifications.
Kernelization lower bounds
Distinguishing polynomial kernels from subexponential reductions uses composition frameworks (Bodlaender et al., 2009, 564 citations). Many problems admit no polynomial kernels unless coNP ⊆ NP/Poly. This limits preprocessing for FPT solvers.
Single exponential FPT
Achieving 2^{O(tw)} time for MSO properties on treewidth-tw graphs requires advanced dynamic programming (Cygan et al., 2011, 231 citations). Reducing constants in exponents demands new techniques like representative sets. Gap remains for directed graphs.
Essential Papers
The NP-Completeness of Edge-Coloring
Ian Holyer · 1981 · SIAM Journal on Computing · 1.1K citations
Previous article Next article The NP-Completeness of Edge-ColoringIan HolyerIan Holyerhttps://doi.org/10.1137/0210055PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail Secti...
On problems without polynomial kernels
Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows et al. · 2009 · Journal of Computer and System Sciences · 564 citations
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Martin Grohe · 2007 · Journal of the ACM · 429 citations
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure in a homomorphism. ...
On the parameterized complexity of multiple-interval graph problems
Michael R. Fellows, Danny Hermelin, Frances Rosamond et al. · 2008 · Theoretical Computer Science · 325 citations
Parameterizing above Guaranteed Values: MaxSat and MaxCut
Meena Mahajan, Venkatesh Raman · 1999 · Journal of Algorithms · 308 citations
A fixed-parameter algorithm for the directed feedback vertex set problem
Jianer Chen, Yang Liu, Songjian Lu et al. · 2008 · Journal of the ACM · 291 citations
The (parameterized) FEEDBACK VERTEX SET problem on directed graphs (i.e., the DFVS problem) is defined as follows: given a directed graph G and a parameter k , either construct a feedback vertex se...
Strong computational lower bounds via parameterized complexity
Jianer Chen, Xiuzhen Huang, Iyad Kanj et al. · 2006 · Journal of Computer and System Sciences · 258 citations
Reading Guide
Foundational Papers
Start with Holyer (1981) for NP-completeness baseline (1114 citations); Bodlaender et al. (2009) for kernel theorems (564 citations); Grohe (2007) for dichotomy framework (429 citations). These establish hardness and classification foundations.
Recent Advances
Cygan et al. (2011) for single-exponential treewidth algorithms (231 citations); Fellows et al. (2008) for interval graph tractability (325 citations); Chen et al. (2008) for directed FVS (291 citations).
Core Methods
Dynamic programming on tree decompositions; color coding for subset problems; representative families for matroids; bidimensionality theory for minors.
How PapersFlow Helps You Research Parameterized Complexity
Discover & Search
Research Agent uses citationGraph on Holyer (1981, 1114 citations) to find kernelization papers like Bodlaender et al. (2009); exaSearch queries 'treewidth parameterized algorithms FPT' retrieves Cygan et al. (2011); findSimilarPapers expands from Grohe (2007) to homomorphism dichotomies.
Analyze & Verify
Analysis Agent runs readPaperContent on Chen et al. (2008) to extract DFVS algorithm; verifyResponse with CoVe checks FPT claims against Holyer (1981); runPythonAnalysis simulates treewidth DP with NetworkX, GRADE scores kernel bounds from Bodlaender et al. (2009).
Synthesize & Write
Synthesis Agent detects gaps in W-hierarchy for counting problems (Flum and Grohe, 2004); Writing Agent uses latexEditText for algorithm pseudocode, latexSyncCitations for 10+ papers, latexCompile for theorem proofs, exportMermaid diagrams treewidth decompositions.
Use Cases
"Implement Python prototype of directed feedback vertex set FPT algorithm from Chen 2008"
Research Agent → searchPapers('DFVS FPT Chen') → Analysis Agent → readPaperContent(Chen et al. 2008) → runPythonAnalysis(NetworkX DP simulation) → researcher gets runnable kernel + 2^{O(k)} solver code.
"Write LaTeX survey on kernelization dichotomies for interval graphs"
Research Agent → citationGraph(Fellows et al. 2008) → Synthesis → gap detection → Writing Agent → latexEditText(intro) → latexSyncCitations(5 papers) → latexCompile → researcher gets PDF with theorems and bibliography.
"Find GitHub code for treewidth parameterized connectivity solvers"
Code Discovery → paperExtractUrls(Cygan et al. 2011) → paperFindGithubRepo → githubRepoInspect → researcher gets 3 repos with single-exponential DP implementations and benchmarks.
Automated Workflows
Deep Research scans 50+ papers via searchPapers('parameterized graph treewidth'), structures FPT/kernelization/W-hard report with GRADE verification. DeepScan applies 7-step CoVe to validate Grohe (2007) dichotomy claims. Theorizer generates hypotheses for above-guarantee parameterization from Mahajan and Raman (1999).
Frequently Asked Questions
What defines fixed-parameter tractable (FPT)?
FPT means solvable in f(k)·n^{O(1)} time for parameter k. Examples include vertex cover (2^k·n) and DFVS (Chen et al., 2008). Contrasts with XP (n^{f(k)}).
What are main kernelization methods?
Crown reduction for vertex cover; LP relaxation for feedback set. Bodlaender et al. (2009) prove no poly kernels for some via OR-composition.
Which papers establish key hardness?
Holyer (1981) shows edge-coloring NP-complete (1114 citations). Chen et al. (2006) give W[1]-hardness via parameterized reductions (258 citations). Grohe (2007) classifies homomorphisms.
What are open problems?
Polynomial kernels for subset feedback vertex set. FPT for Steiner tree above guarantee (Mahajan and Raman, 1999). Dichotomies for directed graph MSO.
Research Advanced Graph Theory Research with AI
PapersFlow provides specialized AI tools for Computer Science researchers. Here are the most relevant for this topic:
AI Literature Review
Automate paper discovery and synthesis across 474M+ papers
Code & Data Discovery
Find datasets, code repositories, and computational tools
Deep Research Reports
Multi-source evidence synthesis with counter-evidence
AI Academic Writing
Write research papers with AI assistance and LaTeX support
See how researchers in Computer Science & AI use PapersFlow
Field-specific workflows, example queries, and use cases.
Start Researching Parameterized Complexity with AI
Search 474M+ papers, run AI-powered literature reviews, and write with integrated citations — all in one workspace.
See how PapersFlow works for Computer Science researchers
Part of the Advanced Graph Theory Research Research Guide