{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:08:41Z","timestamp":1768684121787,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540748380","type":"print"},{"value":"9783540748397","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74839-7_7","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"66-75","source":"Crossref","is-referenced-by-count":6,"title":["Graph Operations Characterizing Rank-Width and Balanced Graph Expressions"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mamadou Moustapha","family":"Kant\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.L. Bodlaender","year":"1989","unstructured":"Bodlaender, H.L.: NC-algorithms for graphs with small tree-width. In: van Leeuwen, J. (ed.) Graph-Theoretic Concepts in Computer Science. LNCS, vol.\u00a0344, pp. 1\u201310. Springer, Heidelberg (1989)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/S0097539795289859","volume":"27","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded tree-width. SIAM J. Comput.\u00a027, 1725\u20131746 (1998)","journal-title":"SIAM J. Comput."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.ic.2005.11.006","volume":"204","author":"A. Blumensath","year":"2006","unstructured":"Blumensath, A., Courcelle, B.: Recognizability, hypergraph operations and logical types. Information and Computation\u00a0204, 853\u2013919 (2006)","journal-title":"Information and Computation"},{"key":"7_CR4","unstructured":"Courcelle, B., Kant\u00e9, M.M.: Multiple Colorings : graph operations characterizing rank-width and balanced graph expressions. Available on \n                  \n                    http:\/\/www.labri.fr\/perso\/courcell\/courcelle_kante07.pdf"},{"key":"7_CR5","unstructured":"Courcelle, B., Kant\u00e9, M.M.: Balanced Graph Expressions, manuscript (2007)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems\u00a033, 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique-width of graphs. Discrete Applied Mathematics\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-70918-3_4","volume-title":"STACS 2007","author":"B. Courcelle","year":"2007","unstructured":"Courcelle, B., Twigg, A.: Compact Forbidden-set Routing. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 37\u201348. Springer, Heidelberg (2007)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(02)00421-3","volume":"131","author":"B. Courcelle","year":"2003","unstructured":"Courcelle, B., Vanicat, R.: Query efficient implementation of graphs of bounded clique-width. Discrete Applied Mathematics\u00a0131, 129\u2013150 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.tcs.2005.03.018","volume":"342","author":"B. Courcelle","year":"2005","unstructured":"Courcelle, B., Weil, P.: The recognizability of sets of graphs is a robust property. Theor. Comput. Sci.\u00a0342, 173\u2013228 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized complexity. Springer, Heidelberg (1999)"},{"key":"7_CR12","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Hlin\u011bn\u00fd, P., Oum, S.: Finding Branch-decompositions and Rank-decompositions. In: 15\n                  th\n                 Annual European Symposium. LNCS, vol.\u00a04698, pp. 163\u2013174. Springer, Heidelberg (October 2007)","DOI":"10.1007\/978-3-540-75520-3_16"},{"issue":"17","key":"7_CR14","doi-asserted-by":"publisher","first-page":"2328","DOI":"10.1016\/j.dam.2007.06.011","volume":"155","author":"M.M. Kant\u00e9","year":"2007","unstructured":"Kant\u00e9, M.M.: Vertex-minor reductions can simulate edge contractions. Discrete Applied Mathematics\u00a0155(17), 2328\u20132340 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11604686_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Oum","year":"2005","unstructured":"Oum, S.: Approximating rank-width and Clique-width Quickly. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 49\u201358. Springer, Heidelberg (2005)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating clique-width and branch-width. J. Combin Theory, Ser B\u00a096, 514\u2013528 (2006)","journal-title":"J. Combin Theory, Ser B"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.: Graph minors V: excluding a planar graph. J. Combin. Theory (B)\u00a041, 92\u2013114 (1986)","journal-title":"J. Combin. Theory (B)"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","volume":"54","author":"E. Wanke","year":"1994","unstructured":"Wanke, E.: k-NLC graphs and Polynomial algorithms. Discrete Applied Mathematics\u00a054, 251\u2013266 (1994)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:05:56Z","timestamp":1558278356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540748380","9783540748397"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}