Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity

DOI10.1016/j.ejc.2012.04.008zbMath1448.68465WikidataQ57359649 ScholiaQ57359649MaRDI QIDQ1933639

Michael R. Fellows, Frances A. Rosamond, Bart M. P. Jansen

Publication date: 24 January 2013

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.04.008

zbMATH Keywords

polynomial kernels; FPT-algorithms; parameter ecology program

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)

68W01: General topics in the theory of algorithms

68Q27: Parameterized complexity, tractability and kernelization