{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:01:06Z","timestamp":1742940066289,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"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_9","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hypergraph Dualization with\u00a0$$\\textsf{FPT}$$-delay Parameterized by\u00a0the\u00a0Degeneracy and\u00a0Dimension"],"prefix":"10.1007","author":[{"given":"Valentin","family":"Bartier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Defrain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fionn","family":"Mc Inerney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/s00453-008-9204-0","volume":"54","author":"N Alon","year":"2009","unstructured":"Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica 54(4), 544\u2013556 (2009)","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1017\/S0963548309990587","volume":"19","author":"A Bar-Noy","year":"2010","unstructured":"Bar-Noy, A., Cheilaris, P., Olonetsky, S., Smorodinsky, S.: Online conflict-free colouring for hypergraphs. Comb. Probab. Comput. 19(4), 493\u2013516 (2010)","journal-title":"Comb. Probab. Comput."},{"key":"9_CR3","unstructured":"Berge, C.: Hypergraphs: combinatorics of finite sets, North-Holland Mathematical Library, vol.\u00a045. Elsevier (1984)"},{"key":"9_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 (TALG) 16(3), 39:1\u201339:23 (2020)","DOI":"10.1145\/3386686"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Defrain, O., Heinrich, M., Raymond, J.F.: Enumerating minimal dominating sets in triangle-free graphs. In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0126, pp. 16:1\u201316:12. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2019)","DOI":"10.1145\/3386686"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Defrain, O., Micek, P., Nourine, L.: Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. arXiv preprint arXiv:2004.07214 (2020)","DOI":"10.1145\/3386686"},{"key":"9_CR7","unstructured":"Boros, E., Makino, K.: Generating maximal irredundant and minimal redundant subfamilies of a given hypergraph. In: WEPA 2016 & Boolean Seminar 2017 (2016). http:\/\/clp.mff.cuni.cz\/booleanseminar\/presentations\/endre.pdf"},{"key":"9_CR8","unstructured":"Capelli, F., Strozecki, Y.: Geometric amortization of enumeration algorithms. In: 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"issue":"7","key":"9_CR9","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."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-25005-8_13","volume-title":"Combinatorial Algorithms","author":"A Conte","year":"2019","unstructured":"Conte, A., Kant\u00e9, M.M., Marino, A., Uno, T.: Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 148\u2013159. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_13"},{"issue":"9","key":"9_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3390\/a12090189","volume":"12","author":"N Creignou","year":"2019","unstructured":"Creignou, N., Ktari, R., Meier, A., M\u00fcller, J.S., Olive, F., Vollmer, H.: Parameterised enumeration for modification problems. Algorithms 12(9), 189 (2019)","journal-title":"Algorithms"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s00224-016-9702-4","volume":"60","author":"N Creignou","year":"2017","unstructured":"Creignou, N., Meier, A., M\u00fcller, J.S., Schmidt, J., Vollmer, H.: Paradigms for parameterized enumeration. Theor. Comput. Syst. 60, 737\u2013758 (2017)","journal-title":"Theor. Comput. Syst."},{"key":"9_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoret. Comput. Sci. 351(3), 337\u2013350 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-662-53536-3_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"K Dutta","year":"2016","unstructured":"Dutta, K., Ghosh, A.: On subgraphs of bounded degeneracy in hypergraphs. In: Heggernes, P. (ed.) WG 2016. LNCS, vol. 9941, pp. 295\u2013306. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53536-3_25"},{"issue":"6","key":"9_CR16","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":"9_CR17","doi-asserted-by":"crossref","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 14\u201322 (2002)","DOI":"10.1145\/509907.509912"},{"issue":"2","key":"9_CR18","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":"9_CR19","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. Discret. Appl. Math. 156(11), 2035\u20132049 (2008)","journal-title":"Discret. Appl. Math."},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-79723-4_10","volume-title":"Parameterized and Exact Computation","author":"K Elbassioni","year":"2008","unstructured":"Elbassioni, K., Hagen, M., Rauf, I.: Some fixed-parameter tractable classes of hypergraph duality and related problems. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 91\u2013102. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79723-4_10"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Fernau, H.: On parameterized enumeration. In: Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, pp. 564\u2013573. Springer, Cham (2002)","DOI":"10.1007\/3-540-45655-4_60"},{"key":"9_CR22","unstructured":"Fernau, H., Golovach, P.A., Sagot, M.F.: Algorithmic enumeration: output-sensitive, input-sensitive, parameterized, approximative (dagstuhl seminar 18421). In: Dagstuhl Reports, vol.\u00a08, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"issue":"3","key":"9_CR23","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"},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/s00453-017-0289-1","volume":"80","author":"PA Golovach","year":"2018","unstructured":"Golovach, P.A., Heggernes, P., Kant\u00e9, M.M., Kratsch, D., S\u00e6ther, S.H., Villanger, Y.: Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Algorithmica 80(2), 714\u2013741 (2018)","journal-title":"Algorithmica"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.dam.2014.12.010","volume":"199","author":"PA Golovach","year":"2016","unstructured":"Golovach, P.A., Heggernes, P., Kant\u00e9, M.M., Kratsch, D., Villanger, Y.: Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199, 30\u201336 (2016)","journal-title":"Discret. Appl. Math."},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.jcss.2021.07.005","volume":"123","author":"PA Golovach","year":"2022","unstructured":"Golovach, P.A., Komusiewicz, C., Kratsch, D., Le, V.B.: Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123, 76\u2013102 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Mannila, H., Khardon, R., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: PODS, pp. 209\u2013216. ACM (1997)","DOI":"10.1145\/263661.263684"},{"issue":"3","key":"9_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9_CR29","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. Discret. Math. 28(4), 1916\u20131929 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"9_CR30","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":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-57568-5_271","volume-title":"Algorithms and Computation","author":"D Kavvadias","year":"1993","unstructured":"Kavvadias, D., Papadimitriou, C.H., Sideri, M.: On horn envelopes and hypergraph transversals. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 399\u2013405. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57568-5_271"},{"issue":"2","key":"9_CR32","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2007.03.005","volume":"382","author":"L Khachiyan","year":"2007","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V.: On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theoret. Comput. Sci. 382(2), 139\u2013150 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"9_CR33","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/070698385","volume":"22","author":"AV Kostochka","year":"2008","unstructured":"Kostochka, A.V., Zhu, X.: Adapted list coloring of graphs and hypergraphs. SIAM J. Discret. Math. 22(1), 398\u2013408 (2008)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"9_CR34","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"key":"9_CR35","unstructured":"Meier, A.: Enumeration in incremental FPT-time. arXiv preprint arXiv:1804.07799 (2018)"},{"issue":"5","key":"9_CR36","doi-asserted-by":"publisher","first-page":"122","DOI":"10.3390\/a13050122","volume":"13","author":"A Meier","year":"2020","unstructured":"Meier, A.: Incremental FPT delay. Algorithms 13(5), 122 (2020)","journal-title":"Algorithms"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Ne\u0161et\u0159il, J., Ossona\u00a0de Mendez, P.: Sparsity: graphs, structures, and algorithms, vol.\u00a028. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"key":"9_CR38","unstructured":"Nourine, L., Petit, J.M.: Extending set-based dualization: application to pattern mining. In: Proceedings of the 20th European Conference on Artificial Intelligence, pp. 630\u2013635. IOS Press (2012)"},{"issue":"1","key":"9_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2390176.2390187","volume":"9","author":"G Philip","year":"2012","unstructured":"Philip, G., Raman, V., Sikdar, S.: Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Trans. Algorithms (TALG) 9(1), 1\u201323 (2012)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Shahrokhi, F.: Bounding the trace function of a hypergraph with applications. In: Hoffman, F. (eds.) Combinatorics, Graph Theory and Computing. SEICCGTC 2020. Springer Proceedings in Mathematics Statistics, vol. 388, pp. 117\u2013126. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-05375-7_8","DOI":"10.1007\/978-3-031-05375-7_8"},{"key":"9_CR41","unstructured":"Strozecki, Y.: Enumeration complexity. Bull. EATCS 1(129) (2019)"},{"issue":"3","key":"9_CR42","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."},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-13075-0_8","volume-title":"Algorithms and Computation","author":"K Wasa","year":"2014","unstructured":"Wasa, K., Arimura, H., Uno, T.: Efficient enumeration of induced subtrees in a k-degenerate graph. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 94\u2013102. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_8"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:10:09Z","timestamp":1718975409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_9","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"}}]}}