{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:02Z","timestamp":1750307942529,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250847","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"374-381","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Interval completion with few edges"],"prefix":"10.1145","author":[{"given":"Pinar","family":"Heggernes","sequence":"first","affiliation":[{"name":"University of Bergen, Bergen, Norway"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[{"name":"CNRS - LIRMM and School of Computer Science McGill Univ. Canada, Montpellier, France"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[{"name":"University of Bergen, Bergen, Norway"}]},{"given":"Yngve","family":"Villanger","sequence":"additional","affiliation":[{"name":"University of Bergen, Bergen, Norway"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90002-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00050-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480193250125"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028251"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02992776"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2464827"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings FOCS","author":"Even G.","year":"1995","unstructured":"G. Even , J. Naor , S. Rao , and B. Scheiber . Divide-and-conquer approximation algoeirhtms via spreading metrics . In Proceedings FOCS 1995 , 62--71. G. Even, J. Naor, S. Rao, and B. Scheiber. Divide-and-conquer approximation algoeirhtms via spreading metrics. In Proceedings FOCS 1995, 62--71."},{"key":"e_1_3_2_1_8_1","volume-title":"Computers and intractability: a guide to the theory of NP-completeness W","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and intractability: a guide to the theory of NP-completeness W . H.Freeman and co, San Fransisco, 1979 . M. Garey and D. Johnson. Computers and intractability: a guide to the theory of NP-completeness W.H.Freeman and co, San Fransisco, 1979."},{"key":"e_1_3_2_1_9_1","volume-title":"Computer Solution of Large Sparse Positive De\"nite Systems","author":"George J. A.","year":"1981","unstructured":"J. A. George and J. W. H. Liu . Computer Solution of Large Sparse Positive De\"nite Systems . Prentice-Hall Inc ., Englewood Cliffs, New Jersey, 1981 . J. A. George and J. W. H. Liu. Computer Solution of Large Sparse Positive De\"nite Systems. Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1981."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1964-055-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1995.2.139"},{"key":"e_1_3_2_1_12_1","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"2004","unstructured":"M. C. Golumbic . Algorithmic Graph Theory and Perfect Graphs . Second edition. Annals of Discrete Mathematics 57. Elsevier , 2004 . M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Second edition. Annals of Discrete Mathematics 57. Elsevier, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11847250_6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070560"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_37"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365715"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796303044"},{"key":"e_1_3_2_1_18_1","first-page":"82","volume-title":"IEEE Symp. of Circuits and Systems","author":"Kashiwabara T.","year":"1979","unstructured":"T. Kashiwabara and T. Fujisawa . An NP-complete problem on interval graphs . IEEE Symp. of Circuits and Systems , pages 82 -- 83 , 1979 . T. Kashiwabara and T. Fujisawa. An NP-complete problem on interval graphs. IEEE Symp. of Circuits and Systems, pages 82--83, 1979."},{"key":"e_1_3_2_1_19_1","first-page":"158","article-title":"Certifying algorithms for recognizing interval graphs and permutation graphs","volume":"2003","author":"Kratsch D.","unstructured":"D. Kratsch , R. McConnell , K. Mehlhorn , and J. Spinrad . Certifying algorithms for recognizing interval graphs and permutation graphs In Proceedings SODA 2003 , 158 -- 167 . D. Kratsch, R. McConnell, K. Mehlhorn, and J. Spinrad. Certifying algorithms for recognizing interval graphs and permutation graphs In Proceedings SODA 2003, 158--167.","journal-title":"Proceedings SODA"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979119607X"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-51-1-45-64"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702413197"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/646245.684549"},{"key":"e_1_3_2_1_24_1","first-page":"41","article-title":"Parameterized complexity for graph layout problems","volume":"86","author":"Serna M.","year":"2005","unstructured":"M. Serna and D. Thilikos . Parameterized complexity for graph layout problems . Bulletin of the EATCS , 86 : 41 -- 65 , 2005 . M. Serna and D. Thilikos. Parameterized complexity for graph layout problems. Bulletin of the EATCS, 86:41--65, 2005.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_25_1","volume-title":"J. R. Bunch and D. J. Rose)","author":"Tarjan R. E.","year":"1976","unstructured":"R. E. Tarjan . Graph theory and Gaussian elimination. In Sparse Matrix Computations (eds. J. R. Bunch and D. J. Rose) . Academic Press , 1976 . R. E. Tarjan. Graph theory and Gaussian elimination. In Sparse Matrix Computations (eds. J. R. Bunch and D. J. Rose). Academic Press, 1976."}],"event":{"name":"STOC07: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego California USA","acronym":"STOC07"},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250847","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:20Z","timestamp":1750258340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250847"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":25,"alternative-id":["10.1145\/1250790.1250847","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250847","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}