{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:40:50Z","timestamp":1762908050656,"version":"3.45.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031929342"},{"type":"electronic","value":"9783031929359"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-92935-9_19","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:07:15Z","timestamp":1747454835000},"page":"299-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Atoms Versus Avoiding Simplicial Vertices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1336-9802","authenticated-orcid":false,"given":"Karl","family":"Boddy","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9515-6945","authenticated-orcid":false,"given":"Konrad K.","family":"Dabrowski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"issue":"1\u20133","key":"19_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. Discret. Appl. Math. 132(1\u20133), 17\u201326 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"7","key":"19_CR2","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. Discret. Appl. Math. 159(7), 509\u2013520 (2011)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"19_CR3","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)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1002\/jgt.23000","volume":"104","author":"KK Dabrowski","year":"2023","unstructured":"Dabrowski, K.K., Masa\u0159\u00edk, T., Novotn\u00e1, J., Paulusma, D., Rz\u0105\u017cewski, P.: Clique-width: harnessing the power of atoms. J. Graph Theory 104(4), 769\u2013810 (2023)","journal-title":"J. Graph Theory"},{"issue":"1\u20132","key":"19_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abh. Math. Semin. Univ. Hambg. 25(1\u20132), 71\u201376 (1961)","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"key":"19_CR6","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"},{"key":"19_CR7","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"19_CR8","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. Theoret. Comput. Sci. 299(1), 719\u2013734 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"2\u20133","key":"19_CR9","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. Discret. Appl. Math. 126(2\u20133), 197\u2013221 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"03","key":"19_CR10","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)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: Paw-free graphs. Inf. Process. Lett. 28(1), 53\u201354 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"19_CR12","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. Theoret. Comput. Sci. 377(1\u20133), 260\u2013267 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1002\/jgt.3190120313","volume":"12","author":"Y Shibata","year":"1988","unstructured":"Shibata, Y.: On the tree representation of chordal graphs. J. Graph Theory 12(3), 421\u2013428 (1988)","journal-title":"J. Graph Theory"},{"issue":"2","key":"19_CR14","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. Discret. Math. 55(2), 221\u2013232 (1985)","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92935-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:37:18Z","timestamp":1762907838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92935-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929342","9783031929359"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92935-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}