{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:33Z","timestamp":1725851973991},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_7","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T04:09:41Z","timestamp":1458533381000},"page":"82-95","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems"],"prefix":"10.1007","author":[{"given":"N. R.","family":"Aravind","sequence":"first","affiliation":[]},{"given":"R. B.","family":"Sandeep","sequence":"additional","affiliation":[]},{"given":"Naveen","family":"Sivadasan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"47\u201349","key":"7_CR1","doi-asserted-by":"publisher","first-page":"4920","DOI":"10.1016\/j.tcs.2009.07.002","volume":"410","author":"N Alon","year":"2009","unstructured":"Alon, N., Stav, U.: Hardness of edge-modification problems. Theor. Comput. Sci. 410(47\u201349), 4920\u20134927 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-319-26626-8_31","volume-title":"Combinatorial Optimization and Applications","author":"NR Aravind","year":"2015","unstructured":"Aravind, N.R., Sandeep, R.B., Sivadasan, N.: Parameterized lower bound and NP-completeness of some H-free edge deletion problems. In: Lu, Z., et al. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 424\u2013438. Springer, Heidelberg (2015). doi:\n 10.1007\/978-3-319-26626-8_31"},{"issue":"1\u20133","key":"7_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s00453-014-9937-x","volume":"71","author":"L Cai","year":"2015","unstructured":"Cai, L., Cai, Y.: Incompressibility of H-free edge modification problems. Algorithmica 71(3), 731\u2013757 (2015)","journal-title":"Algorithmica"},{"key":"7_CR6","unstructured":"Yufei, C.: Polynomial kernelisation of H-free edge modification problems. M.phil thesis, Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China (2012)"},{"key":"7_CR7","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., Saurabh, S.: Parameterized Algorithms. Springer, Heidelberg (2015)"},{"key":"7_CR8","unstructured":"Drange, P.G.: Parameterized Graph Modification Algorithms. PhD dissertation, University of Bergen (2015)"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/31.1748","volume":"35","author":"ES El-Mallah","year":"1988","unstructured":"El-Mallah, E.S., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Trans. Circuits Syst. 35(3), 354\u2013362 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.disopt.2010.09.006","volume":"8","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graph-based data clustering with overlaps. Discrete Optim. 8(1), 2\u201317 (2011)","journal-title":"Discrete Optim."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"W Paul","year":"1995","unstructured":"Paul, W., Goldberg, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2(1), 139\u2013152 (1995)","journal-title":"J. Comput. Biol."},{"issue":"15","key":"7_CR12","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discrete Appl. Math. 160(15), 2259\u20132270 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.disopt.2013.02.001","volume":"10","author":"S Kratsch","year":"2013","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Two edge modification problems without polynomial kernels. Discrete Optim. 10(3), 193\u2013199 (2013)","journal-title":"Discrete Optim."},{"key":"7_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50018-0","volume-title":"A Graph-theoretic Study of the Numerical Solution of Sparse Positive Definite Systems of Linear Equations","author":"DJ Rose","year":"1972","unstructured":"Rose, D.J.: A Graph-theoretic Study of the Numerical Solution of Sparse Positive Definite Systems of Linear Equations. Academic Press, Cambridge (1972). pp. 183\u2013217"},{"key":"7_CR15","unstructured":"Sandeep, R.B., Sivadasan, N.: Parameterized lower bound and improved Kernel for diamond-free edge deletion. In: Husfeldt, T., Kanj, I. (eds) IPEC Leibniz International Proceedings in Informatics (LIPIcs), vol. 43, pp. 365\u2013376. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/0210021","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Edge-deletion problems. SIAM J. Comput. 10(2), 297\u2013309 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:17:59Z","timestamp":1559405879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}