{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:29:17Z","timestamp":1783150157832,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642029264","type":"print"},{"value":"9783642029271","type":"electronic"}],"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-02927-1_59","type":"book-chapter","created":{"date-parts":[[2009,7,4]],"date-time":"2009-07-04T08:37:10Z","timestamp":1246696630000},"page":"713-725","source":"Crossref","is-referenced-by-count":45,"title":["Fast Polynomial-Space Algorithms Using M\u00f6bius Inversion: Improving on Steiner Tree and Related Problems"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Nederlof","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"59_CR1","unstructured":"Bax, E.T.: Recurrence-Based Reductions for Inclusion and Exclusion Algorithms Applied to #P Problems (1996)"},{"key":"59_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/11786986_48","volume-title":"Automata, Languages and Programming","author":"A. Bj\u00f6rklund","year":"2006","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 548\u2013559. Springer, Heidelberg (2006)"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: STOC, pp. 67\u201374 (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the tutte polynomial in vertex-exponential time. In: FOCS, pp. 677\u2013686 (2008)","DOI":"10.1109\/FOCS.2008.40"},{"key":"59_CR5","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed moebius inversion and graphs of bounded degree. In: STACS, pp. 85\u201396 (2008)"},{"key":"59_CR6","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion\u2013exclusion. SIAM Journal on Computing, special issue dedicated to selected papers from FOCS 2006, 575\u2013582 (2006)"},{"key":"59_CR7","unstructured":"Bodlaender, H.L., Kratsch, D.: An exact algorithm for graph coloring with polynomial memory. Technical Report UU-CS-2006-015, Department of Information and Computing Sciences, Utrecht University (2006)"},{"issue":"2","key":"59_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jctb.1995.1055","volume":"65","author":"F.R.K. Chung","year":"1995","unstructured":"Chung, F.R.K., Graham, R.L.: On the cover polynomial of a digraph. J. Comb. Theory, Ser. B\u00a065(2), 273\u2013290 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"59_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S. Dreyfus","year":"1972","unstructured":"Dreyfus, S., Wagner, R.: The Steiner problem in graphs. Networks\u00a01, 195\u2013207 (1972)","journal-title":"Networks"},{"key":"59_CR10","unstructured":"Fernau, H., Raible, D., Gaspers, S., Stepanov, A.A.: Exact exponential time algorithms for max internal spanning tree. CoRR, abs\/0811.1875 (2008)"},{"key":"59_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-87744-8_36","volume-title":"Algorithms - ESA 2008","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Faster steiner tree computation in polynomial-space. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol.\u00a05193, pp. 430\u2013441. Springer, Heidelberg (2008)"},{"issue":"3","key":"59_CR12","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00224-007-1324-4","volume":"41","author":"B. Fuchs","year":"2007","unstructured":"Fuchs, B., Kern, W., Molle, D., Richter, S., Rossmanith, P., Wang, X.: Dynamic programming for minimum Steiner trees. Theory of Computing Systems\u00a041(3), 493\u2013500 (2007)","journal-title":"Theory of Computing Systems"},{"key":"59_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-79228-4_42","volume-title":"Theory and Applications of Models of Computation","author":"S. Gaspers","year":"2008","unstructured":"Gaspers, S., Saurabh, S., Stepanov, A.A.: A moderately exponential time algorithm for full degree spanning tree. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 479\u2013489. Springer, Heidelberg (2008)"},{"issue":"1","key":"59_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics\u00a010(1), 196\u2013210 (1962)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"01","key":"59_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0305004100068936","volume":"108","author":"F. Jaeger","year":"1990","unstructured":"Jaeger, F., Vertigan, D.L., Welsh, D.J.A.: On the computational complexity of the jones and tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society\u00a0108(01), 35\u201353 (1990)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"59_CR16","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 and exclusion. Oper. Res. Lett.\u00a01, 49\u201351 (1982)","journal-title":"Oper. Res. Lett."},{"key":"59_CR17","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1145\/800179.810218","volume-title":"ACM 1977: Proceedings of the 1977 annual conference","author":"S. Kohn","year":"1977","unstructured":"Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the traveling salesman problem. In: ACM 1977: Proceedings of the 1977 annual conference, pp. 294\u2013300. ACM, New York (1977)"},{"key":"59_CR18","unstructured":"Nederlof, J.: Inclusion exclusion for hard problems. Master\u2019s thesis, Utrecht University (August 2008)"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion\/exclusion meets measure and conquer: Exact algorithms for counting dominating sets. Technical Report UU-CS-2008-043, Utrecht, The Netherlands (2008)","DOI":"10.1007\/978-3-642-04128-0_50"},{"key":"59_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-28639-4_25","volume-title":"Parameterized and Exact Computation","author":"G.J. Woeginger","year":"2004","unstructured":"Woeginger, G.J.: Space and time complexity of exact algorithms: Some open problems. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004, vol.\u00a03162, pp. 281\u2013290. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02927-1_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T04:14:51Z","timestamp":1633666491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02927-1_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029264","9783642029271"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02927-1_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}