Parameterized complexity: the main ideas and connections to practical computing
type: Item
instance of: scholarly article
zbMATH Open document ID: 1268.68083
DOI: 10.1016/S1571-0661(04)00301-9
author: Michael R. Fellows
published in: Electronic Notes in Theoretical Computer Science
publication date: 2013-07-24T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6190949
Wikidata QID: Q57360058
describes a project that uses: GRAPPA
MaRDI profile type: Publication
cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
cites work: Q4535799
cites work: Faster exact algorithms for hard problems: A parameterized point of view
cites work: Parameterized complexity of vertex colouring
cites work: Computation Models for Parameterized Complexity
cites work: Q4535023
cites work: Q4944990
cites work: Q4012216
cites work: A linear-time algorithm for computing the intersection of all odd cycles in a graph
cites work: On the efficiency of polynomial time approximation schemes
cites work: Q4393480
cites work: Q4503944
cites work: Q4263467
cites work: Q4217593
cites work: Solving large FPT problems on coarse-grained parallel machines
cites work: Q4736854
cites work: Q4472448
cites work: Q4198056
cites work: Kernels in planar digraphs
cites work: Q2762493
cites work: Q4955325
cites work: The complexity of type inference for higher-order typed lambda calculi
cites work: Q4228486
cites work: Q2766822
cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut
cites work: Q4542518
cites work: On the complexity of database queries
cites work: Computing large and small stable models
full work available at URL: s1571-0661(04)00301-9
OpenAlex ID: W2913688336
title: Parameterized complexity: the main ideas and connections to practical computing
description: scientific article; zbMATH DE number 6190949