{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:06:14Z","timestamp":1777539974714,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642450297","type":"print"},{"value":"9783642450303","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_32","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T21:32:52Z","timestamp":1386797572000},"page":"339-349","source":"Crossref","is-referenced-by-count":11,"title":["On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs"],"prefix":"10.1007","author":[{"given":"Mamadou Moustapha","family":"Kant\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Limouzy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Mary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics. Springer (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comput. Syst. Sci.\u00a013(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Bang Le, V., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, vol.\u00a03. Society for Industrial and Applied Mathematics (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0166-218X(98)00145-0","volume":"102","author":"H.S. Chao","year":"2000","unstructured":"Chao, H.S., Hsu, F.-R., Lee, R.C.T.: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. Discrete Applied Mathematics\u00a0102(3), 159\u2013173 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"32_CR5","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.\u00a024(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"32_CR6","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.\u00a032(2), 514\u2013537 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"32_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1435375.1435384","volume":"5","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algorithms\u00a05(1), 1\u201317 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: PODS, pp. 209\u2013216 (1997)","DOI":"10.1145\/263661.263684"},{"key":"32_CR9","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Pure and Applied Mathematics, vol.\u00a0208. Marcel Dekker (1998)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-22953-4_26","volume-title":"Fundamentals of Computation Theory","author":"M.M. Kant\u00e9","year":"2011","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: Enumeration of minimal dominating sets and variants. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol.\u00a06914, pp. 298\u2013309. Springer, Heidelberg (2011)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions. In: Submitted (2012)","DOI":"10.1007\/978-3-642-22953-4_26"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-35261-4_32","volume-title":"Algorithms and Computation","author":"M.M. Kant\u00e9","year":"2012","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets. In: Chao, K.-M., Hsu, T.-s., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 289\u2013298. Springer, Heidelberg (2012)"},{"issue":"16","key":"32_CR13","doi-asserted-by":"publisher","first-page":"2350","DOI":"10.1016\/j.dam.2006.04.012","volume":"154","author":"L. Khachiyan","year":"2006","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K.M., Gurvich, V.: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discrete Applied Mathematics\u00a0154(16), 2350\u20132372 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-3","key":"32_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201(1-3), 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"key":"32_CR15","volume-title":"ECAI","author":"L. Nourine","year":"2012","unstructured":"Nourine, L., Petit, J.-M.: Extending set-based dualization: Application to pattern mining. In: ECAI. IOS Press, Montpellier (2012)"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1137\/S0097539792238431","volume":"27","author":"M.S. Chang","year":"1998","unstructured":"Chang, M.S.: Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput.\u00a027, 1671\u20131694 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T06:45:13Z","timestamp":1558766713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}