{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:24:12Z","timestamp":1725470652024},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540390985"},{"type":"electronic","value":"9783540391012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_12","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T15:43:02Z","timestamp":1158162182000},"page":"130-141","source":"Crossref","is-referenced-by-count":0,"title":["An Exact Algorithm for the Minimum Dominating Clique Problem"],"prefix":"10.1007","author":[{"given":"Dieter","family":"Kratsch","sequence":"first","affiliation":[]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(90)90353-J","volume":"86","author":"M.B. Cozzens","year":"1990","unstructured":"Cozzens, M.B., Kelleher, L.L.: Dominating cliques in graphs. Discrete Math.\u00a086, 101\u2013116 (1990)","journal-title":"Discrete Math."},{"key":"12_CR2","unstructured":"Culberson, J., Gao, Y., Anton, C.: Phase Transitions of Dominating Clique Problem and Their Implications to Satisfiability Search. In: Proc. IJCAI 2005, pp. 78\u201383 (2005)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","first-page":"192","volume-title":"Automata, Languages and Programming","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: Domination \u2013 A case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 192\u2013203. Springer, Heidelberg (2005)"},{"key":"12_CR4","first-page":"47","volume":"87","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. Bull. EATCS\u00a087, 47\u201377 (2005)","journal-title":"Bull. EATCS"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30559-0_21","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (Exponential) algorithms for the dominating set problem. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 245\u2013256. Springer, Heidelberg (2004)"},{"key":"12_CR6","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco (1979)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11917496_8","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Gaspers","year":"2006","unstructured":"Gaspers, S., Liedloff, M.: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 78\u201389. Springer, Heidelberg (2006)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jda.2005.03.002","volume":"4","author":"F. Grandoni","year":"2006","unstructured":"Grandoni, F.: A note on the complexity of minimum dominating set. J. Discrete Algorithms\u00a04, 209\u2013214 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"12_CR9","volume-title":"Fundamentals of domination in graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Marcel Dekker Inc., New York (1998)"},{"key":"12_CR10","volume-title":"Domination in graphs:\u00a0Advanced Topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs:\u00a0Advanced Topics. Marcel Dekker Inc., New York (1998)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of SIAM, 196\u2013210 (1962)","DOI":"10.1137\/0110015"},{"key":"12_CR12","first-page":"61","volume":"82","author":"K. Iwama","year":"2004","unstructured":"Iwama, K.: Worst-case upper bounds for ksat. Bull. EATCS\u00a082, 61\u201371 (2004)","journal-title":"Bull. EATCS"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett.\u00a027, 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"12_CR14","first-page":"191","volume-title":"Domination in Graphs:\u00a0Advanced Topics","author":"D. Kratsch","year":"1998","unstructured":"Kratsch, D.: Algorithms. In: Haynes, T., Hedetniemi, S., Slater, P. (eds.) Domination in Graphs:\u00a0Advanced Topics, pp. 191\u2013231. Marcel Dekker, New York (1998)"},{"issue":"3","key":"12_CR15","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. Process. Lett.\u00a05(3), 66\u201367 (1976)","journal-title":"Inform. Process. Lett."},{"key":"12_CR16","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":"12_CR17","unstructured":"Randerath, B., Schiermeyer, I.: Exact algorithms for Minimum Dominating Set, Technical Report zaik-469, Zentrum fur Angewandte Informatik, K\u00f6ln, Germany (April 2004)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11785293_17","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"I. Razgon","year":"2006","unstructured":"Razgon, I.: Exact Computation of Maximum Induced Forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 160\u2013171. Springer, Heidelberg (2006)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"J.M. Robson","year":"1986","unstructured":"Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms\u00a07, 425\u2013440 (1986)","journal-title":"J. Algorithms"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-31856-9_3","volume-title":"STACS 2005","author":"U. Sch\u00f6ning","year":"2005","unstructured":"Sch\u00f6ning, U.: Algorithmics in Exponential Time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 36\u201343. Springer, Heidelberg (2005)"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"R. Tarjan","year":"1977","unstructured":"Tarjan, R., Trojanowski, A.: Finding a maximum independent set. SIAM J. Comput.\u00a06(3), 537\u2013546 (1977)","journal-title":"SIAM J. Comput."},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/11682462_73","volume-title":"LATIN 2006: Theoretical Informatics","author":"Y. Villanger","year":"2006","unstructured":"Villanger, Y.: Improved exponential-time algorithms for treewidth and minimum fill-in. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 800\u2013811. Springer, Heidelberg (2006)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-28639-4_25","volume-title":"Parameterized and Exact Computation","author":"G.J. Woeginger","year":"2004","unstructured":"Woeginger, G.J.: Space and time complexity of exact algorithms: Some open problems. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 281\u2013290. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:42:05Z","timestamp":1605642125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11847250_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}