{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T15:33:43Z","timestamp":1758814423528},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_38","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T14:19:29Z","timestamp":1334067569000},"page":"446-457","source":"Crossref","is-referenced-by-count":4,"title":["Algorithms for Some H-Join Decompositions"],"prefix":"10.1007","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Mamcarz","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"de Montgolfier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"38_CR1","doi-asserted-by":"publisher","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"W.H. Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Canad. J. Math.\u00a032(3), 734\u2013765 (1980)","journal-title":"Canad. J. Math."},{"issue":"7","key":"38_CR2","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.dam.2009.09.009","volume":"158","author":"B.-M. Bui-Xuan","year":"2010","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics\u00a0158(7), 809\u2013819 (2010)","journal-title":"Discrete Applied Mathematics"},{"issue":"39","key":"38_CR3","doi-asserted-by":"publisher","first-page":"5187","DOI":"10.1016\/j.tcs.2011.05.022","volume":"412","author":"B.-M. Bui-Xuan","year":"2011","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Boolean-width of graphs. Theor. Comput. Science\u00a0412(39), 5187\u20135204 (2011)","journal-title":"Theor. Comput. Science"},{"key":"38_CR4","unstructured":"Charbit, P., de Montgolfier, F., Raffinot, M.: A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs. To appear in SIAM J. of Discrete Mathematics"},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M. Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Mathematics\u00a037(1), 35\u201350 (1981)","journal-title":"Discrete Mathematics"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01788536","volume":"3","author":"V. Chv\u00e1tal","year":"1987","unstructured":"Chv\u00e1tal, V., Sbihi, N.: Bull-free graphs are perfect. Graphs Combin.\u00a03, 127\u2013139 (1987)","journal-title":"Graphs Combin."},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(95)00090-E","volume":"72","author":"H. Everett","year":"1997","unstructured":"Everett, H., Klein, S., Reed, B.: An algorithm for finding homogeneous pairs. Discrete Applied Mathematics\u00a072, 209\u2013218 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of list partitions. In: Proc. 31st Ann. ACM Symp. on Theory of Computing, pp. 464\u2013472 (1999)","DOI":"10.1145\/301250.301373"},{"key":"38_CR9","unstructured":"Feder, T., Hell, P., Kr\u00e1l, D., Sgallx, J.: Two Algorithms for General List Matrix Partitions. In: SODA, pp. 870\u2013876 (2005)"},{"key":"38_CR10","first-page":"1","volume":"14","author":"T. Feder","year":"2007","unstructured":"Feder, T., Hell, P., Xie, W.: Matrix Partitions with Finitely Many Obstructions. Electr. J. Combinatorics\u00a014, 1 (2007)","journal-title":"Electr. J. Combinatorics"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M. Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Computer Science Review\u00a04, 41\u201359 (2010)","journal-title":"Computer Science Review"},{"key":"38_CR12","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.M., 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"},{"key":"38_CR13","unstructured":"de Montgolfier, F.: D\u00e9composition modulaire des graphes: th\u00e9orie, extensions et algorithmes, PhD. thesis, Universit\u00e9 Montpellier 2 (2003)"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three Partition Refinement Algorithms. SIAM J. Computing\u00a016, 973\u2013989 (1987)","journal-title":"SIAM J. Computing"},{"key":"38_CR15","unstructured":"Rao, M.: D\u00e9compositions de graphes et algorithmes efficaces PhD. thesis, Universit\u00e9 de Metz"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:53:03Z","timestamp":1556682783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}