{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T14:04:37Z","timestamp":1779890677731,"version":"3.53.1"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T00:00:00Z","timestamp":1421107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok","doi-asserted-by":"publisher","award":["280152"],"award-info":[{"award-number":["280152"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok","doi-asserted-by":"publisher","award":["NK105645"],"award-info":[{"award-number":["NK105645"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok","doi-asserted-by":"publisher","award":["280152"],"award-info":[{"award-number":["280152"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok","doi-asserted-by":"publisher","award":["NK105645"],"award-info":[{"award-number":["NK105645"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2015,1,13]]},"abstract":"<jats:p>\n            We study the minimum interval deletion problem, which asks for the removal of a set of at most\n            <jats:italic>k<\/jats:italic>\n            vertices to make a graph of\n            <jats:italic>n<\/jats:italic>\n            vertices into an interval graph. We present a parameterized algorithm of runtime 10\n            <jats:italic>\n              <jats:sup>k<\/jats:sup>\n            <\/jats:italic>\n            \u22c5\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\n              <jats:italic>O<\/jats:italic>\n              (1)\n            <\/jats:sup>\n            for this problem\u2014that is, we show that the problem is fixed-parameter tractable.\n          <\/jats:p>","DOI":"10.1145\/2629595","type":"journal-article","created":{"date-parts":[[2015,1,16]],"date-time":"2015-01-16T14:29:58Z","timestamp":1421418598000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Interval Deletion Is Fixed-Parameter Tractable"],"prefix":"10.1145","volume":"11","author":[{"given":"Yixin","family":"Cao","sequence":"first","affiliation":[{"name":"Department of Computing, Hong Kong Polytechnic University, and Hungarian Academy of Sciences (MTA SZTAKI), Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[{"name":"Hungarian Academy of Sciences (MTA SZTAKI), Hungary"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,1,13]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of SODA","author":"Adler Isolde","year":"2008"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.45.11.1607"},{"key":"e_1_2_1_4_1","first-page":"49","article-title":"Parameterized complexity analysis in computational biology","volume":"11","author":"Bodlaender Hans L.","year":"1995","journal-title":"Computer Applications in the Biosciences"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"e_1_2_1_6_1","volume-title":"Van Bang Le, and Jeremy P. Spinrad","author":"Brandst\u00e4dt Andreas","year":"1999"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90002-8"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00050-6"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_10"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411511"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Gabriel A. Dirac. 1961. On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg 25 1 71--76. DOI:http:\/\/dx.doi.org\/10.1007\/BF02992776  Gabriel A. Dirac. 1961. On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg 25 1 71--76. DOI:http:\/\/dx.doi.org\/10.1007\/BF02992776","DOI":"10.1007\/BF02992776"},{"key":"e_1_2_1_12_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"2013"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.62"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1965.15.835"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02020961"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1995.2.139"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/984029"},{"key":"e_1_2_1_18_1","unstructured":"Gy\u00f6rgy Haj\u00f3s. 1957. (Problem 65) \u00dcber eine Art von Graphen. Internationale Mathematische Nachrichten 11.  Gy\u00f6rgy Haj\u00f3s. 1957. (Problem 65) \u00dcber eine Art von Graphen. Internationale Mathematische Nachrichten 11."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796303044"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167170"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.45"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of SODA","author":"Reed Kawarabayashi","year":"2010"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1969.28.565"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0936"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-51-1-45-64"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90060-4"},{"key":"e_1_2_1_27_1","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages, and Programming","author":"Lund Carsten"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9233-8"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9484-z"},{"key":"e_1_2_1_30_1","volume-title":"Parameterized and Exact Computation. Lecture Notes in Computer Science","volume":"8246","author":"Narayanaswamy N. S."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.09.010"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.10.009"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9661-3"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/070710913"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629595","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2629595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:29Z","timestamp":1750227209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,13]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,1,13]]}},"alternative-id":["10.1145\/2629595"],"URL":"https:\/\/doi.org\/10.1145\/2629595","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,13]]},"assertion":[{"value":"2013-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-01-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}