{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:31Z","timestamp":1759638991370,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00453-015-0033-7","type":"journal-article","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T10:03:33Z","timestamp":1437386613000},"page":"218-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Between Treewidth and Clique-Width"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5434-3584","authenticated-orcid":false,"given":"Sigve Hortemo","family":"S\u00e6ther","sequence":"first","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01934985","volume":"25","author":"S Arnborg","year":"1985","unstructured":"Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposabilitya survey. BIT Numer. Math. 25(1), 1\u201323 (1985)","journal-title":"BIT Numer. Math."},{"issue":"39","key":"33_CR2","doi-asserted-by":"crossref","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. Sci. 412(39), 5187\u20135204 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"33_CR3","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/10080052X","volume":"26","author":"P Charbit","year":"2012","unstructured":"Charbit, P., de Montgolfier, F., Raffinot, M.: Linear time split decomposition revisited. SIAM J. Discrete Math. 26(2), 499\u2013514 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"33_CR4","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"DG Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput. 34(4), 825\u2013847 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"33_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"33_CR6","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"2","key":"33_CR7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"WH Cunningham","year":"1982","unstructured":"Cunningham, W.H.: Decomposition of directed graphs. SIAM J. Algebr. Discrete Methods 3(2), 214\u2013228 (1982)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F., Golovach, P., Lokshtanov, D., Saurabh, S.: Algorithmic lower bounds for problems parameterized by clique-width. In: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms, pp. 493\u2013502. (2010a)","DOI":"10.1137\/1.9781611973075.42"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Fomin, F., Golovach, P., Lokshtanov, D., Saurabh, S.: Intractability of clique-width parameterizations. SIAM J. Comput. 39(5), 1941\u20131956 (2010b)","DOI":"10.1137\/080742270"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Parameterized and Exact Computation, pp. 163\u2013176. Springer, Berlin (2013)","DOI":"10.1007\/978-3-319-03898-8_15"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Ganian, R.: Twin-cover: beyond vertex cover in parameterized algorithmics. In: Parameterized and Exact Computation, pp. 259\u2013271. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-28050-4_21"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Ganian, R., Hlin\u011bn\u1ef3, P., Ne\u0161et\u0159il, J., Obdr\u017e\u00e1lek, J., de\u00a0Mendez, P.O., Ramadurai, R.: When trees grow low: shrubs and fast mso1. In: Mathematical Foundations of Computer Science 2012, pp. 419\u2013430. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32589-2_38"},{"issue":"3","key":"33_CR13","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P Hlin\u011bn\u1ef3","year":"2008","unstructured":"Hlin\u011bn\u1ef3, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J. 51(3), 326\u2013362 (2008)","journal-title":"Comput. J."},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Tazari, S.: Lower bounds for the complexity of monadic second-order logic. In: Logic in Computer Science (LICS), 2010 25th Annual IEEE Symposium on, pp. 189\u2013198. IEEE Computer Society, Silver Spring, MD (2010)","DOI":"10.1109\/LICS.2010.39"},{"issue":"1","key":"33_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"33_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S Oum","year":"2005","unstructured":"Oum, S.: Rank-width and vertex-minors. J. Comb. Theory, Ser. B 95(1), 79\u2013100 (2005)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"33_CR17","doi-asserted-by":"crossref","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. Comb. Theory, Ser. B 96(4), 514\u2013528 (2006)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"14","key":"33_CR18","doi-asserted-by":"crossref","first-page":"2768","DOI":"10.1016\/j.dam.2007.11.013","volume":"156","author":"Micha\u00ebl Rao","year":"2008","unstructured":"Rao, Micha\u00ebl: Solving some NP-complete problems using split decomposition. Discrete Appl. Math. 156(14), 2768\u20132780 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"33_CR19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"Neil Robertson","year":"1991","unstructured":"Robertson, Neil, Seymour, Paul D.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B 52(2), 153\u2013190 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"S\u00e6ther, S.H.: Solving hamiltonian cycle by an EPT algorithm for a non-sparse parameter. In: Algorithms and Discrete Applied Mathematics, pp. 205\u2013216. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-14974-5_20"},{"key":"33_CR21","unstructured":"Vatshelle, M.: New width parameters of graphs. PhD thesis, The University of Bergen, (2012)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0033-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0033-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0033-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T08:56:47Z","timestamp":1566982607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0033-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["33"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0033-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2015,7,21]]}}}