{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:30:23Z","timestamp":1743039023922,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_29","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"382-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Output-Sensitive Enumeration of\u00a0Potential Maximal Cliques in\u00a0Polynomial Space"],"prefix":"10.1007","author":[{"given":"Caroline","family":"Brosse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0770-2235","authenticated-orcid":false,"given":"Alessio","family":"Conte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9133-7009","authenticated-orcid":false,"given":"Vincent","family":"Limouzy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8738-1595","authenticated-orcid":false,"given":"Giulia","family":"Punzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1273-2770","authenticated-orcid":false,"given":"Davide","family":"Rucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"29_CR1","unstructured":"Bergougnoux, B., Kant\u00e9, M.M., Wasa, K.: Disjunctive minimal separators enumeration. WEPA (2019). https:\/\/www.mimuw.edu.pl\/~bbergougnoux\/pdf\/bkw19.pdf"},{"issue":"03","key":"29_CR2","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1142\/S0129054100000211","volume":"11","author":"A Berry","year":"2000","unstructured":"Berry, A., Bordat, J.P., Cogis, O.: Generating all the minimal separators of a graph. Int. J. Found. Comput. Sci. 11(03), 397\u2013403 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-68530-8_29","volume-title":"Algorithms \u2014 ESA\u2019 98","author":"V Bouchitt\u00e9","year":"1998","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Minimal triangulations for graphs with \u201cfew\u2019\u2019 minimal separators. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 344\u2013355. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-68530-8_29"},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212\u2013232 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"29_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(01)00007-X","volume":"276","author":"V Bouchitt\u00e9","year":"2002","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theoret. Comput. Sci. 276(1\u20132), 17\u201332 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR6","unstructured":"Brosse, C., Limouzy, V., Mary, A.: Polynomial delay algorithm for minimal chordal completions. In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 4\u20138 July 2022, Paris, France. LIPIcs, vol.\u00a0229, pp. 33:1\u201333:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.dam.2020.05.034","volume":"303","author":"N Carmeli","year":"2021","unstructured":"Carmeli, N., Kenig, B., Kimelfeld, B., Kr\u00f6ll, M.: Efficiently enumerating minimal triangulations. Discret. Appl. Math. 303, 216\u2013236 (2021)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1137\/19M1249473","volume":"34","author":"M Chudnovsky","year":"2020","unstructured":"Chudnovsky, M., Pilipczuk, M., Pilipczuk, M., Thomass\u00e9, S.: On the maximum weight independent set problem in graphs without induced cycles of length at least five. SIAM J. Discrete Math. 34(2), 1472\u20131483 (2020). https:\/\/doi.org\/10.1137\/19M1249473","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/140964801","volume":"44","author":"FV Fomin","year":"2015","unstructured":"Fomin, F.V., Todinca, I., Villanger, Y.: Large induced subgraphs via triangulations and CMSO. SIAM J. Comput. 44(1), 54\u201387 (2015). https:\/\/doi.org\/10.1137\/140964801","journal-title":"SIAM J. Comput."},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-70575-8_18","volume-title":"Automata, Languages and Programming","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 210\u2013221. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_18"},{"key":"29_CR11","doi-asserted-by":"publisher","unstructured":"Grzesik, A., Klimosov\u00e1, T., Pilipczuk, M., Pilipczuk, M.: Polynomial-time algorithm for maximum weight independent set on $$P_6$$-free graphs. In: Chan, T.M. (ed.) Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, 6\u20139 January 2019, pp. 1257\u20131271. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.77","DOI":"10.1137\/1.9781611975482.77"},{"key":"29_CR12","doi-asserted-by":"publisher","unstructured":"Korhonen, T.: Finding optimal triangulations parameterized by edge clique cover. In: Cao, Y., Pilipczuk, M. (eds.) 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0180, pp. 22:1\u201322:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2020.22","DOI":"10.4230\/LIPIcs.IPEC.2020.22"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Korhonen, T., Berg, J., J\u00e4rvisalo, M.: Enumerating potential maximal cliques via sat and asp. In: Proceedings of the twenty-eigth International Joint Conference on Artificial Intelligence (IJCAI 2019). International Joint Conferences on Artifical Intelligence (2019)","DOI":"10.24963\/ijcai.2019\/156"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3301297","volume":"24","author":"T Korhonen","year":"2019","unstructured":"Korhonen, T., Berg, J., J\u00e4rvisalo, M.: Solving graph problems via potential maximal cliques: An experimental evaluation of the bouchitt\u00e9-todinca algorithm. J. Exp. Algorithmics (JEA) 24, 1\u201319 (2019)","journal-title":"J. Exp. Algorithmics (JEA)"},{"issue":"3","key":"29_CR15","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1007\/s00453-018-0453-2","volume":"81","author":"M Liedloff","year":"2019","unstructured":"Liedloff, M., Montealegre, P., Todinca, I.: Beyond classes of graphs with \u201cfew\u2019\u2019 minimal separators: FPT results through potential maximal cliques. Algorithmica 81(3), 986\u20131005 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0453-2","journal-title":"Algorithmica"},{"key":"29_CR16","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Vatshelle, M., Villanger, Y.: Independent set in P$${}_{\\text{5}}$$-free graphs in polynomial time. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5\u20137 January 2014, pp. 570\u2013581. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.43","DOI":"10.1137\/1.9781611973402.43"},{"issue":"15","key":"29_CR17","doi-asserted-by":"publisher","first-page":"1660","DOI":"10.1016\/j.dam.2010.05.013","volume":"158","author":"K Takata","year":"2010","unstructured":"Takata, K.: Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph. Discret. Appl. Math. 158(15), 1660\u20131667 (2010)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:16:55Z","timestamp":1718975815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}