{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:35Z","timestamp":1725474995640},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_43","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"419-428","source":"Crossref","is-referenced-by-count":1,"title":["Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions"],"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"}]},{"given":"Charis","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","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":"5","key":"43_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(97)00129-4","volume":"63","author":"S.L. Hakimi","year":"1997","unstructured":"Hakimi, S.L., Schmeichel, E.F., Young, N.E.: Orienting graphs to optimize reachability. Information Processing Letters\u00a063(5), 229\u2013235 (1997)","journal-title":"Information Processing Letters"},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/11682462_55","volume-title":"LATIN 2006: Theoretical Informatics","author":"P. Heggernes","year":"2006","unstructured":"Heggernes, P., Mancini, F.: Minimal split completions of graphs. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 592\u2013604. Springer, Heidelberg (2006)"},{"key":"43_CR4","unstructured":"Heggernes, P., Mancini, F., Papadopoulos, C.: Minimal comparabiltiy completions. Reports in Informatics 317, University of Bergen (2006), http:\/\/www.ii.uib.no\/publikasjoner\/texrap\/pdf\/2006-317.pdf"},{"key":"43_CR5","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)"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Heggernes, P., Telle, J.A., Villanger, Y.: Computing minimal triangulations in time O(n \u03b1 logn)\u2009=\u2009o(n 2.376). In: Proceedings of SODA 2005 - 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 907\u2013916 (2005)","DOI":"10.1137\/S0895480104445010"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying algorithms for recognizing interval graphs and permutation graphs. SIAM J. Comput. (to appear, 2006)","DOI":"10.1137\/S0097539703437855"},{"key":"43_CR8","unstructured":"Kratsch, D., Spinrad, J.P.: Between O(nm) and O(n \u03b1 ). In: Proceedings of SODA 2003 - 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 709\u2013716 (2003)"},{"issue":"3","key":"43_CR9","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.disc.2005.12.009","volume":"306","author":"D. Kratsch","year":"2006","unstructured":"Kratsch, D., Spinrad, J.P.: Minimal fill in o(n 3) time. Discrete Math.\u00a0306(3), 366\u2013371 (2006)","journal-title":"Discrete Math."},{"key":"43_CR10","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":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1007\/11917496_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"I. Rapaport","year":"2006","unstructured":"Rapaport, I., Suchan, K., Todinca, I.: Minimal proper interval completions. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 2006\u20132032. Springer, Heidelberg (2006)"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Roberts, F.S.: Graph Theory and Its Application to Problems of Society. Society for Industrial and Applied Mathematics, Philadelphia, PA (1978)","DOI":"10.1137\/1.9781611970401"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"266","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.\u00a0Comput.\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J.\u00a0Comput."},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J. Spinrad","year":"1985","unstructured":"Spinrad, J.: On comparability and permutation graphs. SIAM J.\u00a0Comput.\u00a014, 658\u2013670 (1985)","journal-title":"SIAM J.\u00a0Comput."},{"key":"43_CR15","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","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:58Z","timestamp":1619495398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11940128_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}