{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:23:29Z","timestamp":1725557009858},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135613"},{"type":"electronic","value":"9783642135620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13562-0_26","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T09:08:30Z","timestamp":1275296910000},"page":"284-295","source":"Crossref","is-referenced-by-count":1,"title":["Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width"],"prefix":"10.1007","author":[{"given":"Pinar","family":"Heggernes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Meister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Rotics","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00224-004-1154-6","volume":"38","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Dragan, F., Le, H.-O., Mosca, R.: New Graph Classes of Bounded Clique-Width. Theory of Computing Systems\u00a038, 623\u2013645 (2005)","journal-title":"Theory of Computing Systems"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/10719839_14","volume-title":"LATIN 2000: Theoretical Informatics","author":"D.G. Corneil","year":"2000","unstructured":"Corneil, D.G., Habib, M., Lanlignel, J.-M., Reed, B.A., Rotics, U.: Polynomial Time Recognition of Clique-Width \u2264\u20093 Graphs (Extended Abstract). In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 126\u2013134. Springer, Heidelberg (2000)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"D.G. Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the Relationship between Clique-width and Treewidth. SIAM Journal on Computing\u00a034, 825\u2013847 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR4","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":"26_CR5","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":"26_CR6","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":"26_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.7155\/jgaa.00065","volume":"7","author":"W. Espelage","year":"2003","unstructured":"Espelage, W., Gurski, F., Wanke, E.: Deciding clique-width for graphs of bounded tree-width. Journal of Graph Algorithms and Applications\u00a07, 141\u2013180 (2003)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1137\/070687256","volume":"23","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-Width is NP-Complete. SIAM Journal on Discrete Mathematics\u00a023, 909\u2013939 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the Clique-Width of Some Perfect Graph Classes. International Journal of Foundations of Computer Science\u00a011, 423\u2013443 (2000)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.endm.2009.02.005","volume":"32","author":"P. Heggernes","year":"2009","unstructured":"Heggernes, P., Meister, D., Papadopoulos, C.: A new representation of proper interval graphs with an application to clique-width. Electronic Notes in Discrete Mathematics\u00a032, 27\u201334 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/978-3-642-02017-9_27","volume-title":"TAMC 2009","author":"P. Heggernes","year":"2009","unstructured":"Heggernes, P., Meister, D., Papadopoulos, C.: A Complete Characterisation of the Linear Clique-Width of Path Powers. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol.\u00a05532, pp. 241\u2013250. Springer, Heidelberg (2009)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S.-I.: Finding branch-decompositions and rank-decompositions. SIAM Journal on Computing\u00a038, 1012\u20131032 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P. Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S.-I., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. The Computer Journal\u00a051, 326\u2013362 (2008)","journal-title":"The Computer Journal"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1007\/978-3-540-92182-0_76","volume-title":"Algorithms and Computation","author":"V. Lozin","year":"2008","unstructured":"Lozin, 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. 872\u2013883. Springer, Heidelberg (2008)"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.disc.2004.02.008","volume":"283","author":"V. Lozin","year":"2004","unstructured":"Lozin, V., Rautenbach, D.: Chordal bipartite graphs of bounded tree- and clique-width. Discrete Mathematics\u00a0283, 151\u2013158 (2004)","journal-title":"Discrete Mathematics"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/S0895480102419755","volume":"18","author":"V. Lozin","year":"2004","unstructured":"Lozin, V., Rautenbach, D.: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. SIAM Journal on Discrete Mathematics\u00a018, 195\u2013206 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"26_CR17","unstructured":"M\u00fcller, H., Urner, R.: On a disparity between relative cliquewidth and relative NLC-width. Discrete Applied Mathematics (to appear)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Oum, S.-I.: Approximating rank-width and clique-width quickly. ACM Transactions on Algorithms\u00a05 (2008)","DOI":"10.1145\/1435375.1435385"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S.-I. Oum","year":"2006","unstructured":"Oum, S.-I., Seymour, P.: Approximating clique-width and branch-width. Journal on Combinatorial Theory, Series B\u00a096, 514\u2013528 (2006)","journal-title":"Journal on Combinatorial Theory, Series B"},{"key":"26_CR20","first-page":"139","volume-title":"Proof techniques in graph theory","author":"F.S. Roberts","year":"1969","unstructured":"Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof techniques in graph theory, pp. 139\u2013146. Academic Press, New York (1969)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13562-0_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:07:31Z","timestamp":1619784451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13562-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135613","9783642135620"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13562-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}