{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:26:26Z","timestamp":1787505986113,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031630200","type":"print"},{"value":"9783031630217","type":"electronic"}],"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_18","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T09:02:29Z","timestamp":1718960549000},"page":"232-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Enumerating Minimal Vertex Covers and\u00a0Dominating Sets with\u00a0Capacity and\/or Connectivity Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3244-6915","authenticated-orcid":false,"given":"Yasuaki","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7638-3322","authenticated-orcid":false,"given":"Kazuhiro","family":"Kurita","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0790-1425","authenticated-orcid":false,"given":"Yasuko","family":"Matsui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0845-3947","authenticated-orcid":false,"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., Fernau, H., Gras, B., Liedloff, M., Mann, K.: Enumerating minimal connected dominating sets. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) 30th Annual European Symposium on Algorithms, ESA 2022. LIPIcs, Berlin\/Potsdam, Germany, 5\u20139 September 2022, vol. 244, pp. 1:1\u20131:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)","DOI":"10.1007\/978-3-031-15914-5_1"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-57155-8_242","volume-title":"Algorithms and Data Structures","author":"H Balakrishnan","year":"1993","unstructured":"Balakrishnan, H., Rajaraman, A., Rangan, C.P.: Connected domination and steiner set on asteroidal triple-free graphs. In: Dehne, F., Sack, J.-R., Santoro, N., Whitesides, S. (eds.) WADS 1993. LNCS, vol. 709, pp. 131\u2013141. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57155-8_242"},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1995.1157","volume":"123","author":"JC Bioch","year":"1995","unstructured":"Bioch, J.C., Ibaraki, T.: Complexity of identification and dualization of positive Boolean functions. Inf. Comput. 123(1), 50\u201363 (1995)","journal-title":"Inf. Comput."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Defrain, O., Heinrich, M., Pilipczuk, M., Raymond, J.-F.: Enumerating minimal dominating sets in $$k_t$$-free graphs and variants. ACM Trans. Algorithms 16(3):39:1\u201339:23 (2020)","DOI":"10.1145\/3386686"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-73545-8_23","volume-title":"Computing and Combinatorics","author":"E Boros","year":"2007","unstructured":"Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K., Rudolf, G.: Generating minimal k-vertex connected spanning subgraphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 222\u2013231. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73545-8_23"},{"issue":"9","key":"18_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"issue":"7","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1016\/j.jcss.2008.04.003","volume":"74","author":"S Cohen","year":"2008","unstructured":"Cohen, S., Kimelfeld, B., Sagiv, Y.: Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties. J. Comput. Syst. Sci. 74(7), 1147\u20131159 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"18_CR8","doi-asserted-by":"publisher","first-page":"1580","DOI":"10.1137\/20M1375048","volume":"51","author":"A Conte","year":"2022","unstructured":"Conte, A., Grossi, R., Marino, A., Uno, T., Versari, L.: Proximity search for maximal subgraph enumeration. SIAM J. Comput. 51(5), 1580\u20131625 (2022)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1007\/s00453-019-00656-8","volume":"82","author":"A Conte","year":"2020","unstructured":"Conte, A., Grossi, R., Marino, A., Versari, L.: Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs. Algorithmica 82(6), 1547\u20131573 (2020)","journal-title":"Algorithmica"},{"key":"18_CR10","unstructured":"Conte, A., De Virgilio, R., Maccioni, A., Patrignani, M., Torlone, R.: Finding all maximal cliques in very large social networks. In: Pitoura, E., et al. (eds.) Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, 15\u201316 March 2016, pp. 173\u2013184. OpenProceedings.org (2016)"},{"issue":"12","key":"18_CR11","doi-asserted-by":"publisher","first-page":"2675","DOI":"10.1016\/j.dam.2008.08.021","volume":"157","author":"B Courcelle","year":"2009","unstructured":"Courcelle, B.: Linear delay enumeration and monadic second-order logic. Discrete Appl. Math. 157(12), 2675\u20132700 (2009)","journal-title":"Discrete Appl. Math."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-31155-0_9","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"M Cygan","year":"2012","unstructured":"Cygan, M.: Deterministic parameterized connected vertex cover. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 95\u2013106. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_9"},{"issue":"6","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45757-7_53","volume-title":"Logics in Artificial Intelligence","author":"T Eiter","year":"2002","unstructured":"Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 549\u2013564. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45757-7_53"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32(2), 514\u2013537 (2003)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"18_CR16","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.1016\/j.dam.2007.04.017","volume":"156","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: a brief survey. Discrete Appl. Math. 156(11), 2035\u20132049 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jda.2009.01.005","volume":"8","author":"B Escoffier","year":"2010","unstructured":"Escoffier, B., Gourv\u00e8s, L., Monnot, J.: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1), 36\u201349 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"10","key":"18_CR18","first-page":"63","volume":"8","author":"H Fernau","year":"2018","unstructured":"Fernau, H., Golovach, P.A., Sagot, M.-F.: Algorithmic enumeration: output-sensitive, input-sensitive, parameterized, approximative (Dagstuhl Seminar 18421). Dagstuhl Rep. 8(10), 63\u201386 (2018)","journal-title":"Dagstuhl Rep."},{"issue":"2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than $$2^n$$. Algorithmica 52(2), 153\u2013166 (2008)","journal-title":"Algorithmica"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/18M1210459","volume":"49","author":"J Fox","year":"2020","unstructured":"Fox, J., Roughgarden, T., Seshadhri, C., Wei, F., Wein, N.: Finding cliques in social networks: a new distribution-free model. SIAM J. Comput. 49(2), 448\u2013464 (2020)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"18_CR21","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.ejc.2017.07.015","volume":"68","author":"PA Golovach","year":"2018","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D.: Enumeration and maximum number of minimal connected vertex covers in graphs. Eur. J. Comb. 68, 132\u2013147 (2018)","journal-title":"Eur. J. Comb."},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-39206-1_41","volume-title":"Automata, Languages, and Programming","author":"PA Golovach","year":"2013","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Villanger, Y.: An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 485\u2013496. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_41"},{"issue":"4","key":"18_CR24","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"issue":"4","key":"18_CR25","doi-asserted-by":"publisher","first-page":"1916","DOI":"10.1137\/120862612","volume":"28","author":"MM Kant\u00e9","year":"2014","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions. SIAM J. Discrete Math. 28(4), 1916\u20131929 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-662-53174-7_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MM Kant\u00e9","year":"2016","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 138\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_11"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-21840-3_37","volume-title":"Algorithms and Data Structures","author":"MM Kant\u00e9","year":"2015","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: Polynomial delay algorithm for listing minimal edge dominating sets in graphs. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 446\u2013457. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_37"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11841036_41","volume-title":"Algorithms \u2013 ESA 2006","author":"L Khachiyan","year":"2006","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K.: Enumerating spanning and connected subsets in graphs and matroids. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 444\u2013455. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841036_41"},{"key":"18_CR29","unstructured":"Kobayashi, Y., Kurita, K., Wasa, K.: Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints. CoRR, abs\/2009.08830 (2020)"},{"key":"18_CR30","unstructured":"Kobayashi, Y., Kurita, K., Wasa, K.: Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond. CoRR, abs\/2307.08948 (2023)"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260\u2013272. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27810-8_23"},{"issue":"1\u20133","key":"18_CR32","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0166-218X(00)00339-5","volume":"117","author":"B Schwikowski","year":"2002","unstructured":"Schwikowski, B., Speckenmeyer, E.: On enumerating all minimal solutions of feedback problems. Discrete Appl. Math. 117(1\u20133), 253\u2013265 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"18_CR33","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"18_CR34","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"18_CR35","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S Ueno","year":"1988","unstructured":"Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discrete Math. 72(1\u20133), 355\u2013360 (1988)","journal-title":"Discrete 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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T09:13:01Z","timestamp":1718961181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}