scientific article; zbMATH DE number 1956210

MaRDI QIDQ4417671zbMATH OpenFDO

Authors Michael R. Fellows

Publication date 29 July 2003

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Parameterized complexity: the main ideas and connections to practical computing
• scientific article; zbMATH DE number 2080999
• Algorithms and Data Structures
• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 806748

Cited in

(25)

• Efficiency in exponential time for domination-type problems
• The Turing way to parameterized complexity
• Sources of complexity in subset choice
• Parametrized complexity: New developments and research frontiers
• Parameterized complexity: the main ideas and connections to practical computing
• A parameterized complexity tutorial
• The birth and early years of parameterized complexity
• The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
• Parameterized complexity and subexponential-time computability
• Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
• Fundamentals of parameterized complexity
• scientific article; zbMATH DE number 1341905 (Why is no real title available?)
• Computation Models for Parameterized Complexity
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 2080999 (Why is no real title available?)
• Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms
• Confronting intractability via parameters
• scientific article; zbMATH DE number 806748 (Why is no real title available?)
• Parameterized Algorithms
• Mathematical Foundations of Computer Science 2004
• Algorithms and Data Structures
• Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
• The complexity ecology of parameters: An illustration using bounded max leaf number
• Moving policies in cyclic assembly line scheduling
• A parameterized perspective on packing paths of length two

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 Q4417671)