{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:20:02Z","timestamp":1725852002465},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_42","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"562-575","source":"Crossref","is-referenced-by-count":0,"title":["Edge-Editing to a Dense and a Sparse Graph Class"],"prefix":"10.1007","author":[{"given":"Michal","family":"Kotrb\u010d\u00edk","sequence":"first","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Ordyniak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"2","key":"42_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"issue":"1\u20133","key":"42_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. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"2","key":"42_CR3","first-page":"38","volume":"4","author":"H Bodlaender","year":"2014","unstructured":"Bodlaender, H., Heggernes, P., Lokshtanov, D.: Graph modification problems (Dagstuhl seminar 14071). Dagstuhl Rep. 4(2), 38\u201359 (2014)","journal-title":"Dagstuhl Rep."},{"issue":"6","key":"42_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Bova, S., Ganian, R., Szeider, S.: Model checking existential logic on partially ordered sets. In: CSL-LICS. ACM (2014)","DOI":"10.1145\/2603088.2603110"},{"issue":"4","key":"42_CR6","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. Inform. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"42_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00453-012-9667-x","volume":"68","author":"M Cygan","year":"2014","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M., Schlotter, I.: Parameterized complexity of eulerian deletion problems. Algorithmica 68(1), 41\u201361 (2014)","journal-title":"Algorithmica"},{"issue":"4","key":"42_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.7155\/jgaa.00337","volume":"18","author":"P Damaschke","year":"2014","unstructured":"Damaschke, P., Mogren, O.: Editing simple graphs. J. Graph Algorithms Appl. 18(4), 557\u2013576 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"42_CR9","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"42_CR10","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, vol. 41. Springer, Heidelberg (2006)"},{"issue":"2","key":"42_CR11","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1137\/130936816","volume":"28","author":"F Fomin","year":"2014","unstructured":"Fomin, F., Golovach, P.: Long circuits and large euler subgraphs. SIAM J. Discrete Math. 28(2), 878\u2013892 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kreutzer, S., Siebertz, S.: Deciding first-order properties of nowhere dense graphs. In: STOC. ACM (2014)","DOI":"10.1145\/2591796.2591851"},{"key":"42_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1007\/978-3-642-39212-2_52","volume-title":"Automata, Languages, and Programming","author":"S Hartung","year":"2013","unstructured":"Hartung, S., Nichterlein, A., Niedermeier, R., Such\u00fd, O.: A refined complexity analysis of degree anonymization in graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 594\u2013606. Springer, Heidelberg (2013)"},{"key":"42_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-319-21840-3_34","volume-title":"Algorithms and Data Structures","author":"F H\u00fcffner","year":"2015","unstructured":"H\u00fcffner, F., Komusiewicz, C., Nichterlein, A.: Editing graphs into few cliques: complexity, approximation, and kernelization schemes. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 410\u2013421. Springer, Heidelberg (2015)"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/978-3-662-44465-8_40","volume-title":"Mathematical Foundations of Computer Science 2014","author":"I Kov\u00e1\u010d","year":"2014","unstructured":"Kov\u00e1\u010d, I., Sele\u010d\u00e9niov\u00e1, I., Steinov\u00e1, M.: On the clique editing problem. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 469\u2013480. Springer, Heidelberg (2014)"},{"issue":"1","key":"42_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.jcss.2011.02.001","volume":"78","author":"L Mathieson","year":"2012","unstructured":"Mathieson, L., Szeider, S.: Editing graphs to satisfy degree constraints: a parameterized approach. J. Comput. Syst. Sci. 78(1), 179\u2013191 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"42_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jda.2008.09.005","volume":"7","author":"H Moser","year":"2009","unstructured":"Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms 7(2), 181\u2013190 (2009)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"42_CR18","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.socnet.2013.05.001","volume":"35","author":"J Nastos","year":"2013","unstructured":"Nastos, J., Gao, Y.: Familial groups in social networks. Soc. Netw. 35(3), 439\u2013450 (2013)","journal-title":"Soc. Netw."},{"key":"42_CR19","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity: Graphs, Structures, and Algorithms","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Sparsity: Graphs, Structures, and Algorithms. Algorithms and Combinatorics, vol. 28. Springer, Heidelberg (2012)"},{"key":"42_CR20","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"4","key":"42_CR21","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"42_CR22","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"RL Rivest","year":"1976","unstructured":"Rivest, R.L., Vuillemin, J.: On recognizing graph properties from adjacency matrices. Theor. Comput. Sci. 3(3), 371\u2013384 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: STOC, pp. 253\u2013264. ACM (1978)","DOI":"10.1145\/800133.804355"},{"issue":"2","key":"42_CR24","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_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:58:44Z","timestamp":1559422724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}