{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:47Z","timestamp":1763467967662},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_50","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"554-565","source":"Crossref","is-referenced-by-count":32,"title":["Inclusion\/Exclusion Meets Measure and Conquer"],"prefix":"10.1007","author":[{"given":"Johan M. M.","family":"van Rooij","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Nederlof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas C.","family":"van Dijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"50_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(93)90033-6","volume":"47","author":"E.T. Bax","year":"1993","unstructured":"Bax, E.T.: Inclusion and exclusion algorithm for the hamiltonian path problem. Information Processing Letters\u00a047(4), 203\u2013207 (1993)","journal-title":"Information Processing Letters"},{"key":"50_CR2","unstructured":"Bax, E.T.: Recurrence-based reductions for inclusion and exclusion algorithms applied to #P problems (1996)"},{"issue":"2","key":"50_CR3","doi-asserted-by":"publisher","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\u00a052(2), 226\u2013249 (2008)","journal-title":"Algorithmica"},{"key":"50_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1250790.1250801","volume-title":"STOC 2007: Proceedings of the thirty-ninth 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: STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 67\u201374. ACM, New York (2007)"},{"key":"50_CR5","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal of Computing, Special Issue for FOCS 2006 (to appear)"},{"key":"50_CR6","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011, 1\u201323 (1993)","journal-title":"Acta Cybernetica"},{"issue":"3","key":"50_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. The Computer Journal\u00a051(3), 255\u2013269 (2008)","journal-title":"The Computer Journal"},{"key":"50_CR8","unstructured":"Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 781\u2013790 (2004)"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and treewidth. In: Algorithmica Special issue of ISAAC 2006 (2006) (to appear)","DOI":"10.1007\/s00453-007-9133-3"},{"key":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11523468_16","volume-title":"Automata, Languages and Programming","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: Domination \u2014 a case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 191\u2013203. Springer, Heidelberg (2005)"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: a simple O(20.288n ) independent set algorithm. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pp. 18\u201325 (2006)","DOI":"10.1145\/1109557.1109560"},{"key":"50_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ipl.2005.10.012","volume":"97","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., H\u00f8ie, K.: Pathwidth of cubic graphs and exact algorithms. Information Processing Letters\u00a097, 191\u2013196 (2006)","journal-title":"Information Processing Letters"},{"key":"50_CR13","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":"50_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11785293_16","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"S. Gaspers","year":"2006","unstructured":"Gaspers, S., Kratsch, D., Liedloff, M.: Exponential time algorithms for the minimum dominating set problem on some graph classes. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 148\u2013159. Springer, Heidelberg (2006)"},{"key":"50_CR15","volume-title":"Proceedings of the 20th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009)","author":"S. Gaspers","year":"2009","unstructured":"Gaspers, S., Sorkin, G.B.: A universally fastest algorithm for max 2-sat, max 2-csp, and everything in between. In: Proceedings of the 20th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009). SIAM, Philadelphia (to appear, 2009)"},{"key":"50_CR16","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. Disc. Alg.\u00a04, 209\u2013214 (2006)","journal-title":"J. Disc. Alg."},{"key":"50_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0167-6377(82)90044-X","volume":"1","author":"R.M. Karp","year":"1982","unstructured":"Karp, R.M.: Dynamic programming meets the principle of inclusion-exclusion. Operations Research Letters\u00a01, 49\u201351 (1982)","journal-title":"Operations Research Letters"},{"key":"50_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/11604686_34","volume-title":"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: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 385\u2013396. Springer, Heidelberg (2005)"},{"key":"50_CR19","unstructured":"Paulusma, D., van Rooij, J.M.M.: A fast exact algorithm for the 2-role assignment problem (submitted)"},{"key":"50_CR20","unstructured":"Randerath, B., Schiermeyer, I.: Exact algorithms for minimum dominating set. Technical Report zaik2004-469, Universit\u00e4t zu K\u00f6ln, Cologne, Germany (2005)"},{"key":"50_CR21","unstructured":"van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer \u2013 a faster exact algorithm for dominating set. In: Albers, S., Weil, P. (eds.) Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2008, pp. 657\u2013668. IBFI Schloss Dagstuhl (2008)"},{"key":"50_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-04128-0_51","volume-title":"ESA 2009","author":"J.M.M. Rooij van","year":"2009","unstructured":"van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic programming on tree decompositions using generalised fast subset convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 566\u2013577. Springer, Heidelberg (2009)"},{"key":"50_CR23","unstructured":"van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion\/exclusion meets measure and conquer: Exact algorithms for counting dominating set. Technical Report UU-CS-2008-043, Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T15:09:26Z","timestamp":1685113766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}