{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:13:03Z","timestamp":1777540383419,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:00:00Z","timestamp":1672963200000},"content-version":"vor","delay-in-days":1466,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["GraphEn\/ANR-15-CE40-0009"],"award-info":[{"award-number":["GraphEn\/ANR-15-CE40-0009"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00c3\u00a5d","doi-asserted-by":"publisher","award":["249994"],"award-info":[{"award-number":["249994"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1016\/j.tcs.2018.02.014","type":"journal-article","created":{"date-parts":[[2018,2,15]],"date-time":"2018-02-15T13:42:53Z","timestamp":1518702173000},"page":"3-15","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Enumeration of maximal irredundant sets for claw-free graphs"],"prefix":"10.1016","volume":"754","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Yosri","family":"Sayadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/j.tcs.2018.02.014_br0010","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.ipl.2016.07.002","article-title":"Enumerating minimal dominating sets in chordal graphs","volume":"116","author":"Abu-Khzam","year":"2016","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/j.tcs.2018.02.014_br0020","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.jda.2011.03.002","article-title":"Breaking the 2n-barrier for irredundance: two lines of attack","volume":"9","author":"Binkele-Raible","year":"2011","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"10.1016\/j.tcs.2018.02.014_br0030","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","article-title":"A fast branching algorithm for cluster vertex deletion","volume":"58","author":"Boral","year":"2016","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"10.1016\/j.tcs.2018.02.014_br0040","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1016\/j.jctb.2008.03.002","article-title":"Claw-free graphs, V: global structure","volume":"98","author":"Chudnovsky","year":"2008","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"10.1016\/j.tcs.2018.02.014_br0050","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(81)90268-5","article-title":"Contributions to the theory of domination, independence and irredundance in graphs","volume":"33","author":"Cockayne","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2018.02.014_br0060","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.tcs.2013.03.026","article-title":"Minimal dominating sets in graph classes: combinatorial bounds and enumeration","volume":"487","author":"Couturier","year":"2013","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2018.02.014_br0070","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.tcs.2014.11.006","article-title":"On the number of minimal dominating sets on some graph classes","volume":"562","author":"Couturier","year":"2015","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2018.02.014_br0080","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0895480191199026","article-title":"The private neighbor cube","volume":"7","author":"Fellows","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2018.02.014_br0090","series-title":"Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing","first-page":"764","article-title":"Exact algorithms via monotone local search","author":"Fomin","year":"2016"},{"issue":"1","key":"10.1016\/j.tcs.2018.02.014_br0100","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1435375.1435384","article-title":"Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications","volume":"5","author":"Fomin","year":"2008","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2018.02.014_br0110","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","article-title":"Exact Exponential Algorithms","author":"Fomin","year":"2010"},{"key":"10.1016\/j.tcs.2018.02.014_br0120","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.dam.2014.12.010","article-title":"Enumerating minimal dominating sets in chordal bipartite graphs","volume":"199","author":"Golovach","year":"2016","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.tcs.2018.02.014_br0130","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1007\/s00453-014-9875-7","article-title":"An incremental polynomial time algorithm to enumerate all minimal edge dominating sets","volume":"72","author":"Golovach","year":"2015","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2018.02.014_br0140","series-title":"Graph-Theoretic Concepts in Computer Science \u2013 43rd International Workshop","first-page":"289","article-title":"Enumeration and maximum number of maximal irredundant sets for chordal graphs","volume":"vol. 10520","author":"Golovach","year":"2017"},{"key":"10.1016\/j.tcs.2018.02.014_br0150","series-title":"Algorithms and Complexity \u2013 10th International Conference, Proceedings","first-page":"297","article-title":"Enumeration of maximal irredundant sets for claw-free graphs","volume":"vol. 10236","author":"Golovach","year":"2017"},{"key":"10.1016\/j.tcs.2018.02.014_br0160","series-title":"Domination in Graphs: Advanced Topics","author":"Haynes","year":"1997"},{"key":"10.1016\/j.tcs.2018.02.014_br0170","article-title":"Fundamentals of Domination in Graphs","volume":"vol. 208","author":"Haynes","year":"1998"},{"key":"10.1016\/j.tcs.2018.02.014_br0180","series-title":"Proceedings of the Sixteenth Southeastern International Conference on Combinatorics, Graph Theory and Computing","first-page":"183","article-title":"Irredundance in graphs: a survey","volume":"vol. 48","author":"Hedetniemi","year":"1985"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2018.02.014_br0190","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90349-M","article-title":"Chordal graphs and upper irredundance, upper domination and independence","volume":"86","author":"Jacobson","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2018.02.014_br0200","series-title":"Fundamentals of Computation Theory \u2013 18th International Symposium, Proceedings","first-page":"298","article-title":"Enumeration of minimal dominating sets and variants","volume":"vol. 6914","author":"Kant\u00e9","year":"2011"},{"key":"10.1016\/j.tcs.2018.02.014_br0210","series-title":"Algorithms and Computation \u2013 23rd International Symposium, Proceedings","first-page":"289","article-title":"On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets","volume":"vol. 7676","author":"Kant\u00e9","year":"2012"},{"issue":"4","key":"10.1016\/j.tcs.2018.02.014_br0220","doi-asserted-by":"crossref","first-page":"1916","DOI":"10.1137\/120862612","article-title":"On the enumeration of minimal dominating sets and related notions","volume":"28","author":"Kant\u00e9","year":"2014","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2018.02.014_br0230","series-title":"Algorithms and Computation \u2013 24th International Symposium, Proceedings","first-page":"339","article-title":"On the enumeration and counting of minimal dominating sets in interval and permutation graphs","volume":"vol. 8283","author":"Kant\u00e9","year":"2013"},{"key":"10.1016\/j.tcs.2018.02.014_br0240","series-title":"Algorithms and Data Structures \u2013 14th International Symposium, Proceedings","first-page":"446","article-title":"Polynomial delay algorithm for listing minimal edge dominating sets in graphs","volume":"vol. 9214","author":"Kant\u00e9","year":"2015"},{"issue":"8","key":"10.1016\/j.tcs.2018.02.014_br0250","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.ipl.2013.01.020","article-title":"Trees having many minimal dominating sets","volume":"113","author":"Krzywkowski","year":"2013","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2018.02.014_br0260","unstructured":"R. Laskar, J. Pfaff, Domination and irredundance in graphs, 1983."},{"issue":"3","key":"10.1016\/j.tcs.2018.02.014_br0270","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.tcs.2018.02.014_br0280","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397518300999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397518300999?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:57:27Z","timestamp":1759625847000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397518300999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":28,"alternative-id":["S0304397518300999"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.tcs.2018.02.014","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enumeration of maximal irredundant sets for claw-free graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.tcs.2018.02.014","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}