On miniaturized problems in parameterized complexity theory
type: Item
instance of: scholarly article
title: On miniaturized problems in parameterized complexity theory
zbMATH Open document ID: 1087.68034
author: Yijia Chen
author: Jörg Flum
published in: Theoretical Computer Science
publication date: 2006-04-06T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5017470
zbMATH Keywords: parameterized complexity
zbMATH Keywords: subexponential algorithms
zbMATH Keywords: Fagin-definability
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.10.003
OpenAlex ID: W2165019867
cites work: Q4535023
cites work: Linear FPT reductions and computational lower bounds
cites work: Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
cites work: Q4503944
cites work: Algorithms and Data Structures
cites work: Fixed-parameter tractability, definability, and model-checking
cites work: Q3396009
cites work: Automata, Languages and Programming
cites work: On the complexity of \(k\)-SAT
cites work: Which problems have strongly exponential complexity?
cites work: Vertex packings: Structural properties and algorithms
DOI: 10.1016/J.TCS.2005.10.003
description: scientific article; zbMATH DE number 5017470