{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T17:37:06Z","timestamp":1790789826436,"version":"4.1.0"},"reference-count":20,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>In the Proper Interval Completion problem we are given a graph $G$ and an integer $k$, and the task is to turn $G$ using at most $k$ edge additions into a proper interval graph, i.e., a graph admitting an intersection model of equal-length intervals on a line. The study of Proper Interval Completion from the viewpoint of parameterized complexity has been initiated by Kaplan, Shamir, and Tarjan [SIAM J. Comput., 28 (1999), pp. 1906--1922], who showed an algorithm for the problem working in $\\mathcal{O}(16^k\\cdot (n+m))$ time. In this paper we present an algorithm with running time $k^{\\mathcal{O}(k^{2\/3})} + \\mathcal{O}(nm(kn+m))$, which is the first subexponential parameterized algorithm for Proper Interval Completion.<\/jats:p>","DOI":"10.1137\/140988565","type":"journal-article","created":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T10:34:30Z","timestamp":1445510070000},"page":"1961-1987","source":"Crossref","is-referenced-by-count":12,"title":["A Subexponential Parameterized Algorithm for Proper Interval Completion"],"prefix":"10.1137","volume":"29","author":[{"given":"Ivan","family":"Bliznets","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,10,22]]},"reference":[{"key":"atypb1","first-page":"49","author":"Alon N.","year":"2009","journal-title":"New York"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2013.08.006"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"I. Bliznets, F. V. Fomin, M. Pilipczuk, and M. Pilipczuk,\n                      A Subexponential Parameterized Algorithm for Interval Completion\n                      , CoRR, abs\/1402.3473. 2014.","DOI":"10.1007\/978-3-662-44777-2_15"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"I. Bliznets, F. V. Fomin, M. Pilipczuk, and M. Pilipczuk,\n                      A subexponential parameterized algorithm for proper interval completion\n                      , in Algorithms, ESA 2014, 22th Annual European Symposium, Wroclaw, Poland, A. S. Schulz and D. Wagner, eds., Lecture Notes in Comput. Sci. 8737, Springer, New York, 2014, pp. 173-184.","DOI":"10.1007\/978-3-662-44777-2_15"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00050-6"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1145\/1101821.1101823"},{"key":"atypb7","first-page":"288","author":"Drange P. G.","year":"2014","journal-title":"Germany"},{"key":"atypb8","first-page":"10","author":"Feige U.","year":"2000","journal-title":"Proceedings of SWAT"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/11085390X"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9837-5"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1995.2.139"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"M. C. Golumbic,\n                      Algorithmic Graph Theory and Perfect Graphs\n                      , Academic Press, New York, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796303044"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2013.02.001"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9733-1"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(93)90308-I"},{"key":"atypb18","first-page":"139","author":"Roberts F. S.","year":"1969","journal-title":"New York"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/070710913"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/0602010"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140988565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:47:01Z","timestamp":1787320021000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140988565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/140988565"],"URL":"https:\/\/doi.org\/10.1137\/140988565","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}