{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:00Z","timestamp":1759638180753,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174926"},{"type":"electronic","value":"9783642174933"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17493-3_13","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T08:41:01Z","timestamp":1291365661000},"page":"123-134","source":"Crossref","is-referenced-by-count":2,"title":["Parameterizing by the Number of Numbers"],"prefix":"10.1007","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","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","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. of Scheduling\u00a01, 55\u201366 (1998)","journal-title":"J. of Scheduling"},{"issue":"45","key":"13_CR2","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0410(45), 4554\u20134570 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-68880-8_13","volume-title":"Algorithmic Aspects in Information and Management","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., Xu, J. (eds.) AAIM 2008. LNCS, vol.\u00a05034, pp. 120\u2013130. Springer, Heidelberg (2008)"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","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.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoret. Comput. Sci.\u00a0410(1), 53\u201361 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","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.\u00a045(4), 822\u2013848 (2009)","journal-title":"Theory Comput. Syst."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"13_CR7","series-title":"LNCS","first-page":"221","volume-title":"TAMC","author":"J. Fiala","year":"2009","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. In: TAMC. LNCS, vol.\u00a05532, pp. 221\u2013230. Springer, Heidelberg (2009)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Gaspers, S., Liedloff, M., Stein, M.J., Suchan, K.: Complexity of splits reconstruction for low-degree trees. CoRR, abs\/1007.1733 (2010), Available on arXiv.org","DOI":"10.1007\/978-3-642-25870-1_16"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","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\u00a037(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","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.\u00a012(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-02441-2_19","volume-title":"Combinatorial Pattern Matching","author":"C. Komusiewicz","year":"2009","unstructured":"Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Deconstructing intractability: A case study for interval constrained coloring. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 207\u2013220. Springer, Heidelberg (2009)"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","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.\u00a08(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"13_CR13","doi-asserted-by":"publisher","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 System Technical Journal\u00a034(5), 1045\u20131079 (1955)","journal-title":"Bell System Technical Journal"},{"key":"13_CR14","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1093\/acprof:oso\/9780198566076.003.0005","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: The Art of Problem Parameterization. In: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, \u00a0ch. 5, pp. 41\u201349. Oxford University Press, Oxford (2006)"},{"key":"13_CR15","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"publisher","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)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17493-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:38:52Z","timestamp":1559835532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17493-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174926","9783642174933"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17493-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}