{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:28:01Z","timestamp":1725600481158},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_10","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T04:54:39Z","timestamp":1312952079000},"page":"110-121","source":"Crossref","is-referenced-by-count":8,"title":["Cograph Editing: Complexity and Parameterized Algorithms"],"prefix":"10.1007","author":[{"given":"Yunlong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.jpdc.2006.08.011","volume":"67","author":"K. Asdre","year":"2007","unstructured":"Asdre, K., Nikolopoulos, S.D., Papadopoulos, C.: An optimal parallel solution for the path cover problem on P\n                4-sparse graphs. Journal of Parallel and Distributed Computing\u00a067(1), 63\u201376 (2007)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"13","key":"10_CR2","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"},{"issue":"4","key":"10_CR3","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. Information Processing Letters\u00a058(4), 171\u2013196 (1996)","journal-title":"Information Processing Letters"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-14031-0_49","volume-title":"Computing and Combinatorics","author":"J. Chen","year":"2010","unstructured":"Chen, J., Meng, J.: A 2k kernel for the cluster editing problem. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 459\u2013468. Springer, Heidelberg (2010)"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"G. Corneil","year":"1985","unstructured":"Corneil, G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing\u00a014(4), 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10_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"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J. Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica\u00a039(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00224-004-1178-y","volume":"38","author":"J. Gramm","year":"2005","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory of Computing Systems\u00a038(4), 373\u2013392 (2005)","journal-title":"Theory of Computing Systems"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-17493-3_15","volume-title":"Parameterized and Exact Computation","author":"S. Guillemot","year":"2010","unstructured":"Guillemot, S., Paul, C., Perez, A.: On the (Non-)existence of polynomial kernels for p\n                  l\n                -free edge modification problems. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 147\u2013157. Springer, Heidelberg (2010)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-79228-4_39","volume-title":"Theory and Applications of Models of Computation","author":"J. Guo","year":"2008","unstructured":"Guo, J., H\u00fcffner, F., Komusiewicz, C., Zhang, Y.: Improved algorithms for bicluster editing. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 445\u2013456. Springer, Heidelberg (2008)"},{"key":"10_CR11","unstructured":"Ho\u00e0ng, C.T.: Perfect graphs. PhD Thesis, School of Computer Science. McGill University, Montreal (1985)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1137\/0221027","volume":"21","author":"B. Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: Recognizing P\n                4-sparse graphs in linear time. SIAM Journal on Computing\u00a021(2), 381\u2013406 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR13","unstructured":"Mancini, F.: Graph Modification Problems Related to Graph Classes. PhD Thesis, University of Bergen (2008)"},{"issue":"1-3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201(1-3), 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-17461-2_27","volume-title":"Combinatorial Optimization and Applications","author":"J. Nastos","year":"2010","unstructured":"Nastos, J., Gao, Y.: A novel branching strategy for parameterized graph modification problems. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.\u00a06509, pp. 332\u2013346. Springer, Heidelberg (2010)"},{"issue":"1","key":"10_CR16","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":"10_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter tractable algorithms. Information Processing Letters\u00a073, 125\u2013129 (2000)","journal-title":"Information Processing Letters"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00224-007-9032-7","volume":"44","author":"F. Protti","year":"2009","unstructured":"Protti, F., Silva, M.D., Szwarcfiter, J.L.: Applying Modular Decomposition to Parameterized Cluster Editing Problems. Theory of Computing Systems\u00a044, 91\u2013104 (2009)","journal-title":"Theory of Computing Systems"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","volume":"16","author":"D. Seinsche","year":"1974","unstructured":"Seinsche, D.: On a property of the class of n-colorable graphs. Journal of Combinatorial Theory, Series B\u00a016, 191\u2013193 (1974)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T05:21:50Z","timestamp":1554009710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}