{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:30Z","timestamp":1763468010714,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174926"},{"type":"electronic","value":"9783642174933"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17493-3_20","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T08:41:01Z","timestamp":1291365661000},"page":"204-215","source":"Crossref","is-referenced-by-count":5,"title":["Inclusion\/Exclusion Branching for Partial Dominating Set and Set Splitting"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Nederlof","sequence":"first","affiliation":[]},{"given":"Johan M. M.","family":"van Rooij","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Amini, O., Fomin, F.V., Saurabh, S.: Implicit branching and parameterized partial cover problems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008. LIPIcs, vol.\u00a02, pp. 1\u201312 (2008)"},{"key":"20_CR2","unstructured":"Bax, E.: Recurrence-based reductions for inclusion and exclusion algorithms applied to # $\\mathcal{P}$ problems. Technical report, California Institute of Technology (1996)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: 39th Annual ACM Symposium on Theory of Computing, STOC 2007, pp. 67\u201374 (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-70575-8_17","volume-title":"Automata, Languages and Programming","author":"A. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The travelling salesman problem in bounded degree graphs. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 198\u2013209. Springer, Heidelberg (2008)"},{"key":"20_CR5","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed moebius inversion and graphs of bounded degree. In: 25th Symposium on Theoretical Aspects of Computer Science, STACS 2008. LIPIcs, vol.\u00a01, pp. 85\u201396 (2008)"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A. Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal on Computing\u00a039(2), 546\u2013563 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s00453-008-9206-y","volume":"54","author":"J. Chen","year":"2009","unstructured":"Chen, J., Lu, S.: Improved parameterized set splitting algorithms: A probabilistic approach. Algorithmica\u00a054(4), 472\u2013489 (2009)","journal-title":"Algorithmica"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-39890-5_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F.K.H.A. Dehne","year":"2003","unstructured":"Dehne, F.K.H.A., Fellows, M.R., Rosamond, F.A.: An FPT algorithm for set splitting. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 180\u2013191. Springer, Heidelberg (2003)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-28639-4_24","volume-title":"Parameterized and Exact Computation","author":"F.K.H.A. Dehne","year":"2004","unstructured":"Dehne, F.K.H.A., Fellows, M.R., Rosamond, F.A., Shaw, P.: Greedy localization, iterative compression, modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 271\u2013280. Springer, Heidelberg (2004)"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00453-007-9133-3","volume":"54","author":"F.V. Fomin","year":"2009","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and treewidth. Algorithmica\u00a054(2), 181\u2013207 (2009)","journal-title":"Algorithmica"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM\u00a056(5) (2009)","DOI":"10.1145\/1552285.1552286"},{"key":"20_CR12","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Subexponential algorithms for partial cover problems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009. LIPIcs, vol.\u00a04, pp. 193\u2013201 (2009)"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-sat. Journal of Computer and System Sciences\u00a062(2), 367\u2013375 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-69507-3_31","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"J. Kneis","year":"2007","unstructured":"Kneis, J., M\u00f6lle, D., Rossmanith, P.: Partial vs. complete domination: t-dominating set. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 367\u2013376. Springer, Heidelberg (2007)"},{"key":"20_CR15","series-title":"LNCS","first-page":"653","volume-title":"36th International Colloquium on Automata, Languages and Programming, ICALP 2009","author":"I. Koutis","year":"2009","unstructured":"Koutis, I., Williams, R.: Limits and applications of group algebras for parameterized problems. In: 36th International Colloquium on Automata, Languages and Programming, ICALP 2009. LNCS, vol.\u00a05555, pp. 653\u2013664. Springer, Heidelberg (2009)"},{"key":"20_CR16","unstructured":"Liedloff, M.: Algorithmes exacts et exponentiels pour les probl\u00e8mes NP-difficiles: domination, variantes et g\u00e9n\u00e9ralisation, PhD thesis (2007)"},{"key":"20_CR17","series-title":"LNCS","first-page":"288","volume-title":"4th International Workshop on Parameterized and Exact Computation, IWPEC 2009","author":"D. Lokshtanov","year":"2009","unstructured":"Lokshtanov, D., Saurabh, S.: Even faster algorithm for set splitting! In: 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009. LNCS, vol.\u00a05917, pp. 288\u2013299. Springer, Heidelberg (2009)"},{"key":"20_CR18","unstructured":"Lokshtanov, D., Sloper, C.: Fixed parameter set splitting, linear kernel and improved running time. In: 1th Algorithms and Complexity in Durham Workshop, ACiD 2005. Texts in Algorithmics, vol.\u00a04, pp. 105\u2013113 (2005)"},{"key":"20_CR19","series-title":"LNCS","first-page":"713","volume-title":"36th International Colloquium on Automata, Languages and Programming, ICALP 2009","author":"J. Nederlof","year":"2009","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using m\u00f6bius inversion: Improving on steiner tree and related problems. In: 36th International Colloquium on Automata, Languages and Programming, ICALP 2009. LNCS, vol.\u00a05555, pp. 713\u2013725. Springer, Heidelberg (2009)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-13073-1_8","volume-title":"Algorithms and Complexity","author":"J.M.M. Rooij van","year":"2010","unstructured":"van Rooij, J.M.M.: Polynomial space algorithms for counting dominating sets and the domatic number. In: Calamoneri, T., Diaz, J. (eds.) Algorithms and Complexity. LNCS, vol.\u00a06078, pp. 73\u201384. Springer, Heidelberg (2010)"},{"key":"20_CR21","unstructured":"van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer, a faster exact algorithm for dominating set. In: 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2008. LIPIcs, vol.\u00a01, pp. 657\u2013668 (2008)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-04128-0_50","volume-title":"Algorithms - ESA 2009","author":"J.M.M. Rooij van","year":"2009","unstructured":"van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion\/exclusion meets measure and conquer. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 554\u2013565. Springer, Heidelberg (2009)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J.: Exact algorithms for np-hard problems: a survey. In: Combinatorial optimization - Eureka, you shrink!, pp. 185\u2013207 (2003)","DOI":"10.1007\/3-540-36478-1_17"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17493-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:39:09Z","timestamp":1559835549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17493-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174926","9783642174933"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17493-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}