{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:12:25Z","timestamp":1742911945052,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_10","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"119-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Clique-Width: Harnessing the Power of Atoms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9515-6945","authenticated-orcid":false,"given":"Konrad K.","family":"Dabrowski","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8524-4036","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Masa\u0159\u00edk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7955-4692","authenticated-orcid":false,"given":"Jana","family":"Novotn\u00e1","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"1\u20133","key":"10_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(03)00387-1","volume":"132","author":"VE Alekseev","year":"2003","unstructured":"Alekseev, V.E.: On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Appl. Math. 132(1\u20133), 17\u201326 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(03)00387-1","journal-title":"Discrete Appl. Math."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2013.01.011","volume":"511","author":"R Belmonte","year":"2013","unstructured":"Belmonte, R., Vatshelle, M.: Graph classes with structured neighborhoods and algorithmic applications. Theor. Comput. Sci. 511, 54\u201365 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.01.011","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/18M1235016","volume":"34","author":"A Blanch\u00e9","year":"2020","unstructured":"Blanch\u00e9, A., Dabrowski, K.K., Johnson, M., Lozin, V.V., Paulusma, D., Zamaraev, V.: Clique-width for graph classes closed under complementation. SIAM J. Discrete Math. 34(2), 1107\u20131147 (2020). https:\/\/doi.org\/10.1137\/18M1235016","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996). https:\/\/doi.org\/10.1137\/S0097539793251219","journal-title":"SIAM J. Comput."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Brettell, N., Johnson, M., Paesani, G., Paulusma, D., van Leeuwen, E.J.: Steiner trees for hereditary graph classes. Proc. LATIN 2020, LNCS (2020, to appear)","DOI":"10.1007\/978-3-030-61792-9_48"},{"key":"10_CR6","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.: On the clique-width of graphs in hereditary classes. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 44\u201354. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36136-7_5"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.dam.2016.04.003","volume":"211","author":"A Brandst\u00e4dt","year":"2016","unstructured":"Brandst\u00e4dt, A., Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding the clique-width of $$H$$-free split graphs. Discrete Appl. Math. 211, 30\u201339 (2016). https:\/\/doi.org\/10.1016\/j.dam.2016.04.003","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1002\/jgt.22111","volume":"86","author":"A Brandst\u00e4dt","year":"2017","unstructured":"Brandst\u00e4dt, A., Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding the clique-width of $$H$$-free chordal graphs. J. Graph Theory 86(1), 42\u201377 (2017). https:\/\/doi.org\/10.1002\/jgt.22111","journal-title":"J. Graph Theory"},{"issue":"1\u20132","key":"10_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.tcs.2007.09.031","volume":"389","author":"A Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt, A., Ho\u00e0ng, C.T.: On clique separators, nearly chordal graphs, and the maximum weight stable set problem. Theor. Comput. Sci. 389(1\u20132), 295\u2013306 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.031","journal-title":"Theor. Comput. Sci."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Klembt, T., Mahfud, S.: $$P_6$$- and triangle-free graphs revisited: structure and bounded clique-width. Discrete Math. Theor. Comput. Sci. 8(1), 173\u2013188 (2006). https:\/\/dmtcs.episciences.org\/372","DOI":"10.46298\/dmtcs.372"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/S0129054104002364","volume":"15","author":"A Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A., Le, H.O., Mosca, R.: Gem- and co-gem-free graphs have bounded clique-width. Int. J. Found. Comput. Sci. 15(1), 163\u2013185 (2004). https:\/\/doi.org\/10.1142\/S0129054104002364","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.dam.2004.01.014","volume":"145","author":"A Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Le, H.O., Mosca, R.: Chordal co-gem-free and ($$P_5$$,gem)-free graphs have bounded clique-width. Discrete Appl. Math. 145(2), 232\u2013241 (2005). https:\/\/doi.org\/10.1016\/j.dam.2004.01.014","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(02)00291-0","volume":"84","author":"A Brandst\u00e4dt","year":"2002","unstructured":"Brandst\u00e4dt, A., Mahfud, S.: Maximum weight stable set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Inf. Process. Lett. 84(5), 251\u2013259 (2002). https:\/\/doi.org\/10.1016\/S0020-0190(02)00291-0","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"10_CR14","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.dam.2010.05.022","volume":"159","author":"A Brandst\u00e4dt","year":"2011","unstructured":"Brandst\u00e4dt, A., Mosca, R.: On distance-3 matchings and induced matchings. Discrete Appl. Math. 159(7), 509\u2013520 (2011). https:\/\/doi.org\/10.1016\/j.dam.2010.05.022","journal-title":"Discrete Appl. Math."},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Brettell, N., Horsfield, J., Munaro, A., Paesani, G., Paulusma, D.: Bounding the mim-width of hereditary graph classes. In: Cao, Y., Pilipczuk, M. (eds.) IPEC 2020. LIPIcs vol. 180, pp. 6:1\u20136:19 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2020.6","DOI":"10.4230\/LIPIcs.IPEC.2020.6"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2013.01.009","volume":"511","author":"B Bui-Xuan","year":"2013","unstructured":"Bui-Xuan, B., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511, 66\u201376 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.01.009","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.disc.2017.09.013","volume":"341","author":"K Cameron","year":"2018","unstructured":"Cameron, K., da Silva, M.V.G., Huang, S., Vu\u0161kovi\u0107, K.: Structure and algorithms for (cap, even hole)-free graphs. Discrete Math. 341(2), 463\u2013473 (2018). https:\/\/doi.org\/10.1016\/j.disc.2017.09.013","journal-title":"Discrete Math."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1017\/CBO9780511734885.008","volume":"327","author":"M Chudnovsky","year":"2005","unstructured":"Chudnovsky, M., Seymour, P.D.: The structure of claw-free graphs. London Math. Soc. Lecture Note Series 327, 153\u2013171 (2005). https:\/\/doi.org\/10.1017\/CBO9780511734885.008","journal-title":"London Math. Soc. Lecture Note Series"},{"key":"10_CR19","doi-asserted-by":"publisher","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, 825\u2013847 (2005). https:\/\/doi.org\/10.1137\/S0097539701385351","journal-title":"SIAM J. Comput."},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, Encyclopedia of Mathematics and its Applications, vol. 138. Cambridge University Press (2012). https:\/\/doi.org\/10.1017\/CBO9780511977619","DOI":"10.1017\/CBO9780511977619"},{"issue":"2","key":"10_CR22","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. 33(2), 125\u2013150 (2000). https:\/\/doi.org\/10.1007\/s002249910009","journal-title":"Theory Comput. Syst."},{"issue":"1\u20133","key":"10_CR23","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 Appl. Math. 101(1\u20133), 77\u2013114 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(99)00184-5","journal-title":"Discrete Appl. Math."},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.jcss.2017.06.005","volume":"89","author":"KK Dabrowski","year":"2017","unstructured":"Dabrowski, K.K., Dross, F., Paulusma, D.: Colouring diamond-free graphs. J. Comput. Syst. Sci. 89, 410\u2013431 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.06.005","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.jcss.2016.06.007","volume":"104","author":"KK Dabrowski","year":"2019","unstructured":"Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. 104, 202\u2013215 (2019). https:\/\/doi.org\/10.1016\/j.jcss.2016.06.007","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/9781108649094.002","volume":"456","author":"KK Dabrowski","year":"2019","unstructured":"Dabrowski, K.K., Johnson, M., Paulusma, D.: Clique-width for hereditary graph classes. London Math. Soc. Lecture Note Series 456, 1\u201356 (2019). https:\/\/doi.org\/10.1017\/9781108649094.002","journal-title":"London Math. Soc. Lecture Note Series"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jcss.2019.09.001","volume":"108","author":"KK Dabrowski","year":"2020","unstructured":"Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. 108, 64\u201391 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2019.09.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"10_CR28","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1016\/j.disc.2011.12.012","volume":"312","author":"KK Dabrowski","year":"2012","unstructured":"Dabrowski, K.K., Lozin, V.V., Raman, R., Ries, B.: Colouring vertices of triangle-free graphs without forests. Discrete Math. 312(7), 1372\u20131385 (2012). https:\/\/doi.org\/10.1016\/j.disc.2011.12.012","journal-title":"Discrete Math."},{"key":"10_CR29","unstructured":"Dabrowski, K.K., Masa\u0159\u00edk, T., Novotn\u00e1, J., Paulusma, D., Rz\u0105\u017cewski, P.: Clique-width: Harnessing the power of atoms. CoRR abs\/2006.03578 (2020). https:\/\/arxiv.org\/abs\/2006.03578"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.dam.2015.06.030","volume":"200","author":"KK Dabrowski","year":"2016","unstructured":"Dabrowski, K.K., Paulusma, D.: Classifying the clique-width of $${H}$$-free bipartite graphs. Discrete Appl. Math. 200, 43\u201351 (2016). https:\/\/doi.org\/10.1016\/j.dam.2015.06.030","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10_CR31","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1093\/comjnl\/bxv096","volume":"59","author":"KK Dabrowski","year":"2016","unstructured":"Dabrowski, K.K., Paulusma, D.: Clique-width of graph classes defined by two forbidden induced subgraphs. Comput. J. 59(5), 650\u2013666 (2016). https:\/\/doi.org\/10.1093\/comjnl\/bxv096","journal-title":"Comput. J."},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45477-2_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"W Espelage","year":"2001","unstructured":"Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 117\u2013128. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45477-2_12"},{"issue":"1","key":"10_CR33","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00373-019-02123-1","volume":"36","author":"AM Foley","year":"2020","unstructured":"Foley, A.M., Fraser, D.J., Ho\u00e0ng, C.T., Holmes, K., LaMantia, T.P.: The intersection of two vertex coloring problems. Graphs Comb. 36(1), 125\u2013138 (2020). https:\/\/doi.org\/10.1007\/s00373-019-02123-1","journal-title":"Graphs Comb."},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.dam.2016.08.016","volume":"231","author":"DJ Fraser","year":"2017","unstructured":"Fraser, D.J., Hamel, A.M., Ho\u00e0ng, C.T., Holmes, K., LaMantia, T.P.: Characterizations of $$(4K_1, C_4, C_5)$$-free graphs. Discrete Appl. Math. 231, 166\u2013174 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.08.016","journal-title":"Discrete Appl. Math."},{"key":"10_CR35","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jcss.2019.06.002","volume":"106","author":"S Gaspers","year":"2019","unstructured":"Gaspers, S., Huang, S., Paulusma, D.: Colouring square-free graphs without long induced paths. J. Comput. Syst. Sci. 106, 60\u201379 (2019). https:\/\/doi.org\/10.1016\/j.jcss.2019.06.002","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10_CR36","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/S0304-3975(02)00725-9","volume":"299","author":"MU Gerber","year":"2003","unstructured":"Gerber, M.U., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theor. Comput. Sci. 299(1), 719\u2013734 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00725-9","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10_CR37","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/jgt.22028","volume":"84","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A., Johnson, M., Paulusma, D., Song, J.: A survey on the computational complexity of colouring graphs with forbidden subgraphs. J. Graph Theory 84(4), 331\u2013363 (2017). https:\/\/doi.org\/10.1002\/jgt.22028","journal-title":"J. Graph Theory"},{"key":"10_CR38","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0304-0208(08)72943-8","volume":"21","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. Ann. Discrete Math. 21, 325\u2013356 (1984). https:\/\/doi.org\/10.1016\/S0304-0208(08)72943-8","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"10_CR39","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/s00224-016-9685-1","volume":"60","author":"F Gurski","year":"2017","unstructured":"Gurski, F.: The behavior of clique-width under graph operations and graph transformations. Theory Comput. Syst. 60(2), 346\u2013376 (2017). https:\/\/doi.org\/10.1007\/s00224-016-9685-1","journal-title":"Theory Comput. Syst."},{"key":"10_CR40","doi-asserted-by":"publisher","unstructured":"Hermelin, D., Mnich, M., van Leeuwen, E.J., Woeginger, G.J.: Domination when the stars are out. ACM Trans. Algorithms 15(2), 25:1\u201325:90 (2019). https:\/\/doi.org\/10.1145\/3301445","DOI":"10.1145\/3301445"},{"issue":"3","key":"10_CR41","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J. 51(3), 326\u2013362 (2008). https:\/\/doi.org\/10.1093\/comjnl\/bxm052","journal-title":"Comput. J."},{"key":"10_CR42","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2015.01.022","volume":"186","author":"CT Ho\u00e0ng","year":"2015","unstructured":"Ho\u00e0ng, C.T., Lazzarato, D.A.: Polynomial-time algorithms for minimum weighted colorings of $$(P_5,\\overline{P_5})$$-free graphs and similar graph classes. Discrete Appl. Math. 186, 106\u2013111 (2015). https:\/\/doi.org\/10.1016\/j.dam.2015.01.022","journal-title":"Discrete Appl. Math."},{"key":"10_CR43","unstructured":"Huang, S., Karthick, T.: On graphs with no induced five-vertex path or paraglider. CoRR abs\/1903.11268 (2019). https:\/\/arxiv.org\/abs\/1903.11268"},{"issue":"2","key":"10_CR44","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Appl. Math. 75(2), 135\u2013155 (1997). https:\/\/doi.org\/10.1016\/S0166-218X(96)00085-6","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"10_CR45","doi-asserted-by":"publisher","first-page":"2747","DOI":"10.1016\/j.dam.2008.08.022","volume":"157","author":"M Kami\u0144ski","year":"2009","unstructured":"Kami\u0144ski, M., Lozin, V.V., Milani\u010d, M.: Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 157(12), 2747\u20132761 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.08.022","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"10_CR46","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","volume":"126","author":"D Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126(2\u20133), 197\u2013221 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(02)00198-1","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10_CR47","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/S0895480102419755","volume":"18","author":"VV Lozin","year":"2004","unstructured":"Lozin, V.V., Rautenbach, D.: On the band-, tree-, and clique-width of graphs with bounded vertex degree. SIAM J. Discrete Math. 18(1), 195\u2013206 (2004). https:\/\/doi.org\/10.1137\/S0895480102419755","journal-title":"SIAM J. Discrete Math."},{"issue":"03","key":"10_CR48","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/S0129054199000241","volume":"10","author":"JA Makowsky","year":"1999","unstructured":"Makowsky, J.A., Rotics, U.: On the clique-width of graphs with few $$P_4$$\u2019s. Int. J. Found. Comput. Sci. 10(03), 329\u2013348 (1999). https:\/\/doi.org\/10.1142\/S0129054199000241","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR49","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.dam.2016.10.025","volume":"219","author":"DS Malyshev","year":"2017","unstructured":"Malyshev, D.S., Lobanova, O.O.: Two complexity results for the vertex coloring problem. Discrete Appl. Math. 219, 158\u2013166 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.10.025","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10_CR50","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.D.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B 96(4), 514\u2013528 (2006). https:\/\/doi.org\/10.1016\/j.jctb.2005.10.006","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20133","key":"10_CR51","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.tcs.2007.03.043","volume":"377","author":"M Rao","year":"2007","unstructured":"Rao, M.: MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theor. Comput. Sci. 377(1\u20133), 260\u2013267 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.03.043","journal-title":"Theor. Comput. Sci."},{"key":"10_CR52","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2015.11.039","volume":"615","author":"SH S\u00e6ther","year":"2016","unstructured":"S\u00e6ther, S.H., Vatshelle, M.: Hardness of computing width parameters based on branch decompositions over the vertex set. Theor. Comput. Sci. 615, 120\u2013125 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.11.039","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR53","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Math. 55(2), 221\u2013232 (1985). https:\/\/doi.org\/10.1016\/0012-365X(85)90051-2","journal-title":"Discrete Math."},{"key":"10_CR54","unstructured":"Vatshelle, M.: New Width Parameters of Graphs. Ph.D. thesis, University of Bergen (2012)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:00:57Z","timestamp":1710266457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}