{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T11:53:19Z","timestamp":1772106799181,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,8]],"date-time":"2007-12-08T00:00:00Z","timestamp":1197072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00453-007-9145-z","type":"journal-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:35:43Z","timestamp":1197056143000},"page":"153-166","source":"Crossref","is-referenced-by-count":59,"title":["Solving Connected Dominating Set Faster than 2 n"],"prefix":"10.1007","volume":"52","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Grandoni","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,12,8]]},"reference":[{"key":"9145_CR1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.jalgor.2004.06.008","volume":"54","author":"R. Beigel","year":"2005","unstructured":"Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289 n ). J.\u00a0Algorithms 54, 168\u2013204 (2005)","journal-title":"J.\u00a0Algorithms"},{"key":"9145_CR2","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 575\u2013582. IEEE (2006)","DOI":"10.1109\/FOCS.2006.41"},{"key":"9145_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/0-387-23830-1_8","volume-title":"Handbook of Combinatorial Optimization, Supplement vol.\u00a0B","author":"J. Blum","year":"2005","unstructured":"Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and MANETs. In: Handbook of Combinatorial Optimization, Supplement vol.\u00a0B, pp. 329\u2013369. Springer, New York (2005)"},{"key":"9145_CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.tcs.2004.08.002","volume":"329","author":"T. Brueggemann","year":"2004","unstructured":"Brueggemann, T., Kern, W.: An improved deterministic local search algorithm for 3-SAT. Theor. Comput. Sci. 329, 303\u2013313 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9145_CR5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"J.M. Byskov","year":"2004","unstructured":"Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32, 547\u2013556 (2004)","journal-title":"Oper. Res. Lett."},{"key":"9145_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0304-3975(01)00174-8","volume":"289","author":"E. Dantsin","year":"2002","unstructured":"Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Sch\u00f6ning, U.: A deterministic (2\u22122\/(k+1)) n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289, 69\u201383 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9145_CR7","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: The traveling salesman problem for cubic graphs. In: Workshop on Algorithms and Data Structures (WADS), pp.\u00a0307\u2013318 (2003)","DOI":"10.1007\/978-3-540-45078-8_27"},{"key":"9145_CR8","unstructured":"Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 781\u2013790 (2004)"},{"key":"9145_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/11847250_17","volume-title":"Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006)","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V.: Finding a minimum feedback vertex set in time O(1.7548 n ). In: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006). Lecture Notes in Computer Science, vol. 4169, pp. 184\u2013191. Springer, Berlin (2006)"},{"key":"9145_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/11523468_16","volume-title":"Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005)","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: domination\u2014A\u00a0case study. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005). Lecture Notes in Computer Science, vol. 3580, pp. 191\u2013203. Springer, Berlin (2005)"},{"key":"9145_CR11","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 87, 47\u201377 (2005)","journal-title":"Bull. EATCS"},{"key":"9145_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: A\u00a0simple O(20.288n ) independent set algorithm. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 18\u201325 (2006)","DOI":"10.1145\/1109557.1109560"},{"key":"9145_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/978-3-540-27836-8_49","volume-title":"Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004)","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Kratsch, D., Todinca, I.: Exact algorithms for treewidth and minimum fill-in. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004). Lecture Notes in Computer Science, vol. 3142, pp. 568\u2013580. Springer, Berlin (2004)"},{"key":"9145_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-540-30559-0_21","volume-title":"Proceedings of the 30th Workshop on Graph Theoretic Concepts in Computer Science (WG 2004)","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: Proceedings of the 30th Workshop on Graph Theoretic Concepts in Computer Science (WG 2004). Lecture Notes in Computer Science, vol. 3353, pp. 245\u2013256. Springer, Berlin (2004)"},{"key":"9145_CR15","volume-title":"Computers and Intractability. A\u00a0Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A\u00a0Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"2","key":"9145_CR16","doi-asserted-by":"crossref","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.\u00a0Discrete Algorithms 4(2), 209\u2013214 (2006)","journal-title":"J.\u00a0Discrete Algorithms"},{"issue":"4","key":"9145_CR17","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"9145_CR18","first-page":"365","volume-title":"Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003)","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 365\u2013372. ACM, New York (2003)"},{"issue":"1","key":"9145_CR19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2212\u03b5 . Acta Math. 182(1), 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"9145_CR20","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J.\u00a0SIAM 10, 196\u2013210 (1962)","journal-title":"J.\u00a0SIAM"},{"key":"9145_CR21","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J.\u00a0Comput. Syst. Sci. 63, 512\u2013530 (2001)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9145_CR22","first-page":"61","volume":"82","author":"K. Iwama","year":"2004","unstructured":"Iwama, K.: Worst-case upper bounds for k-SAT. Bull. EATCS 82, 61\u201371 (2004)","journal-title":"Bull. EATCS"},{"key":"9145_CR23","doi-asserted-by":"crossref","unstructured":"Koivisto, M.: An O(2 n ) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 583\u2013590. IEEE (2006)","DOI":"10.1109\/FOCS.2006.11"},{"key":"9145_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/11672142_46","volume-title":"Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS 2006)","author":"D. M\u00f6lle","year":"2006","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: A faster algorithm for the steiner tree problem. In: Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS 2006). Lecture Notes in Computer Science, vol. 3884, pp. 561\u2013570. Springer, Berlin (2006)"},{"key":"9145_CR25","unstructured":"Randerath, B., Schiermeyer, I.: Exact algorithms for MINIMUM DOMINATING SET. Technical Report, zaik-469, Zentrum f\u00fcr Angewandte Informatik K\u00f6ln, April (2004)"},{"key":"9145_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/11785293_17","volume-title":"Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006)","author":"I. Razgon","year":"2006","unstructured":"Razgon, I.: Exact computation of maximum induced forest. In: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006). Lecture Notes in Computer Science, vol. 4059, pp. 160\u2013171. Springer, Berlin (2006)"},{"issue":"3","key":"9145_CR27","doi-asserted-by":"crossref","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.\u00a0Algorithms 7(3), 425\u2013440 (1986)","journal-title":"J.\u00a0Algorithms"},{"key":"9145_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-540-31856-9_3","volume-title":"Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS 2005)","author":"U. Sch\u00f6ning","year":"2005","unstructured":"Sch\u00f6ning, U.: Algorithmics in exponential time. In: Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS 2005). Lecture Notes in Computer Science, vol. 3404, pp. 36\u201343. Springer, Berlin (2005)"},{"issue":"4","key":"9145_CR29","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C. Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245\u2013269 (2004)","journal-title":"Algorithmica"},{"key":"9145_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1007\/978-3-540-27836-8_101","volume-title":"Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004)","author":"R. Williams","year":"2004","unstructured":"Williams, R.: A new algorithm for optimal constraint satisfaction and its implications. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004). Lecture Notes in Computer Science, vol. 3142, pp. 1227\u20131237. Springer, Berlin (2004)"},{"key":"9145_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization\u2014Eureka, You Shrink","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems: A\u00a0survey. In: Combinatorial Optimization\u2014Eureka, You Shrink. Lecture Notes in Computer Science, vol. 2570, pp. 185\u2013207. Springer, Berlin (2003)"},{"key":"9145_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/978-3-540-28639-4_25","volume-title":"Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004)","author":"G.J. Woeginger","year":"2004","unstructured":"Woeginger, G.J.: Space and time complexity of exact algorithms: Some open problems. In: Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004). Lecture Notes in Computer Science, vol. 3162, pp. 281\u2013290. Springer, Berlin (2004)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9145-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9145-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9145-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:01Z","timestamp":1559137501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9145-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,8]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9145"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9145-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,8]]}}}