scientific article; zbMATH DE number 2080999

MaRDI QIDQ4474097zbMATH OpenFDO

Authors Michael R. Fellows

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230291.htm

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Parameterized complexity: the main ideas and connections to practical computing
• scientific article; zbMATH DE number 1956210
• Parametrized complexity: New developments and research frontiers
• Developments in Language Theory
• Fundamentals of parameterized complexity
• Parameterized computation and complexity: a new approach dealing with NP-hardness
• scientific article; zbMATH DE number 1507224
• What's next? Future directions in parameterized complexity
• A basic parameterized complexity primer

Cited in

(26)

• Polynomial time approximation schemes and parameterized complexity
• Developments in Language Theory
• Towards fully multivariate algorithmics: some new results and directions in parameter ecology
• Graph separators: A parameterized view
• What's next? Future directions in parameterized complexity
• The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
• The birth and early years of parameterized complexity
• A parameterized complexity tutorial
• A basic parameterized complexity primer
• Parametrized complexity: New developments and research frontiers
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms
• A fixed-parameter algorithm for minimum quartet inconsistency
• Algorithms and Data Structures
• Parameterized complexity: the main ideas and connections to practical computing
• Computing the similarity of two sequences with nested arc annotations
• Sources of complexity in subset choice
• What Is Known About Vertex Cover Kernelization?
• Confronting intractability via parameters
• Parameterized computation and complexity: a new approach dealing with NP-hardness
• Fundamentals of parameterized complexity
• Parameterized complexity and subexponential-time computability
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
• scientific article; zbMATH DE number 1956210 (Why is no real title available?)
• Fixed-parameter tractability, a prehistory
• FPT Suspects and Tough Customers: Open Problems of Downey and Fellows

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474097)