{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:59Z","timestamp":1742914139239,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_25","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"306-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Unit Interval Editing is Fixed-Parameter Tractable"],"prefix":"10.1007","author":[{"given":"Yixin","family":"Cao","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-16926-7_22","volume-title":"Graph Theoretic Concepts in Computer Science","author":"R van Bevern","year":"2010","unstructured":"van Bevern, R., Komusiewicz, C., Moser, H., Niedermeier, R.: Measuring indifference: unit interval vertex deletion. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 232\u2013243. Springer, Heidelberg (2010)"},{"issue":"13","key":"25_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 Appl. Math. 154(13), 1824\u20131844 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"25_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. Inf. Proc. Letters 58(4), 171\u2013176 (1996)","journal-title":"Inf. Proc. Letters"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Cao, Y.: Unit interval editing is fixed-parameter tractable. arXiv:1504.04470 (2015)","DOI":"10.1007\/978-3-662-47672-7_25"},{"key":"25_CR5","unstructured":"Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. In: Mayr, E.W., Portier, N. (eds.) STACS. LIPIcs, vol. 25, pp. 214\u2013225. Schloss Dagstuhl (2014)"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1964","DOI":"10.1137\/12089051X","volume":"27","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Saurabh, S., Villanger, Y.: A polynomial kernel for proper interval vertex deletion. SIAM J. Discr. Math. 27(4), 1964\u20131976 (2013)","journal-title":"SIAM J. Discr. Math."},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"PW Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, 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":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s00453-012-9661-3","volume":"65","author":"P van\u2018t Hof","year":"2013","unstructured":"van\u2018t Hof, P., Villanger, Y.: Proper interval vertex deletion. Algorithmica 65(4), 845\u2013867 (2013)","journal-title":"Algorithmica"},{"issue":"5","key":"25_CR9","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput. 28(5), 1906\u20131922 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. System Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. System Sci."},{"issue":"7\u20138","key":"25_CR11","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.dam.2012.11.005","volume":"161","author":"MC Lin","year":"2013","unstructured":"Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.: Normal Helly circular-arc graphs and its subclasses. Discrete Appl. Math. 161(7\u20138), 1037\u20131059 (2013)","journal-title":"Discrete Appl. Math."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2015.01.049","volume":"573","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Wang, J., You, J., Chen, J., Cao, Y.: Edge deletion problems: Branching facilitated by modular decomposition. Theor. Comp. Sci. 573, 63\u201370 (2015)","journal-title":"Theor. Comp. Sci."},{"issue":"4","key":"25_CR13","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00453-008-9233-8","volume":"57","author":"D Marx","year":"2010","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57(4), 747\u2013768 (2010)","journal-title":"Algorithmica"},{"key":"25_CR14","first-page":"139","volume-title":"Proof Techniques in Graph Theory","author":"FS Roberts","year":"1969","unstructured":"Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139\u2013146. Academic Press, New York (1969)"},{"key":"25_CR15","unstructured":"Wegner, G.: Eigenschaften der Nerven homologisch-einfacher Familien im $$R^n$$. Ph.D. thesis, Universit\u00e4t G\u00f6ttingen (1967)"},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Alg. Discrete Methods 2(1), 77\u201379 (1981)","journal-title":"SIAM J. Alg. Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:43:42Z","timestamp":1676018622000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}