Department of
Applied
Mathematics

Some New Developments and Open Problems in Parametrized Algorithms and Complexity

Mike Fellows

University of Newcastle, Australia

Abstract

The talk will review some of the main ideas of parametrized algorithms and complexity, mentioning some of the "most wanted" concrete open problems. New directions of research in this area will be discussed, including generalized crown rules and kernelization, new methods in proofs of parametrized intractability, and FPT approaches to speeding up local search heuristics for hard problems.