{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:40:27Z","timestamp":1725896427534},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_38","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"385-395","source":"Crossref","is-referenced-by-count":1,"title":["Bipartite Graphs of Large Clique-Width"],"prefix":"10.1007","author":[{"given":"Nicholas","family":"Korpelainen","sequence":"first","affiliation":[]},{"given":"Vadim V.","family":"Lozin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl.\u00a0Math.\u00a023, 11\u201324 (1989)","journal-title":"Discrete Appl.\u00a0Math."},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-36136-7_5","volume-title":"Algorithms and Computation","author":"R. Boliac","year":"2002","unstructured":"Boliac, R., Lozin, V.V.: On the clique-width of graphs in hereditary classes. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 44\u201354. Springer, Heidelberg (2002)"},{"key":"38_CR3","first-page":"273","volume":"67","author":"A. Brandst\u00e4dt","year":"2003","unstructured":"Brandst\u00e4dt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Combinatoria\u00a067, 273\u2013289 (2003)","journal-title":"Ars Combinatoria"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00224-005-1199-1","volume":"34","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Engelfriet, J., Le, H.-O., Lozin, V.V.: Clique-Width for Four-Vertex Forbidden Subgraphs. Theory of Computing Systems\u00a034, 561\u2013590 (2006)","journal-title":"Theory of Computing Systems"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences\u00a046, 218\u2013270 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"38_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 Comput. Syst.\u00a033, 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"38_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 a graph. Discrete Applied Math.\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Math."},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-92182-0_76","volume-title":"Algorithms and Computation","author":"V.V. Lozin","year":"2008","unstructured":"Lozin, V.V.: From tree-width to clique-width: Excluding a unit interval graph. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 871\u2013882. Springer, Heidelberg (2008)"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/S0895480102419755","volume":"18","author":"V.V. Lozin","year":"2004","unstructured":"Lozin, V.V., Rautenbach, D.: On the band-, tree- and clique-width of graphs with bounded vertex degree. SIAM J.\u00a0Discrete Mathematics\u00a018, 195\u2013206 (2004)","journal-title":"SIAM J.\u00a0Discrete Mathematics"},{"key":"38_CR10","first-page":"57","volume":"34","author":"V.V. Lozin","year":"2006","unstructured":"Lozin, V.V., Rautenbach, D.: The tree- and clique-width of bipartite graphs in special classes. Australasian J.\u00a0Combinatorics\u00a034, 57\u201367 (2006)","journal-title":"Australasian J.\u00a0Combinatorics"},{"key":"38_CR11","first-page":"345","volume":"84","author":"V.V. Lozin","year":"2007","unstructured":"Lozin, V.V., Rudolf, G.: Minimal Universal Bipartite Graphs. Ars Combinatoria\u00a084, 345\u2013356 (2007)","journal-title":"Ars Combinatoria"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1142\/S0129054108005772","volume":"19","author":"V.V. Lozin","year":"2008","unstructured":"Lozin, V.V., Volz, J.: The clique-width of bipartite graphs in monogenic classes. International Journal of Foundations of Computer Science\u00a019, 477\u2013494 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"38_CR13","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.D.: Graph minors.\u00a0V.\u00a0Excluding a planar graph. J.\u00a0Combinatorial Theory Ser.\u00a0B\u00a041, 92\u2013114 (1986)","journal-title":"J.\u00a0Combinatorial Theory Ser.\u00a0B"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:35Z","timestamp":1619782475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}