{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:30:07Z","timestamp":1725795007487},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_29","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"375-388","source":"Crossref","is-referenced-by-count":1,"title":["Space Saving by Dynamic Algebraization"],"prefix":"10.1007","author":[{"given":"Martin","family":"F\u00fcrer","sequence":"first","affiliation":[]},{"given":"Huiwen","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A.: Counting perfect matchings as fast as Ryser. In: SODA, pp. 914\u2013921 (2012)","DOI":"10.1137\/1.9781611973099.73"},{"issue":"2","key":"29_CR2","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":"29_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":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol.\u00a0317, pp. 105\u2013118. Springer, Heidelberg (1988)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: STOC, pp. 226\u2013234 (1993)","DOI":"10.1145\/167088.167161"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30577-4_1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-55121-2_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.L. Bodlaender","year":"1992","unstructured":"Bodlaender, H.L., Gilbert, J.R., Kloks, T., Hafsteinsson, H.: Approximating treewidth, pathwidth, and minimum elimination tree height. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol.\u00a0570, pp. 1\u201312. Springer, Heidelberg (1992)"},{"issue":"2-3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0166-218X(03)00440-2","volume":"136","author":"V. Bouchitt\u00e9","year":"2004","unstructured":"Bouchitt\u00e9, V., Kratsch, D., M\u00fcller, H., Todinca, I.: On treewidth approximations. Discrete Appl. Math.\u00a0136(2-3), 183\u2013196 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"29_CR9","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"},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/070711761","volume":"39","author":"M. F\u00fcrer","year":"2009","unstructured":"F\u00fcrer, M.: Faster integer multiplication. SIAM J. Comput.\u00a039(3), 979\u20131005 (2009)","journal-title":"SIAM J. Comput."},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-44683-4_5","volume-title":"Mathematical Foundations of Computer Science 2001","author":"G. Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions: A survey. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 37\u201357. Springer, Heidelberg (2001)"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Kenyon, C., Randall, D., Sinclair, A.: Approximating the number of monomer-dimer coverings of a lattice. J. Stat. Phys.\u00a083 (1996)","DOI":"10.1007\/BF02183743"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","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. Discret. Math.\u00a023(1), 407\u2013427 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: ICALP, pp. 575\u2013586 (2008)","DOI":"10.1007\/978-3-540-70575-8_47"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Koutis, I., Williams, R.: Limits and applications of group algebras for parameterized problems. In: ICALP, pp. 653\u2013664 (2009)","DOI":"10.1007\/978-3-642-02927-1_54"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-25870-1_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Mnich, M., Saurabh, S.: Planar k-path in subexponential time and polynomial space. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 262\u2013270. Springer, Heidelberg (2011)"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: STOC, pp. 321\u2013330 (2010)","DOI":"10.1145\/1806689.1806735"},{"issue":"1","key":"29_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/256292.256294","volume":"44","author":"G.L. Miller","year":"1997","unstructured":"Miller, G.L., Teng, S.-H., Thurston, W., Vavasis, S.A.: Separators for sphere-packings and nearest neighbor graphs. J. ACM\u00a044(1), 1\u201329 (1997)","journal-title":"J. ACM"},{"issue":"4","key":"29_CR20","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/s00453-012-9630-x","volume":"65","author":"J. Nederlof","year":"2013","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using inclusion-exclusion. Algorithmica\u00a065(4), 868\u2013884 (2013)","journal-title":"Algorithmica"},{"issue":"6","key":"29_CR21","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","volume":"27","author":"J. Ne\u0161et\u0159il","year":"2006","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb.\u00a027(6), 1022\u20131041 (2006)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"29_CR22","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/BF00531932","volume":"2","author":"G.-C. Rota","year":"1964","unstructured":"Rota, G.-C.: On the foundations of combinatorial theory. i. theory of m\u00f6bius functions. Zeitschrift Wahrscheinlichkeitstheorie und Verwandte Gebiete\u00a02(4), 340\u2013368 (1964)","journal-title":"Zeitschrift Wahrscheinlichkeitstheorie und Verwandte Gebiete"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Stanley, R.P., Rota, G.C.: Enumerative Combinatorics, vol.\u00a01. Cambridge University Press (2000)","DOI":"10.1017\/CBO9780511805967.004"},{"key":"29_CR24","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1080\/14786436108243366","volume":"6","author":"H.N.V. Temperley","year":"1961","unstructured":"Temperley, H.N.V., Fisher, M.: Dimer problem in statistical mechanics - an exact result. Philosophical Magazine\u00a06, 1061\u20131063 (1961)","journal-title":"Philosophical Magazine"},{"key":"29_CR25","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":"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.) ESA 2009. LNCS, vol.\u00a05757, pp. 566\u2013577. Springer, Heidelberg (2009)"},{"key":"29_CR26","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":"29_CR27","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J.: Space and time complexity of exact algorithms: Some open problems (invited talk). In: 1st International Workshop on Parameterized and Exact Computation, pp. 281\u2013290 (2004)","DOI":"10.1007\/978-3-540-28639-4_25"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:39:56Z","timestamp":1558913996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}