{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T21:39:19Z","timestamp":1785274759372,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642276590","type":"print"},{"value":"9783642276606","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_17","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T10:14:28Z","timestamp":1326708868000},"page":"202-213","source":"Crossref","is-referenced-by-count":6,"title":["Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Couturier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pim","family":"van\u2019t Hof","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.7155\/jgaa.00064","volume":"7","author":"D. Eppstein","year":"2003","unstructured":"Eppstein, D.: Small maximal independent sets and faster exact graph coloring. J.\u00a0Graph Algor.\u00a0Appl.\u00a07(2), 131\u2013140 (2003)","journal-title":"J.\u00a0Graph Algor.\u00a0Appl."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00453-007-9152-0","volume":"52","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica\u00a052(2), 293\u2013307 (2008)","journal-title":"Algorithmica"},{"key":"17_CR4","doi-asserted-by":"crossref","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) (2008)","DOI":"10.1145\/1435375.1435384"},{"key":"17_CR5","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. Springer, Heidelberg (2010)"},{"key":"17_CR6","unstructured":"Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Proceedings of STACS 2010, pp. 383\u2013394 (2010)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-15775-2_23","volume-title":"Algorithms \u2013 ESA 2010","author":"S. Gaspers","year":"2010","unstructured":"Gaspers, S., Mnich, M.: Feedback Vertex Sets in Tournaments. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 267\u2013277. Springer, Heidelberg (2010)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Disc. Math.\u00a057 (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"17_CR9","volume-title":"Domination in graphs","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T. (eds.): Domination in graphs. Marcel Dekker Inc., New York (1998)"},{"key":"17_CR10","unstructured":"Laskar, R.C., Pfaff, J.: Domination and irredundance in split graphs. Technical Report 430, Clemson University (1983)"},{"key":"17_CR11","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)"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0190(94)90054-X","volume":"49","author":"H. Kaplan","year":"1994","unstructured":"Kaplan, H., Shamir, R.: The domatic number problem on some perfect graph families. Inform. Proc. Lett.\u00a049(1), 51\u201356 (1994)","journal-title":"Inform. Proc. Lett."},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: A note on the complexity of the chromatic number problem. Inform. Proc. Lett.\u00a05(3), 66\u201367 (1976)","journal-title":"Inform. Proc. Lett."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math.\u00a03, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node deletion problems on bipartite graphs. SIAM J. Comput.\u00a010, 310\u2013327 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T19:55:17Z","timestamp":1556135717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}