{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T06:01:59Z","timestamp":1768888919330,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,10,29]],"date-time":"2011-10-29T00:00:00Z","timestamp":1319846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s00224-011-9367-y","type":"journal-article","created":{"date-parts":[[2011,10,28]],"date-time":"2011-10-28T09:05:36Z","timestamp":1319792736000},"page":"675-693","source":"Crossref","is-referenced-by-count":20,"title":["Parameterizing by the Number of Numbers"],"prefix":"10.1007","volume":"50","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[]},{"given":"Serge","family":"Gaspers","sequence":"additional","affiliation":[]},{"given":"Frances A.","family":"Rosamond","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,29]]},"reference":[{"key":"9367_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1, 55\u201366 (1998)","journal-title":"J. Sched."},{"key":"9367_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-88757-9","volume-title":"Algebraic Cryptanalysis","author":"G.V. Bard","year":"2009","unstructured":"Bard, G.V.: Algebraic Cryptanalysis. Springer, Berlin (2009)"},{"key":"9367_CR3","unstructured":"Bazgan, C.: Sch\u00e9mas d\u2019approximation et complexit\u00e9 param\u00e9tr\u00e9e. Master\u2019s thesis, Universit\u00e9 Paris Sud (1995)"},{"issue":"45","key":"9367_CR4","doi-asserted-by":"crossref","first-page":"4554","DOI":"10.1016\/j.tcs.2009.08.033","volume":"410","author":"N. Betzler","year":"2009","unstructured":"Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410(45), 4554\u20134570 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9367_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/978-3-540-68880-8_13","volume-title":"AAIM 2008","author":"M. Chrobak","year":"2008","unstructured":"Chrobak, M., D\u00fcrr, C., Hurand, M., Robert, J.: Algorithms for temperature-aware task scheduling in microprocessor systems. In: Fleischer, R., Jinhui, X. (eds.) AAIM 2008. Lecture Notes in Computer Science, vol. 5034, pp. 120\u2013130. Springer, Berlin (2008)"},{"key":"9367_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"9367_CR7","series-title":"Lecture Notes in Computer Science","first-page":"123","volume-title":"IPEC 2010","author":"M.R. Fellows","year":"2010","unstructured":"Fellows, M.R., Gaspers, S., Rosamond, F.A.: Parameterizing by the number of numbers. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. Lecture Notes in Computer Science, vol. 6478, pp. 123\u2013134. Springer, Berlin (2010)"},{"issue":"1","key":"9367_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9367_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-56686-4_38","volume-title":"AAECC 1993","author":"M.R. Fellows","year":"1993","unstructured":"Fellows, M.R., Koblitz, N.: Fixed-parameter complexity and cryptography. In: Cohen, G.D., Mora, T., Moreno, O. (eds.) AAECC 1993. Lecture Notes in Computer Science, vol. 673, pp. 121\u2013131. Springer, Berlin (1993)"},{"issue":"4","key":"9367_CR10","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1007\/s00224-009-9167-9","volume":"45","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F.A., Saurabh, S.: The complexity ecology of parameters: An illustration using bounded max leaf number. Theory Comput. Syst. 45(4), 822\u2013848 (2009)","journal-title":"Theory Comput. Syst."},{"key":"9367_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"ISAAC 2008","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, E.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. Lecture Notes in Computer Science, vol. 5369, pp. 294\u2013305. Springer, Berlin (2008)"},{"issue":"23","key":"9367_CR12","doi-asserted-by":"crossref","first-page":"2513","DOI":"10.1016\/j.tcs.2010.10.043","volume":"412","author":"J. Fiala","year":"2011","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412(23), 2513\u20132523 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9367_CR13","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, vol.\u00a0XIV. Springer, Berlin (2006)"},{"issue":"1","key":"9367_CR14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"9367_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-642-25870-1_16","volume-title":"WG 2011","author":"S. Gaspers","year":"2011","unstructured":"Gaspers, S., Liedloff, M., Stein, M.J., Suchan, K.: Complexity of splits reconstruction for low-degree trees. In: Kratochv\u00edl, J. (ed.) WG 2011. Lecture Notes in Computer Science, vol. 6986 pp.\u00a0167\u2013178. Springer, Berlin (2011)"},{"issue":"1","key":"9367_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"issue":"3","key":"9367_CR17","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"9367_CR18","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading (1973)"},{"issue":"1","key":"9367_CR19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jda.2010.07.003","volume":"9","author":"C. Komusiewicz","year":"2011","unstructured":"Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Deconstructing intractability\u2014a multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9(1), 137\u2013151 (2011)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"9367_CR20","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"9367_CR21","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"G.H. Mealy","year":"1955","unstructured":"Mealy, G.H.: A method for synthesizing sequential circuits. Bell Syst. Tech. J. 34(5), 1045\u20131079 (1955)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"9367_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0205001","volume":"5","author":"I. Munro","year":"1976","unstructured":"Munro, I., Spira, P.M.: Sorting and searching in multisets. SIAM J. Comput. 5(1), 1\u20138 (1976)","journal-title":"SIAM J. Comput."},{"key":"9367_CR23","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"key":"9367_CR24","series-title":"LIPIcs","first-page":"17","volume-title":"STACS 2010","author":"R. Niedermeier","year":"2010","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Marion, J.-Y., Schwentick, T. (eds.) STACS 2010. LIPIcs, vol. 5, pp. 17\u201332. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik, Dagstuhl (2010)"},{"issue":"4","key":"9367_CR25","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"issue":"4","key":"9367_CR26","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K. Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"9367_CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3007.001.0001","volume-title":"Finite-state language processing","author":"E. Roche","year":"1997","unstructured":"Roche, E., Schabes, Y.: Finite-state language processing. The MIT Press, Cambridge (1997)"},{"key":"9367_CR28","volume-title":"Models of Computation\u2014Exploring the Power of Computing","author":"J.E. Savage","year":"1998","unstructured":"Savage, J.E.: Models of Computation\u2014Exploring the Power of Computing. Addison-Wesley, Reading (1998)"},{"key":"9367_CR29","first-page":"194","volume":"6","author":"S. Sen","year":"1999","unstructured":"Sen, S., Gupta, N.: Distribution-sensitive algorithms. Nord. J. Comput. 6, 194\u2013211 (1999)","journal-title":"Nord. J. Comput."},{"key":"9367_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0577-7","volume-title":"Mathematical Control Theory: Deterministic Finite Dimensional Systems","author":"E. Sontag","year":"1998","unstructured":"Sontag, E.: Mathematical Control Theory: Deterministic Finite Dimensional Systems, 2nd edn. Springer, Berlin (1998)","edition":"2"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9367-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9367-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9367-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,26]],"date-time":"2020-06-26T17:36:31Z","timestamp":1593192991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9367-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,29]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9367"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9367-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,29]]}}}