{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:11Z","timestamp":1725564911133},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223412"},{"type":"electronic","value":"9783540278016"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_27","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:15Z","timestamp":1283727615000},"page":"359-372","source":"Crossref","is-referenced-by-count":1,"title":["Maximal Common Connected Sets of Interval Graphs"],"prefix":"10.1007","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Raffinot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"B\u00e9al, M.-P., Bergeron, A., Raffinot, M.: Gene Teams and Hopcroft\u2019s Partionning Framework (2003) (submitted)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45784-4_36","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2002","unstructured":"Bergeron, A., Corteel, S., Raffinot, M.: The algorithmic of gene teams. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 464\u2013476. Springer, Heidelberg (2002)"},{"key":"27_CR3","unstructured":"Bodlaender, H.: A tourist guide through treewidth. Acta Cybernetica\u00a011(1-2) (1993)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones properties, interval graphs and graph planarity using pq-tree algorithm. J. Comput. Syst. Sci.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(82)90016-0","volume":"19","author":"A. Cardon","year":"1982","unstructured":"Cardon, A., Crochemore, M.: Partitioning a graph in O(|A| log2 |V |). Theoretical Computer Science\u00a019(1), 85\u201398 (1982)","journal-title":"Theoretical Computer Science"},{"key":"27_CR6","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? In: Proceedings of the ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 175\u2013180 (1998)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abh. Math. Sem. Uni. Hamburg\u00a025 (1961)","DOI":"10.1007\/BF02992776"},{"key":"27_CR8","unstructured":"Gai, A.-T., Habib, M., Paul, C., Raffinot, M.: Identifying Common Connected Components of Graphs. Technical report (RR-LIRMM-03016), (2003), http:\/\/www.lirmm.fr\/~paul"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-60618-1_88","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P. Galinier","year":"1995","unstructured":"Galinier, P., Habib, M., Paul, C.: Chordal graphs and their clique graph. In: Nagl, M. (ed.) WG 1995. LNCS, vol.\u00a01017, pp. 358\u2013371. Springer, Heidelberg (1995)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Computer Science\u00a0234, 59\u201384 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., De Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. Journal of the ACM\u00a048(4), 723\u2013760 (2001)","journal-title":"Journal of the ACM"},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"The Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z. (ed.) The Theory of Machines and Computations, pp. 189\u2013196. Academic Press, London (1971)"},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C.G. Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C.G., Boland, J.C.: Representation of a finite graph by a set of intervals on the real line. Fund. Math.\u00a051, 45\u201364 (1962)","journal-title":"Fund. Math."},{"key":"27_CR14","unstructured":"TERAPROT project, http:\/\/www.infobiogen.fr\/services\/Teraprot\/"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:28Z","timestamp":1605759688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}