{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T12:03:29Z","timestamp":1707221009202},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:00:00Z","timestamp":1632528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:00:00Z","timestamp":1632528000000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11704-020-0137-3","type":"journal-article","created":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T05:02:26Z","timestamp":1632546146000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An improved branching algorithm for the proper interval edge deletion problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Wenjun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojing","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,25]]},"reference":[{"issue":"4","key":"137_CR1","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, 1996, 58(4): 171\u2013176","journal-title":"Information Processing Letters"},{"key":"137_CR2","doi-asserted-by":"crossref","unstructured":"Downey R G, Fellows M R. Parameterized computational feasibility. In: Proceedings of Feasible Mathematics II, 1995, 219\u2013244","DOI":"10.1007\/978-1-4612-2566-9_7"},{"issue":"22","key":"137_CR3","doi-asserted-by":"publisher","first-page":"2906","DOI":"10.1016\/j.disc.2006.04.043","volume":"307","author":"F Gardi","year":"2007","unstructured":"Gardi F. The Roberts characterization of proper and unit interval graphs. Discrete Mathematics, 2007, 307(22): 2906\u20132908","journal-title":"Discrete Mathematics"},{"issue":"4","key":"137_CR4","doi-asserted-by":"publisher","first-page":"1964","DOI":"10.1137\/12089051X","volume":"27","author":"F V Fomin","year":"2013","unstructured":"Fomin F V, Saurabh S, Villanger Y. A polynomial kernel for proper interval vertex deletion. SIAM Journal of Discrete Mathematics, 2013, 27(4): 1964\u20131976","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"137_CR5","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt A, Le V B, Spinrad J P. Graph Classes: A Survey. Society for Industrial and Applied Mathematics, 1999","DOI":"10.1137\/1.9780898719796"},{"key":"137_CR6","unstructured":"Wegner G. Eigenschaften der Nerven HomologischEinfacher Familien im Rn. PhD thesis, G\u00f6ttingen, 1967."},{"issue":"1","key":"137_CR7","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. Journal of Computational Biology, 1995, 2(1): 139\u2013152","journal-title":"Journal of Computational Biology"},{"key":"137_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ic.2017.01.008","volume":"253","author":"Y Cao","year":"2017","unstructured":"Cao Y. Unit interval editing is fixed-parameter tractable. Information and Computation, 2017, 253: 109\u2013126","journal-title":"Information and Computation"},{"issue":"1","key":"137_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10878-014-9733-1","volume":"29","author":"Y Liu","year":"2015","unstructured":"Liu Y, Wang J, Xu C, Guo J, Chen J. An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. Journal of Combinatorial and Optimization, 2015, 29(1): 257\u2013275","journal-title":"Journal of Combinatorial and Optimization"},{"key":"137_CR10","unstructured":"Kleinberg J M, Tardos \u00c9. Algorithm design. Addison-Wesley, 2006"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-0137-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-020-0137-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-0137-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T21:02:59Z","timestamp":1684616579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-020-0137-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,25]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["137"],"URL":"https:\/\/doi.org\/10.1007\/s11704-020-0137-3","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,25]]},"assertion":[{"value":"3 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"162401"}}