{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T03:17:59Z","timestamp":1770434279999,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T00:00:00Z","timestamp":1233187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s00224-009-9185-7","type":"journal-article","created":{"date-parts":[[2009,1,28]],"date-time":"2009-01-28T19:37:56Z","timestamp":1233171476000},"page":"637-654","source":"Crossref","is-referenced-by-count":29,"title":["Trimmed Moebius Inversion and Graphs of Bounded Degree"],"prefix":"10.1007","volume":"47","author":[{"given":"Andreas","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikko","family":"Koivisto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,29]]},"reference":[{"key":"9185_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. Algorithms 54, 168\u2013204 (2005)","journal-title":"J. Algorithms"},{"key":"9185_CR2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/s00453-007-9149-8","volume":"52","author":"A. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52, 226\u2013249 (2008)","journal-title":"Algorithmica"},{"key":"9185_CR3","first-page":"67","volume-title":"Proceedings of the 39th Annual ACM Symposium on Theory of Computing","author":"A. Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: fast subset convolution. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (San Diego, CA, June 11\u201313, 2007), pp. 67\u201374. Assoc. Comput. Mach., New York (2007)"},{"key":"9185_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion\u2013exclusion. In: SIAM J. Comput. (2009, to appear). Prelim. versions in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (Berkeley, CA, Oct. 21\u201324, 2006), pp. 575\u2013582, 583\u2013590. IEEE Comput. Soc., Los Alamitos (2006)","DOI":"10.1137\/070683933"},{"key":"9185_CR5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Proc. Camb. Philos. Soc. 37, 194\u2013197 (1941)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"9185_CR6","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":"9185_CR7","unstructured":"Byskov, J.M.: Exact algorithms for graph colouring and exact satisfiability, Ph.D. Thesis, University of Aarhus (2004)"},{"key":"9185_CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0097-3165(86)90019-1","volume":"43","author":"F.R.K. Chung","year":"1986","unstructured":"Chung, F.R.K., Frankl, P., Graham, R.L., Shearer, J.B.: Some intersection theorems for ordered sets and graphs. J.\u00a0Comb. Theory Ser.\u00a0A 43, 23\u201337 (1986)","journal-title":"J.\u00a0Comb. Theory Ser.\u00a0A"},{"key":"9185_CR9","doi-asserted-by":"crossref","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 Algorithms Appl. 7, 131\u2013140 (2003)","journal-title":"J.\u00a0Graph Algorithms Appl."},{"key":"9185_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/11602613_58","volume-title":"Proceedings of the 16th International Symposium on Algorithms and Computation","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Bounding the number of minimal dominating sets: a measure and conquer approach. In: Proceedings of the 16th International Symposium on Algorithms and Computation (Sanya, Hainan, China, Dec. 19\u201321, 2005). Lecture Notes in Computer Science, vol.\u00a03827, pp. 573\u2013582. Springer, Berlin (2005)"},{"key":"9185_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and treewidth, Algorithmica (2009, to appear). doi: 10.1007\/s00453-007-9133-3","DOI":"10.1007\/s00453-007-9133-3"},{"key":"9185_CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02418571","volume":"30","author":"J.L.W.V. Jensen","year":"1906","unstructured":"Jensen, J.L.W.V.: Sur les fonctions convexes et les in\u00e9galit\u00e9s entre les valeurs moyennes. Acta Math. 30, 175\u2013193 (1906)","journal-title":"Acta Math."},{"key":"9185_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/11604686_34","volume-title":"Revised Selected Papers from the 31st International Workshop on Graph-Theoretic Concepts in Computer Science","author":"J. Kneis","year":"2005","unstructured":"Kneis, J., M\u00f6lle, D., Richter, S., Rossmanith, P.: Algorithms based on the treewidth of sparse graphs. In: Revised Selected Papers from the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (Metz, France, June 23\u201325, 2005). Lecture Notes in Computer Science, vol.\u00a03787, pp. 385\u2013396. Springer, Berlin (2005)"},{"key":"9185_CR14","volume-title":"The Art of Computer Programming, Vol.\u00a02: Seminumerical Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol.\u00a02: Seminumerical Algorithms, 3rd edn. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"9185_CR15","doi-asserted-by":"crossref","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. Inf. Process. Lett. 5, 66\u201367 (1976)","journal-title":"Inf. Process. Lett."},{"key":"9185_CR16","doi-asserted-by":"crossref","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. Isr. J. Math. 3, 23\u201328 (1965)","journal-title":"Isr. J. Math."},{"key":"9185_CR17","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"9185_CR18","unstructured":"Yates, F.: The Design and Analysis of Factorial Experiments. Technical Communication 35, Commonwealth Bureau of Soils, Harpenden, U.K. (1937)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9185-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9185-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9185-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:37Z","timestamp":1558698697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9185-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,29]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9185"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9185-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,29]]}}}