{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T16:11:00Z","timestamp":1789056660532,"version":"build-2803163510"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Science Review"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.cosrev.2026.101036","type":"journal-article","created":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T09:22:47Z","timestamp":1784971367000},"page":"101036","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The future of parameterized complexity: Truly linear time FPT and the WQO hybrid hardware model"],"prefix":"10.1016","volume":"62","author":[{"given":"Michael","family":"Fellows","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frances","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cosrev.2026.101036_bib0005","series-title":"Dagstuhl Reports","first-page":"1","year":"2024"},{"key":"10.1016\/j.cosrev.2026.101036_bib0010","series-title":"Algorithms for Big Data - DFG Priority Program 1736. Ed. by Hannah Bast Et Al. Lecture Notes in Computer Science","first-page":"97","article-title":"Recent advances in practical data reduction","author":"Abu-Khzam","year":"2022"},{"key":"10.1016\/j.cosrev.2026.101036_bib0015","author":"Ajwani"},{"issue":"2","key":"10.1016\/j.cosrev.2026.101036_bib0020","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/992287.992296","article-title":"Quantum search algorithms","volume":"35","author":"Ambainis","year":"2004","journal-title":"ACM SIGACT News"},{"key":"10.1016\/j.cosrev.2026.101036_bib0025","author":"Ardeshir-Larijani"},{"key":"10.1016\/j.cosrev.2026.101036_bib0030","series-title":"18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, The Netherlands, September 6\u20138, 2023. Ed. by Neeldhara Misra and Magnus Wahlstr\u00f6m. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum F\u00fcr Informatik","first-page":"1:1","article-title":"Kernelizing temporal exploration problems","author":"Arrighi","year":"2023"},{"key":"10.1016\/j.cosrev.2026.101036_bib0035","series-title":"Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbr\u00fccken, Germany. Ed. by D\u00e1niel Marx and Peter Rossmanith. Lecture Notes in Computer Science","first-page":"194","article-title":"Linear-time computation of a linear problem kernel for dominating set on planar graphs","author":"van Bevern","year":"2011"},{"key":"10.1016\/j.cosrev.2026.101036_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2023.103479","article-title":"Serial and parallel kernelization of multiple hitting set parameterized by the dilworth number, implemented on the GPU","volume":"139","author":"van Bevern","year":"2024","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.cosrev.2026.101036_bib0045","series-title":"44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, August 26\u201330, 2019. Ed. by Peter Rossmanith et al. Vol.138. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum F\u00fcr Informatik","first-page":"54:1","article-title":"The complexity of homomorphism indistinguishability","author":"B\u00f6ker","year":"2019"},{"key":"10.1016\/j.cosrev.2026.101036_bib0050","author":"Bremner"},{"key":"10.1016\/j.cosrev.2026.101036_bib0055","series-title":"17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, T\u00f3rshavn, Faroe Islands, June 22\u201324, 2020. Ed. by Susanne Albers. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum F\u00fcr Informatik","first-page":"9:1","article-title":"Kernelizing the hitting set problem in linear sequential and constant parallel time","author":"Bannach","year":"2020"},{"key":"10.1016\/j.cosrev.2026.101036_bib0060","unstructured":"B. Bumpus, et al., Truly linear fixed parameter tractable: O(n) + f(k). Manuscript in preparation, 2026."},{"issue":"1","key":"10.1016\/j.cosrev.2026.101036_bib0065","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0168-0072(95)00020-8","article-title":"Advice classes of parameterized tractability","volume":"84","author":"Cai","year":"1997","journal-title":"Ann. Pure Appl. Log."},{"issue":"4","key":"10.1016\/j.cosrev.2026.101036_bib0070","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(95)00190-5","article-title":"A simple linear-time algorithm for finding path-decompositions of small width","volume":"57","author":"Cattell","year":"1996","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.cosrev.2026.101036_bib0075","series-title":"International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"257","article-title":"\u201cLinear kernels in linear time, or how to save k colors in O (n 2) steps\u201d","author":"Chor","year":"2004"},{"issue":"4","key":"10.1016\/j.cosrev.2026.101036_bib0080","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/s00224-010-9270-y","article-title":"Lower bounds for kernelizations and other preprocessing procedures","volume":"48","author":"Chen","year":"2011","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10.1016\/j.cosrev.2026.101036_bib0085","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/2744447.2744454","article-title":"Review of: fundamentals of parameterized complexity by fellows","volume":"46","author":"Chitnis","year":"2015","journal-title":"SIGACT News"},{"key":"10.1016\/j.cosrev.2026.101036_bib0090","series-title":"Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14\u201317, 2004, Proceedings. Ed. by Rodney G. Downey Et Al. Lecture Notes in Computer Science","first-page":"271","article-title":"Greedy localization, iterative compression, modeled crown reductions: new FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover\u201d","author":"Dehne","year":"2004"},{"key":"10.1016\/j.cosrev.2026.101036_bib0095","series-title":"Texts in Computer Science","article-title":"Fundamentals of parameterized complexity","author":"Downey","year":"2013"},{"key":"10.1016\/j.cosrev.2026.101036_bib0100","series-title":"The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. Ed. by Hans L. Bodlaender Et Al. Vol.7370. Lecture Notes in Computer Science","first-page":"17","article-title":"The birth and early years of parameterized complexity","author":"Downey","year":"2012"},{"key":"10.1016\/j.cosrev.2026.101036_bib0105","series-title":"Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8\u201310 July 2005, Durham, UK. Ed. by Hajo Broersma Et Al. Vol.4. Texts in Algorithmics","first-page":"1","article-title":"FPT is P-Time extremal structure I","author":"Estivill-Castro","year":"2005"},{"key":"10.1016\/j.cosrev.2026.101036_bib0110","series-title":"Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27\u201330, 2007, Proceedings. Ed. by Erzs\u00e9bet Csuhaj-Varj\u00fa and Zolt\u00e1n \u00c9sik. Lecture Notes in Computer Science","first-page":"312","article-title":"Efficient parameterized preprocessing for cluster editing","author":"Fellows","year":"2007"},{"issue":"1","key":"10.1016\/j.cosrev.2026.101036_bib0115","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00453-011-9545-y","article-title":"Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications","volume":"64","author":"Fellows","year":"2012","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.cosrev.2026.101036_bib0120","doi-asserted-by":"crossref","first-page":"16:1","DOI":"10.1145\/2635820","article-title":"FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders","volume":"6","author":"Fellows","year":"2014","journal-title":"ACM Trans. Comput. Theory"},{"key":"10.1016\/j.cosrev.2026.101036_bib0125","series-title":"Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24\u201328, 2015, Proceedings, Part II. Ed. by Giuseppe F. Italiano Et Al. Lecture Notes in Computer Science","first-page":"299","article-title":"A shortcut to (sun)flowers: kernels in logarithmic space or linear time","author":"Fafianie","year":"2015"},{"key":"10.1016\/j.cosrev.2026.101036_bib0130","series-title":"Kernelization: Theory of Parameterized Preprocessing","author":"Fomin","year":"2019"},{"key":"10.1016\/j.cosrev.2026.101036_bib0135","series-title":"Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. Ed. by Fedor V. Fomin Et Al. Vol. 12160. Lecture Notes in Computer Science","first-page":"7","article-title":"Collaborating with hans: some remaining wonderments","author":"Fellows","year":"2020"},{"key":"10.1016\/j.cosrev.2026.101036_bib0140","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","isbn-type":"print","author":"Garey","year":"1979","ISBN":"https:\/\/id.crossref.org\/isbn\/0716710455"},{"issue":"4","key":"10.1016\/j.cosrev.2026.101036_bib0145","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1137\/110842272","article-title":"Approximation algorithms for QMA-complete problems","volume":"41","author":"Gharibian","year":"2012","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.cosrev.2026.101036_bib0150","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1002\/net.20081","article-title":"Fixed-parameter tractability and data reduction for multicut in trees","volume":"46","author":"Guo","year":"2005","journal-title":"Networks"},{"issue":"8\u201310","key":"10.1016\/j.cosrev.2026.101036_bib0155","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","article-title":"A more effective linear kernelization for cluster editing","volume":"410","author":"Guo","year":"2009","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.cosrev.2026.101036_bib0160","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/3624713","article-title":"Fast parameterized preprocessing for polynomial-time solvable graph problems","volume":"67","author":"Himmel","year":"2024","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/j.cosrev.2026.101036_bib0165","first-page":"1.16:1","article-title":"Scalable kernelization for maximum independent sets","volume":"24","author":"Hespe","year":"2019","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"4","key":"10.1016\/j.cosrev.2026.101036_bib0170","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/j.cosrev.2026.101036_bib0175","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5\u20137, 2014. Ed. by Chandra Chekuri","first-page":"1749","article-title":"Linear-time FPT algorithms via network flow","author":"Iwata","year":"2014"},{"key":"10.1016\/j.cosrev.2026.101036_bib0180","series-title":"59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7\u20139, 2018. Ed. by Mikkel Thorup","first-page":"462","article-title":"0\/1\/All CSPs, half-integral A-Path packing, and linear-time FPT algorithms","author":"Iwata","year":"2018"},{"key":"10.1016\/j.cosrev.2026.101036_bib0185","doi-asserted-by":"crossref","DOI":"10.1038\/s41467-023-40533-1","article-title":"Toward a formal theory for computing machines made out of whatever physics offers","volume":"14","author":"Jaeger","year":"2023","journal-title":"Nat. Commun."},{"key":"10.1016\/j.cosrev.2026.101036_bib0190","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.dam.2015.04.028","article-title":"A linear-time kernelization for the rooted k-Leaf outbranching problem","volume":"193","author":"Kammer","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.cosrev.2026.101036_bib0195","series-title":"The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. Vol. 7370. Lecture Notes in Computer Science","first-page":"3","article-title":"Fixed-parameter tractability, a prehistory","author":"Langston","year":"2012"},{"key":"10.1016\/j.cosrev.2026.101036_bib0200","series-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","first-page":"224","article-title":"Lossy kernelization","author":"Lokshtanov","year":"2017"},{"key":"10.1016\/j.cosrev.2026.101036_bib0205","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.jctb.2025.11.002","article-title":"When recursion is better than iteration: a linear-time algorithm for directed acyclicity with few error vertices","volume":"177","author":"Lokshtanov","year":"2026","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"10.1016\/j.cosrev.2026.101036_bib0210","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","article-title":"Parameterized complexity and approximation algorithms","volume":"51","author":"Marx","year":"2008","journal-title":"Comput. J."},{"issue":"12","key":"10.1016\/j.cosrev.2026.101036_bib0215","doi-asserted-by":"crossref","first-page":"3521","DOI":"10.1007\/s00453-020-00736-0","article-title":"The power of linear-time data reduction for maximum matching","volume":"82","author":"Mertzios","year":"2020","journal-title":"Algorithmica"},{"key":"10.1016\/j.cosrev.2026.101036_bib0220","doi-asserted-by":"crossref","DOI":"10.1038\/npjqi.2015.23","article-title":"Quantum algorithms: an overview","volume":"2","author":"Montanaro","year":"2016","journal-title":"NPJ Quantum Inf."},{"key":"10.1016\/j.cosrev.2026.101036_bib0225","series-title":"Oxford Lecture Series in Mathematics and Its Applications","first-page":"31","article-title":"Invitation to fixed-parameter algorithms","author":"Niedermeier","year":"2006"},{"issue":"2","key":"10.1016\/j.cosrev.2026.101036_bib0230","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","article-title":"Graph minors. IV. tree-width and well-quasi-ordering","volume":"48","author":"Robertson","year":"1990","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/j.cosrev.2026.101036_bib0235","author":"Schuetz"},{"issue":"4","key":"10.1016\/j.cosrev.2026.101036_bib0240","article-title":"Resource analyses for parallel and distributed coordination","volume":"37","author":"Trinder","year":"2025","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"10.1016\/j.cosrev.2026.101036_bib0245","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s42484-024-00198-5","article-title":"Distributed hybrid quantum\u2013classical performance prediction for hyperparameter optimization","volume":"6","author":"Wulff","year":"2024","journal-title":"Quantum Mach. Intell."},{"issue":"1","key":"10.1016\/j.cosrev.2026.101036_bib0250","article-title":"The complexity of quantum circuit mapping with fixed parameters","volume":"21","author":"Zhu","year":"2022","journal-title":"Quantum Inf. Process."}],"container-title":["Computer Science Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013726001449?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013726001449?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T16:01:19Z","timestamp":1789056079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574013726001449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":50,"alternative-id":["S1574013726001449"],"URL":"https:\/\/doi.org\/10.1016\/j.cosrev.2026.101036","relation":{},"ISSN":["1574-0137"],"issn-type":[{"value":"1574-0137","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The future of parameterized complexity: Truly linear time FPT and the WQO hybrid hardware model","name":"articletitle","label":"Article Title"},{"value":"Computer Science Review","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cosrev.2026.101036","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"101036"}}