Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
DOI10.1016/j.ejc.2012.04.008zbMath1448.68465OpenAlexW2137012936WikidataQ57359649 ScholiaQ57359649MaRDI QIDQ1933639
Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond
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
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) General topics in the theory of algorithms (68W01) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (54)
This page was built for publication: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity