{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:15:59Z","timestamp":1649178959859},"reference-count":71,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2013,2,27]],"date-time":"2013-02-27T00:00:00Z","timestamp":1361923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"DOI":"10.1007\/s00453-013-9759-2","type":"journal-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T11:40:04Z","timestamp":1361878804000},"source":"Crossref","is-referenced-by-count":1,"title":["Inclusion\/Exclusion Meets Measure and Conquer"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Nederlof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan M. M.","family":"van Rooij","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas C.","family":"van Dijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,27]]},"reference":[{"issue":"6","key":"9759_CR1","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1016\/j.jcss.2010.12.002","volume":"77","author":"O. Amini","year":"2011","unstructured":"Amini, O., Fomin, F.V., Saurabh, S.: Implicit branching and parameterized partial cover problems. J.\u00a0Comput. Syst. Sci. 77(6), 1159\u20131171 (2011)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"2","key":"9759_CR2","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/100789403","volume":"26","author":"O. Amini","year":"2012","unstructured":"Amini, O., Fomin, F.V., Saurabh, S.: Counting subgraphs via homomorphisms. SIAM J. Discrete Math. 26(2), 695\u2013717 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"9759_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0020-0190(98)00021-0","volume":"65","author":"G. Andersson","year":"1998","unstructured":"Andersson, G., Engebretsen, L.: Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT. Inf. Process. Lett. 65(6), 305\u2013311 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9759_CR4","doi-asserted-by":"crossref","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. Inf. Process. Lett. 47(4), 203\u2013207 (1993)","journal-title":"Inf. Process. Lett."},{"key":"9759_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/978-3-642-17493-3_6","volume-title":"5th International Symposium on Parameterized and Exact Computation, IPEC 2010","author":"D. Binkele-Raible","year":"2010","unstructured":"Binkele-Raible, D., Fernau, H.: Enumerate & measure: improving parameter budget management. In: Raman, V., Saurabh, S. (eds.) 5th International Symposium on Parameterized and Exact Computation, IPEC 2010. Lecture Notes in Computer Science, vol. 6478, pp. 38\u201349. Springer, Berlin (2010)"},{"key":"9759_CR6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/FOCS.2010.24","volume-title":"51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010","author":"A. Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, A.: Determinant sums for undirected Hamiltonicity. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, pp. 173\u2013182. IEEE Computer Society, New York (2010)"},{"key":"9759_CR7","series-title":"Leibniz International Proceedings in Informatics","first-page":"95","volume-title":"27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010","author":"A. Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, A.: Exact covers via determinants. In: Marion, J.-Y., Schwentick, T. (eds.) 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010. Leibniz International Proceedings in Informatics, vol. 3, pp. 95\u2013106. Schloss Dagstuhl, Leibniz-Zentrum fuer Informatik (2010)"},{"issue":"2","key":"9759_CR8","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(2), 226\u2013249 (2008)","journal-title":"Algorithmica"},{"key":"9759_CR9","first-page":"67","volume-title":"39th Annual ACM Symposium on Theory of Computing, STOC 2007","author":"A. Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: fast subset convolution. In: Johnson, D.S., Feige, U. (eds.) 39th Annual ACM Symposium on Theory of Computing, STOC 2007, pp. 67\u201374. ACM Press, New York (2007)"},{"key":"9759_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1007\/978-3-642-04128-0_52","volume-title":"17th Annual European Symposium on Algorithms, ESA 2009","author":"A. Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Counting paths and packings in halves. In: Fiat, A., Sanders, P. (eds.) 17th Annual European Symposium on Algorithms, ESA 2009. Lecture Notes in Computer Science, vol. 5757, pp. 578\u2013586. Springer, Berlin (2009)"},{"issue":"3","key":"9759_CR11","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s00224-009-9185-7","volume":"47","author":"A. Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed Moebius inversion and graphs of bounded degree. Theory Comput. Syst. 47(3), 637\u2013654 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"21\u201322","key":"9759_CR12","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.ipl.2011.08.002","volume":"111","author":"A. Bj\u00f6rklund","year":"2011","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Covering and packing in linear space. Inf. Process. Lett. 111(21\u201322), 1033\u20131036 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9759_CR13","doi-asserted-by":"crossref","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 J. Comput. 39(2), 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"9759_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9759_CR15","doi-asserted-by":"crossref","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. Comput. J. 51(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"key":"9759_CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.tcs.2012.07.016","volume":"459","author":"N. Bourgeois","year":"2012","unstructured":"Bourgeois, N., Croce, F.D., Escoffier, B., Paschos, V.T.: Algorithms for dominating clique problems. Theor. Comput. Sci. 459, 77\u201388 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"9759_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-642-13284-1_20","volume-title":"17th International Colloquium Structural Information and Communication Complexity, SIROCCO 2010","author":"N. Bourgeois","year":"2010","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Fast algorithms for min independent dominating set. In: Patt-Shamir, B., Ekim, T. (eds.) 17th International Colloquium Structural Information and Communication Complexity, SIROCCO 2010. Lecture Notes in Computer Science, vol. 6058, pp. 247\u2013261. Springer, Berlin (2010)"},{"key":"9759_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-642-13562-0_34","volume-title":"7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010","author":"N. Bourgeois","year":"2010","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Maximum independent set in graphs of average degree at most three in O(1.08537 n ). In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) 7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010. Lecture Notes in Computer Science, vol. 6108, pp. 373\u2013384. Springer, Berlin (2010)"},{"issue":"1\u20132","key":"9759_CR19","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/s00453-010-9460-7","volume":"62","author":"N. Bourgeois","year":"2012","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Fast algorithms for max independent set. Algorithmica 62(1\u20132), 382\u2013415 (2012)","journal-title":"Algorithmica"},{"issue":"4","key":"9759_CR20","doi-asserted-by":"crossref","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 54(4), 472\u2013489 (2009)","journal-title":"Algorithmica"},{"key":"9759_CR21","first-page":"74","volume-title":"IEEE Conference on Computational Complexity","author":"M. Cygan","year":"2012","unstructured":"Cygan, M., Dell, H., Lokshtanov, D., Marx, D., Nederlof, J., Okamoto, Y., Paturi, R., Saurabh, S., Wahlstr\u00f6m, M.: On problems as hard as CNF-SAT. In: IEEE Conference on Computational Complexity, pp. 74\u201384. IEEE, New York (2012)"},{"key":"9759_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/11611257_21","volume-title":"32nd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2006","author":"F.K.H.A. Dehne","year":"2006","unstructured":"Dehne, F.K.H.A., Fellows, M.R., Fernau, H., Prieto, E., Rosamond, F.A.: Nonblocker: parameterized algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., Stuller, J. (eds.) 32nd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2006. Lecture Notes in Computer Science, vol. 3831, pp. 237\u2013245. Springer, Berlin (2006)"},{"key":"9759_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-540-39890-5_16","volume-title":"29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2003","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.) 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2003. Lecture Notes in Computer Science, vol. 2880, pp. 180\u2013191. Springer, Berlin (2003)"},{"key":"9759_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-540-28639-4_24","volume-title":"1st International Workshop on Parameterized and Exact Computation, IWPEC 2004","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.K.H.A. (eds.) 1st International Workshop on Parameterized and Exact Computation, IWPEC 2004. Lecture Notes in Computer Science, vol. 3162, pp. 271\u2013280. Springer, Berlin (2004)"},{"key":"9759_CR25","first-page":"161","volume":"87","author":"R.G. Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congr. Numer. 87, 161\u2013178 (1992)","journal-title":"Congr. Numer."},{"issue":"4","key":"9759_CR26","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/1198513.1198515","volume":"2","author":"D. Eppstein","year":"2006","unstructured":"Eppstein, D.: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Trans. Algorithms 2(4), 492\u2013509 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"9759_CR27","first-page":"5","volume":"11","author":"P. Erd\u00f6s","year":"1963","unstructured":"Erd\u00f6s, P.: On a combinatorial problem, I. Nord. Mat. Tidskrift 11, 5\u201310 (1963)","journal-title":"Nord. Mat. Tidskrift"},{"issue":"3","key":"9759_CR28","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BF01897152","volume":"15","author":"P. Erd\u00f6s","year":"1964","unstructured":"Erd\u00f6s, P.: On a combinatorial problem, II. Acta Math. Hung. 15(3), 445\u2013447 (1964)","journal-title":"Acta Math. Hung."},{"issue":"45","key":"9759_CR29","doi-asserted-by":"crossref","first-page":"6290","DOI":"10.1016\/j.tcs.2011.07.011","volume":"412","author":"H. Fernau","year":"2011","unstructured":"Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Raible, D., Rossmanith, P.: An exact algorithm for the maximum leaf spanning tree problem. Theor. Comput. Sci. 412(45), 6290\u20136302 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9759_CR30","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00453-007-9152-0","volume":"52","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica 52(2), 293\u2013307 (2008)","journal-title":"Algorithmica"},{"issue":"2","key":"9759_CR31","doi-asserted-by":"crossref","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 54(2), 181\u2013207 (2009)","journal-title":"Algorithmica"},{"issue":"2","key":"9759_CR32","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2 n . Algorithmica 52(2), 153\u2013166 (2008)","journal-title":"Algorithmica"},{"key":"9759_CR33","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5) (2009)","DOI":"10.1145\/1552285.1552286"},{"key":"9759_CR34","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. ACM Trans. Algorithms 5(1) (2008)","DOI":"10.1145\/1435375.1435384"},{"key":"9759_CR35","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. ACM Trans. Algorithms 5(1) (2008)","DOI":"10.1145\/1435375.1435384"},{"key":"9759_CR36","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. Springer, Berlin (2010)"},{"key":"9759_CR37","series-title":"Lecture Notes in Computer Science","first-page":"24","volume-title":"30th International 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: Hromkovic, J., Nagl, M., Westfechtel, B. (eds.) 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004. Lecture Notes in Computer Science, vol. 3353, pp. 24\u2013256. Springer, Berlin (2004)"},{"issue":"16","key":"9759_CR38","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ipl.2011.05.016","volume":"111","author":"F.V. Fomin","year":"2011","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Subexponential algorithms for partial cover problems. Inf. Process. Lett. 111(16), 814\u2013818 (2011)","journal-title":"Inf. Process. Lett."},{"key":"9759_CR39","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. Freeman, New York (1979)"},{"issue":"3\u20134","key":"9759_CR40","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s00453-010-9474-1","volume":"62","author":"S. Gaspers","year":"2012","unstructured":"Gaspers, S., Kratsch, D., Liedloff, M.: On independent sets and bicliques in graphs. Algorithmica 62(3\u20134), 637\u2013658 (2012)","journal-title":"Algorithmica"},{"key":"9759_CR41","doi-asserted-by":"crossref","unstructured":"Gaspers, S., Kratsch, D., Liedloff, M., Todinca, I.: Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Trans. Algorithms 6(1) (2009)","DOI":"10.1145\/1644015.1644024"},{"issue":"1","key":"9759_CR42","first-page":"29","volume":"14","author":"S. Gaspers","year":"2012","unstructured":"Gaspers, S., Liedloff, M.: A branch-and-reduce algorithm for finding a minimum independent dominating set. Discrete Math. Theor. Comput. Sci. 14(1), 29\u201342 (2012)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"9759_CR43","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.jcss.2011.05.010","volume":"78","author":"S. Gaspers","year":"2012","unstructured":"Gaspers, S., Sorkin, G.B.: A universally fastest algorithm for max 2-Sat, max 2-CSP, and everything in between. J. Comput. Syst. Sci. 78(1), 305\u2013335 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9759_CR44","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory, Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9759_CR45","unstructured":"Grandoni, F.: Exact algorithms for hard graph problems. PhD thesis, Department of Computer Science, Systems and Production, Universit\u00e1 degli Studi di Roma \u201cTor Vergata\u201d, Rome, Italy (2004)"},{"issue":"2","key":"9759_CR46","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. Discrete Algorithms 4(2), 209\u2013214 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"9759_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-25141-2","volume-title":"IPEC","author":"Y. Iwata","year":"2011","unstructured":"Iwata, Y.: A faster algorithm for dominating set analyzed by the potential method. In: Marx, D., Rossmanith, P. (eds.) IPEC. Lecture Notes in Computer Science, vol. 7112, pp. 41\u201354. Springer, Berlin (2011)"},{"issue":"2","key":"9759_CR48","doi-asserted-by":"crossref","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. Oper. Res. Lett. 1(2), 49\u201351 (1982)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9759_CR49","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1137\/080715482","volume":"23","author":"J. Kneis","year":"2009","unstructured":"Kneis, J., M\u00f6lle, D., Richter, S., Rossmanith, P.: A bound on the pathwidth of sparse graphs with applications to exact algorithms. SIAM J. Discrete Math. 23(1), 407\u2013427 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"9759_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/978-3-540-69507-3_31","volume-title":"33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007","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., Plasil, F. (eds.) 33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007. Lecture Notes in Computer Science, vol. 4362, pp. 367\u2013376. Springer, Berlin (2007)"},{"key":"9759_CR51","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1145\/800179.810218","volume-title":"Proceedings of the 1977 Annual Conference of the ACM","author":"S. Kohn","year":"1977","unstructured":"Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the traveling salesman problem. In: Proceedings of the 1977 Annual Conference of the ACM, pp. 294\u2013300. ACM Press, New York (1977)"},{"key":"9759_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/978-3-642-02927-1_54","volume-title":"36th International Colloquium on Automata, Languages and Programming (1), ICALP 2009","author":"I. Koutis","year":"2009","unstructured":"Koutis, I., Williams, R.: Limits and applications of group algebras for parameterized problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S.E., Thomas, W. (eds.) 36th International Colloquium on Automata, Languages and Programming (1), ICALP 2009. Lecture Notes in Computer Science, vol. 5555, pp. 653\u2013664. Springer, Berlin (2009)"},{"key":"9759_CR53","unstructured":"Liedloff, M.: Algorithmes exacts et exponentiels pour les probl\u00e8mes NP-difficiles: domination, variantes et g\u00e9n\u00e9ralisation. PhD thesis, Laboratoire d\u2019Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine, Metz, France (2007)"},{"key":"9759_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-642-11269-0_24","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: Chen, J., Fomin, F.V. (eds.) 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009. Lecture Notes in Computer Science, vol. 5917, pp. 288\u2013299. Springer, Berlin (2009)"},{"key":"9759_CR55","series-title":"Texts in Algorithmics","first-page":"105","volume-title":"1st Algorithms and Complexity in Durham Workshop, ACiD 2005","author":"D. Lokshtanov","year":"2005","unstructured":"Lokshtanov, D., Sloper, C.: Fixed parameter set splitting, linear kernel and improved running time. In: Broersma, H., Johnson, M., Szeider, S. (eds.) 1st Algorithms and Complexity in Durham Workshop, ACiD 2005. Texts in Algorithmics, vol. 4, pp. 105\u2013113. King\u2019s College, London (2005)"},{"key":"9759_CR56","first-page":"3","volume":"8","author":"L. Lov\u00e1sz","year":"1973","unstructured":"Lov\u00e1sz, L.: Coverings and colorings of hypergraphs. Congr. Numer. 8, 3\u201312 (1973)","journal-title":"Congr. Numer."},{"key":"9759_CR57","unstructured":"Nederlof, J.: Space and time efficient structural improvements of dynamic programming algorithms. PhD thesis, Department of Informatics, University of Bergen, Bergen, Norway (2011)"},{"key":"9759_CR58","doi-asserted-by":"crossref","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using inclusion-exclusion. Algorithmica, 1\u201317 (2012)","DOI":"10.1007\/s00453-012-9630-x"},{"issue":"48","key":"9759_CR59","doi-asserted-by":"crossref","first-page":"6761","DOI":"10.1016\/j.tcs.2011.09.001","volume":"412","author":"D. Paulusma","year":"2011","unstructured":"Paulusma, D., van Rooij, J.M.M.: On partitioning a graph into two connected subgraphs. Theor. Comput. Sci. 412(48), 6761\u20136769 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9759_CR60","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1002\/(SICI)1098-2418(200001)16:1<4::AID-RSA2>3.0.CO;2-2","volume":"16","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Srinivasan, A.: Improved bounds and algorithms for hypergraph 2-coloring. Random Struct. Algorithms 16(1), 4\u201332 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"9759_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/11549345_63","volume-title":"30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005","author":"T. Riege","year":"2005","unstructured":"Riege, T., Rothe, J.: An exact 2.9416 n algorithm for the three domatic number problem. In: Jedrzejowicz, J., Szepietowski, A. (eds.) 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005. Lecture Notes in Computer Science, vol. 3618, pp. 733\u2013744. Springer, Berlin (2005)"},{"issue":"3","key":"9759_CR62","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.ipl.2006.08.010","volume":"101","author":"T. Riege","year":"2007","unstructured":"Riege, T., Rothe, J., Spakowski, H., Yamamoto, M.: An improved exact algorithm for the domatic number problem. Inf. Process. Lett. 101(3), 101\u2013106 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"17","key":"9759_CR63","doi-asserted-by":"crossref","first-page":"3291","DOI":"10.1016\/j.dam.2008.05.035","volume":"156","author":"I. Schiermeyer","year":"2008","unstructured":"Schiermeyer, I.: Efficiency in exponential time for domination-type problems. Discrete Appl. Math. 156(17), 3291\u20133297 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9759_CR64","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"key":"9759_CR65","unstructured":"van Rooij, J.M.M.: Exact exponential-time algorithms for domination problems in graphs. PhD thesis, Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (2011)"},{"issue":"17","key":"9759_CR66","doi-asserted-by":"crossref","first-page":"2147","DOI":"10.1016\/j.dam.2011.07.001","volume":"159","author":"J.M.M. Rooij van","year":"2011","unstructured":"van Rooij, J.M.M., Bodlaender, H.L.: Exact algorithms for dominating set. Discrete Appl. Math. 159(17), 2147\u20132164 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9759_CR67","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s00453-011-9546-x","volume":"64","author":"J.M.M. Rooij van","year":"2012","unstructured":"van Rooij, J.M.M., Bodlaender, H.L.: Exact algorithms for edge domination. Algorithmica 64(4), 535\u2013563 (2012)","journal-title":"Algorithmica"},{"key":"9759_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1007\/978-3-642-04128-0_51","volume-title":"17th Annual European Symposium on Algorithms, 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.) 17th Annual European Symposium on Algorithms, ESA 2009. Lecture Notes in Computer Science, vol. 5757, pp. 566\u2013577. Springer, Berlin (2009)"},{"key":"9759_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-642-04128-0_50","volume-title":"17th Annual European Symposium on 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.) 17th Annual European Symposium on Algorithms, ESA 2009. Lecture Notes in Computer Science, vol. 5757, pp. 554\u2013565. Springer, Berlin (2009)"},{"issue":"1\u20133","key":"9759_CR70","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.dam.2002.07.001","volume":"142","author":"J. Zhang","year":"2004","unstructured":"Zhang, J., Ye, Y., Han, Q.: Improved approximations for max set splitting and max NAE SAT. Discrete Appl. Math. 142(1\u20133), 133\u2013149 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9759_CR71","first-page":"679","volume-title":"31th Annual ACM Symposium on Theory of Computing, STOC 1999","author":"U. Zwick","year":"1999","unstructured":"Zwick, U.: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In: 31th Annual ACM Symposium on Theory of Computing, STOC 1999, pp. 679\u2013687. ACM Press, New York (1999)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9759-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9759-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9759-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T00:02:31Z","timestamp":1562716951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9759-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,27]]},"references-count":71,"alternative-id":["9759"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9759-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,27]]}}}