{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:58Z","timestamp":1725798658101},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_40","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"469-480","source":"Crossref","is-referenced-by-count":3,"title":["On the Clique Editing Problem"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Kov\u00e1\u010d","sequence":"first","affiliation":[]},{"given":"Ivana","family":"Sele\u010d\u00e9niov\u00e1","sequence":"additional","affiliation":[]},{"given":"Monika","family":"Steinov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"47-49","key":"40_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.\u00a0410(47-49), 4920\u20134927 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"40_CR2","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.\u00a056(1-3), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"13","key":"40_CR3","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1016\/j.dam.2006.03.031","volume":"154","author":"P. Burzyn","year":"2006","unstructured":"Burzyn, P., Bonomo, F., Dur\u00e1n, G.: NP-completeness results for edge modification problems. Discrete Applied Mathematics\u00a0154(13), 1824\u20131844 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-04657-0_24","volume-title":"Algorithms and Computation","author":"P. Damaschke","year":"2014","unstructured":"Damaschke, P., Mogren, O.: Editing the simplest graphs. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol.\u00a08344, pp. 249\u2013260. Springer, Heidelberg (2014)"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn. Graduate texts in mathematics, vol.\u00a0173. Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"issue":"3","key":"40_CR6","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/31.1748","volume":"35","author":"E.S. El-Mallah","year":"1988","unstructured":"El-Mallah, E.S., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Transactions on Circuits and Systems\u00a035(3), 354\u2013362 (1988)","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"40_CR7","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory, 1st edn. Texts in Theoretical Computer Science. An EATCS Series1 edition. Springer (March 2006)"},{"key":"40_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1","key":"40_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P.W. Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of dna. J. Comput. Biol.\u00a02(1), 139\u2013152 (1995)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"40_CR10","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/0196-6774(87)90021-6","volume":"8","author":"D.S. Johnson","year":"1987","unstructured":"Johnson, D.S.: The NP-Completeness Column: An Ongoing Guide. J. Algorithms\u00a08(3), 438\u2013448 (1987)","journal-title":"J. Algorithms"},{"issue":"1","key":"40_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics\u00a0113(1), 109\u2013128 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR12","first-page":"183","volume-title":"Graph Theory and Computing","author":"D.J. Rose","year":"1973","unstructured":"Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Graph Theory and Computing, pp. 183\u2013217. Academic Press, New York (1973)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:23:01Z","timestamp":1558970581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}