{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:47:16Z","timestamp":1725983236795},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319944173"},{"type":"electronic","value":"9783319944180"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94418-0_19","type":"book-chapter","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T12:38:26Z","timestamp":1530707906000},"page":"183-193","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Kernelization Lower Bounds for Finding Constant-Size Subgraphs"],"prefix":"10.1007","author":[{"given":"Till","family":"Fluschnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George B.","family":"Mertzios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"key":"19_CR1","first-page":"1681","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Amir Abboud","year":"2014","unstructured":"Abboud, A., Grandoni, F., Williams, V.V.: Subcubic equivalences between graph centrality problems, APSP and diameter. In: Proceedings of 26th SODA, pp. 1681\u20131697. SIAM (2015)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V.V.: Popular conjectures imply strong lower bounds for dynamic problems. In: Proceedings of 55th FOCS, pp. 434\u2013443. IEEE Computer Society (2014)","DOI":"10.1109\/FOCS.2014.53"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V.V., Wang, J.R.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of 27th SODA, pp. 377\u2013391. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch28"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V.V., Yu, H.: Matching triangles and basing hardness on an extremely popular conjecture. In: Proceedings of 47th STOC, pp. 41\u201350. ACM (2015)","DOI":"10.1145\/2746539.2746594"},{"issue":"8","key":"19_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. System Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28(1), 277\u2013305 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Bringmann, K.: Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails. In: Proceedings of 55th FOCS, pp. 661\u2013670 (2014)","DOI":"10.1109\/FOCS.2014.76"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00224-010-9270-y","volume":"48","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Flum, J., M\u00fcller, M.: Lower bounds for kernelizations and other preprocessing procedures. Theory Comput. Syst. 48(4), 803\u2013839 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"19_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"19_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"G Theory","year":"2017","unstructured":"Theory, G.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"19_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"19_CR13","unstructured":"Fernau, H., Fluschnik, T., Hermelin, D., Krebs, A., Molter, H., Niedermeier, R.: Diminishable parameterized problems and strict polynomial kernelization (2016). CoRR abs\/1611.03739"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-319-62127-2_34","volume-title":"Algorithms and Data Structures","author":"T Fluschnik","year":"2017","unstructured":"Fluschnik, T., Komusiewicz, C., Mertzios, G.B., Nichterlein, A., Niedermeier, R., Talmon, N.: When can graph hyperbolicity be computed in linear time? Algorithms and Data Structures. LNCS, vol. 10389, pp. 397\u2013408. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_34"},{"key":"19_CR15","unstructured":"Fluschnik, T., Mertzios, G.B., Nichterlein, A.: Kernelization lower bounds for finding constant size subgraphs. CoRR abs\/1710.07601 (2017). http:\/\/arxiv.org\/abs\/1710.07601"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Pilipczuk, M., Saurabh, S., Wrochna, M.: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. In: Proceedings of 28th SODA, pp. 1419\u20131432 (2017)","DOI":"10.1137\/1.9781611974782.92"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Saurabh, S.: Kernelization methods for fixed-parameter tractability. In: Tractability: Practical Approaches to Hard Problems, pp. 260\u2013282. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781139177801.010"},{"issue":"1","key":"19_CR18","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. System Sci. 77(1), 91\u2013106 (2011)","journal-title":"J. Comput. System Sci."},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A Gajentaan","year":"1995","unstructured":"Gajentaan, A., Overmars, M.H.: On a class of $${O(n^2)}$$ problems in computational geometry. Comput. Geom. 5, 165\u2013185 (1995)","journal-title":"Comput. Geom."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2017.05.017","volume":"689","author":"AC Giannopoulou","year":"2017","unstructured":"Giannopoulou, A.C., Mertzios, G.B., Niedermeier, R.: Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs. Theor. Comput. Sci. 689, 67\u201395 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"issue":"2","key":"19_CR22","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"19_CR23","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR24","unstructured":"Iwata, Y.: Linear-time kernelization for feedback vertex set. In: Proceedings of 44th ICALP. LIPIcs, vol. 80, pp. 68:1\u201368:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-32589-2_2","volume-title":"Mathematical Foundations of Computer Science 2012","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Niedermeier, R.: New races in parameterized algorithmics. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 19\u201330. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_2"},{"key":"19_CR26","first-page":"58","volume":"113","author":"S Kratsch","year":"2014","unstructured":"Kratsch, S.: Recent developments in kernelization: a survey. Bulletin of EATCS 113, 58\u201397 (2014)","journal-title":"Bulletin of EATCS"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-30891-8_10","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"D Lokshtanov","year":"2012","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.) The Multivariate Algorithmic Revolution and Beyond. LNCS, vol. 7370, pp. 129\u2013161. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30891-8_10"},{"issue":"3","key":"19_CR28","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"key":"19_CR29","unstructured":"Mertzios, G.B., Nichterlein, A., Niedermeier, R.: The power of data reduction for matching. In: Proceedings of 42nd MFCS. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017, to appear)"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Williams, V.V., Williams, R.: Subcubic equivalences between path, matrix and triangle problems. In: Proceedings of 51st FOCS, pp. 645\u2013654. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.67"},{"key":"19_CR31","unstructured":"Weihe, K.: Covering trains by stations or the power of data reduction. In: Proceedings of 1st ALEX No publisher, pp. 1\u20138 (1998)"}],"container-title":["Lecture Notes in Computer Science","Sailing Routes in the World of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94418-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T06:16:18Z","timestamp":1571552178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94418-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319944173","9783319944180"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94418-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}