{"id":"https://openalex.org/W7110059344","doi":"https://doi.org/10.4230/lipics.wads.2025.15","title":"Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite Graphs","display_name":"Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110059344","doi":"https://doi.org/10.4230/lipics.wads.2025.15"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24246","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.15/LIPIcs.WADS.2025.15.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.15/LIPIcs.WADS.2025.15.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Castelo, Emanuel","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I4210114274","display_name":"Laboratoire d\u2019Informatique et Syst\u00e8mes","ror":"https://ror.org/0257sgk90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I143002897","https://openalex.org/I21491767","https://openalex.org/I4210114274"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Castelo, Emanuel","raw_affiliation_strings":["Aix-Marseille Universit\u00e9, CNRS, LIS, Marseille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aix-Marseille Universit\u00e9, CNRS, LIS, Marseille, France","institution_ids":["https://openalex.org/I21491767","https://openalex.org/I4210114274","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Defrain, Oscar","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I4210114274","display_name":"Laboratoire d\u2019Informatique et Syst\u00e8mes","ror":"https://ror.org/0257sgk90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I143002897","https://openalex.org/I21491767","https://openalex.org/I4210114274"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Defrain, Oscar","raw_affiliation_strings":["Aix-Marseille Universit\u00e9, CNRS, LIS, Marseille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aix-Marseille Universit\u00e9, CNRS, LIS, Marseille, France","institution_ids":["https://openalex.org/I21491767","https://openalex.org/I4210114274","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":null,"display_name":"C. M. Gomes, Guilherme","orcid":null},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["BR","FR"],"is_corresponding":false,"raw_author_name":"C. M. Gomes, Guilherme","raw_affiliation_strings":["LIRMM, Universit\u00e9 de Montpellier, CNRS, Montpellier, France; Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIRMM, Universit\u00e9 de Montpellier, CNRS, Montpellier, France; Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I21491767","https://openalex.org/I4210114274"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.638131,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.774399995803833,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.774399995803833,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.04149999842047691,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.02459999918937683,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8210999965667725},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7031000256538391},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5734999775886536},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5156999826431274},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4620000123977661},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.3441999852657318},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.3305000066757202}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8210999965667725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8098000288009644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7792999744415283},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7031000256538391},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5734999775886536},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5473999977111816},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5156999826431274},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4620000123977661},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.3305000066757202},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.3098999857902527},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.2711000144481659},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2703000009059906},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.26339998841285706},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.2531999945640564},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24246","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.15/LIPIcs.WADS.2025.15.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:HAL:hal-05534675v1","is_oa":false,"landing_page_url":"https://amu.hal.science/hal-05534675","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WADS 2025 - 19th International Symposium on Algorithms and Data Structures, Aug 2025, Toronto, Canada. pp.15:1-15:15, &#x27E8;10.4230/LIPIcs.WADS.2025.15&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24246","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.15/LIPIcs.WADS.2025.15.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2388644388","display_name":null,"funder_award_id":"101109317","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3707117494","display_name":"Parameterized aspects of Dualization","funder_award_id":"ANR-24-CE48-0610","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110059344.pdf","grobid_xml":"https://content.openalex.org/works/W7110059344.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Enumerating":[0],"minimal":[1,58,129,140,151],"dominating":[2,59,99,130,142],"sets":[3,60,143],"with":[4,26],"polynomial":[5,52,75],"delay":[6,53,78],"in":[7,41,61,118,144,153],"bipartite":[8,22,63,125,145],"graphs":[9,23,126,146],"is":[10,24,147],"a":[11,51,91],"long-standing":[12],"open":[13,104],"problem.":[14],"To":[15],"date,":[16],"even":[17],"the":[18,27,69,82,107,115],"subcase":[19],"of":[20,90],"chordal":[21,62],"open,":[25],"best":[28],"known":[29],"algorithm":[30,56],"due":[31],"to":[32,124],"Golovach,":[33],"Heggernes,":[34],"Kant\u00e9,":[35],"Kratsch,":[36],"S\u00e6ther,":[37],"and":[38,54,71,76,101,136],"Villanger":[39],"running":[40],"incremental-polynomial":[42,77],"time.":[43],"We":[44],"improve":[45],"on":[46],"this":[47,119],"result":[48,92],"by":[49,93],"providing":[50],"space":[55],"enumerating":[57,139,150],"graphs.":[64],"Additionally,":[65],"we":[66,111],"show":[67,137],"that":[68,114,138],"total":[70,98],"connected":[72,108,141],"variants":[73],"admit":[74],"algorithms,":[79],"respectively,":[80],"within":[81],"same":[83],"class.":[84],"This":[85],"provides":[86],"an":[87,103],"alternative":[88],"proof":[89],"Golovach":[94],"et":[95],"al.":[96],"for":[97,106,127],"sets,":[100,131],"answers":[102],"question":[105],"variant.":[109],"Finally,":[110],"give":[112],"evidence":[113],"techniques":[116],"used":[117],"paper":[120],"cannot":[121],"be":[122],"generalized":[123],"(total)":[128],"unless":[132],"P":[133],"=":[134],"NP,":[135],"harder":[148],"than":[149],"transversals":[152],"general":[154],"hypergraphs.":[155]},"counts_by_year":[],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-12-08T00:00:00"}
