{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:26Z","timestamp":1725544766684},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_55","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"592-604","source":"Crossref","is-referenced-by-count":7,"title":["Minimal Split Completions of Graphs"],"prefix":"10.1007","author":[{"given":"Pinar","family":"Heggernes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Mancini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Berry, A., Bordat, J.-P., Heggernes, P., Simonet, G., Villanger, Y.: A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms (to appear)","DOI":"10.1016\/j.jalgor.2004.07.001"},{"key":"55_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0304-3975(99)00126-7","volume":"250","author":"J.R.S. Blair","year":"2001","unstructured":"Blair, J.R.S., Heggernes, P., Telle, J.A.: A practical algorithm for making filled graphs minimal. Theor. Comput. Sci.\u00a0250, 125\u2013141 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"55_CR3","first-page":"311","volume":"19","author":"S. F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. Congressus Numerantium\u00a019, 311\u2013315 (1977)","journal-title":"Congressus Numerantium"},{"key":"55_CR4","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1978)"},{"key":"55_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)"},{"issue":"3","key":"55_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"P.L. Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica\u00a01(3), 275\u2013284 (1981)","journal-title":"Combinatorica"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Heggernes, P.: Minimal triangulations of graphs - a survey. Dicrete Mathematics (to appear)","DOI":"10.1016\/j.disc.2005.12.003"},{"key":"55_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/11561071_37","volume-title":"Algorithms \u2013 ESA 2005","author":"P. Heggernes","year":"2005","unstructured":"Heggernes, P., Suchan, K., Todinca, I., Villanger, Y.: Minimal interval completions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 403\u2013414. Springer, Heidelberg (2005) (to appear)"},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"Heggernes, P., Telle, J.A., Villanger, Y.: Computing minimal triangulations in time O(n\u03b1 log n) = o(n2.376). In: Proceedings of SODA 2005 - 16th Annua ACM-SIAM Symposium on Discrete Algorithms, pp. 907\u2013916 (2005)","DOI":"10.1137\/S0895480104445010"},{"key":"55_CR10","unstructured":"Kratsch, D., Spinrad, J.: Spinrad. Between O(nm) and O(n\u03b1). In: Proceedings of SODA 2003 - 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 709\u2013716 (2003)"},{"key":"55_CR11","unstructured":"Kratsch, D., Spinrad, J.: Minimal fill in o(n3) time (2004) (submitted)"},{"key":"55_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Disc. Appl. Math.\u00a0113, 109\u2013128 (2001)","journal-title":"Disc. Appl. Math."},{"key":"55_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"Rose, D., Tarjan, R.E., Lueker, G.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput.\u00a05, 146\u2013160 (1976)","journal-title":"SIAM J. Comput."},{"key":"55_CR14","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. Disc. Meth.\u00a02, 77\u201379 (1981)","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T00:18:46Z","timestamp":1555460326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11682462_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}