Parameterized Complexity

DOI10.1016/S1571-0661(04)00301-9zbMath1268.68083OpenAlexW2913688336WikidataQ57360058 ScholiaQ57360058MaRDI QIDQ2841253

Michael R. Fellows

Publication date: 24 July 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)00301-9

Mathematics Subject Classification ID

Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Uses Software

• GRAPPA

Cites Work

• On the efficiency of polynomial time approximation schemes
• A linear-time algorithm for computing the intersection of all odd cycles in a graph
• On the complexity of database queries
• Parameterized complexity of vertex colouring
• Solving large FPT problems on coarse-grained parallel machines
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
• Kernels in planar digraphs
• Parameterizing above Guaranteed Values: MaxSat and MaxCut
• Computation Models for Parameterized Complexity
• Computing large and small stable models
• The complexity of type inference for higher-order typed lambda calculi
• Faster exact algorithms for hard problems: A parameterized point of view
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parameterized Complexity