{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:13Z","timestamp":1725744913596},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_55","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"647-658","source":"Crossref","is-referenced-by-count":5,"title":["On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Kratsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Kratsch, S.: On polynomial kernels for integer linear programs: Covering, packing and feasibility. CoRR abs\/1302.3496 (2013)","DOI":"10.1007\/978-3-642-40450-4_55"},{"issue":"1","key":"55_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10479-005-3968-2","volume":"140","author":"A. Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk, A., Savelsbergh, M.W.P.: Integer-programming software systems. Annals OR\u00a0140(1), 67\u2013124 (2005)","journal-title":"Annals OR"},{"issue":"5","key":"55_CR3","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1137\/060668092","volume":"39","author":"D. Harnik","year":"2010","unstructured":"Harnik, D., Naor, M.: On the compressibility of \n                  \n                    \n                  \n                  $\\mathcal{NP}$\n                 instances and cryptographic applications. SIAM J. Comput.\u00a039(5), 1667\u20131713 (2010)","journal-title":"SIAM J. Comput."},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1998)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: Kernelization \u2013 preprocessing with a guarantee. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) Fellows Festschrift. LNCS, vol.\u00a07370, pp. 129\u2013161. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-30891-8_10"},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci.\u00a075, 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"55_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci.\u00a077(1), 91\u2013106 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"55_CR8","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. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"55_CR9","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. Mathematics of Operations Research\u00a012(3), 415\u2013440 (1987)","journal-title":"Mathematics of Operations Research"},{"key":"55_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and ids. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 378\u2013389. Springer, Heidelberg (2009)"},{"key":"55_CR11","unstructured":"Hermelin, D., Kratsch, S., Soltys, K., Wahlstr\u00f6m, M., Wu, X.: Hierarchies of inefficient kernelizability. CoRR abs\/1110.0976 (2011)"},{"key":"55_CR12","unstructured":"Kratsch, S.: On polynomial kernels for sparse integer linear programs. In: Portier, N., Wilke, T. (eds.) STACS. LIPIcs, vol.\u00a020, pp. 80\u201391. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"issue":"1&2","key":"55_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theor. Comput. Sci.\u00a0141(1&2), 109\u2013131 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"55_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00224-012-9393-4","volume":"53","author":"B.M.P. Jansen","year":"2013","unstructured":"Jansen, B.M.P., Bodlaender, H.L.: Vertex cover kernelization revisited - upper and lower bounds for a refined parameter. Theory Comput. Syst.\u00a053(2), 263\u2013299 (2013)","journal-title":"Theory Comput. Syst."},{"key":"55_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/978-3-642-32589-2_62","volume-title":"Mathematical Foundations of Computer Science 2012","author":"J. Nederlof","year":"2012","unstructured":"Nederlof, J., van Leeuwen, E.J., van der Zwaan, R.: Reducing a target interval to a few exact queries. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 718\u2013727. Springer, Heidelberg (2012)"},{"key":"55_CR16","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9.: Fast approximation algorithms for fractional packing and covering problems. In: FOCS, pp. 495\u2013504 (1991)"},{"key":"55_CR17","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer (2006)"},{"issue":"7","key":"55_CR18","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"F.N. Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci.\u00a076(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"55_CR19","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: A new technique for kernelization lower bounds. In: Schwentick, T., D\u00fcrr, C. (eds.) STACS. LIPIcs, vol.\u00a09, pp. 165\u2013176 (2011)"},{"key":"55_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Rado, R.: Intersection theorems for systems of sets. J. London Math. Soc.\u00a035, 85\u201390 (1960)","journal-title":"J. London Math. Soc."},{"issue":"35","key":"55_CR21","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci.\u00a0412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:53:46Z","timestamp":1558025626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}