{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:06Z","timestamp":1725474966762},"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_52","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"517-526","source":"Crossref","is-referenced-by-count":2,"title":["Minimal Interval Completion Through Graph Exploration"],"prefix":"10.1007","author":[{"given":"Karol","family":"Suchan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioan","family":"Todinca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"52_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(98)00005-5","volume":"84","author":"A. Berry","year":"1998","unstructured":"Berry, A., Bordat, J.P.: Separability Generalizes Dirac\u2019s Theorem. Discrete Applied Mathematics\u00a084(1-3), 43\u201353 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"52_CR2","unstructured":"Berry, A., Bordat, J.P.: Local LexBFS Properties in an Arbitrary Graph. Proceedings of Journ\u00e9es Informatiques Messines (2000), http:\/\/www.isima.fr\/berry\/lexbfs.ps"},{"issue":"6","key":"52_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM Journal on Computing\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"52_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties. Information Processing Letters\u00a058(4), 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P.C. Gilmore","year":"1964","unstructured":"Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Canadian Journal of Mathematics\u00a016, 539\u2013548 (1964)","journal-title":"Canadian Journal of Mathematics"},{"key":"52_CR6","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":"2","key":"52_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M. Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. International Journal of Foundations of Computer Science\u00a010(2), 147\u2013170 (1999)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"52_CR8","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":"52_CR9","unstructured":"Heggernes, P., Mancini, F., Papadopoulos, C.: Minimal Comparability Completions. Tech. Report, University of Bergen (2006), http:\/\/www.ii.uib.no\/publikasjoner\/texrap\/pdf\/2006-317.pdf"},{"key":"52_CR10","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":"52_CR11","first-page":"907","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms - SODA 2005","author":"P. Heggernes","year":"2005","unstructured":"Heggernes, P., Telle, J.A., Villanger, Y.: Computing minimal triangulations in time O(n \u03b1 log n) = o(n 2.376). In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms - SODA 2005, pp. 907\u2013916. SIAM, Philadelphia (2005)"},{"issue":"1","key":"52_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","volume":"37","author":"S. Olariu","year":"1991","unstructured":"Olariu, S.: An optimal greedy heuristic to color interval graphs. Information Processing Letters\u00a037(1), 21\u201325 (1991)","journal-title":"Information Processing Letters"},{"key":"52_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11917496_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"I. Rappaport","year":"2006","unstructured":"Rappaport, I., Suchan, K., Todinca, I.: Minimal proper interval completions. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, Springer, Heidelberg (2006), www.univ-orleans.fr\/SCIENCES\/LIFO\/prodsci\/rapports\/RR2006.htm.en"},{"key":"52_CR14","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.\u00a0Comput.\u00a05, 146\u2013160 (1976)","journal-title":"SIAM J.\u00a0Comput."},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Suchan, K., Todinca, I.: Minimal interval vompletion through graph exploration. Research Report RR 2006-08, Universit\u00e9 d\u2019Orl\u00e9ans, www.univ-orleans.fr\/SCIENCES\/LIFO\/prodsci\/rapports\/RR2006.htm.en","DOI":"10.1007\/11940128_52"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:50:02Z","timestamp":1619509802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11940128_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}