{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:52Z","timestamp":1725795892026},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_46","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"551-562","source":"Crossref","is-referenced-by-count":2,"title":["Families with Infants: A General Approach to Solve Hard Partition Problems"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Golovnev","sequence":"first","affiliation":[]},{"given":"Alexander S.","family":"Kulikov","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Mihajlin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"46_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00453-001-0072-0","volume":"32","author":"E. Bax","year":"2002","unstructured":"Bax, E., Franklin, J.: A permanent algorithm with $\\exp[{\\Omega}(n ^{1\/3}\/2 \\ln n )]$ expected speedup for 0-1 matrices. Algorithmica\u00a032(1), 157\u2013162 (2002)","journal-title":"Algorithmica"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R. Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM\u00a09, 61\u201363 (1962)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A.: Determinant sums for undirected hamiltonicity. In: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010, pp. 173\u2013182 (2010)","key":"46_CR4","DOI":"10.1109\/FOCS.2010.24"},{"doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A.: Counting perfect matchings as fast as Ryser. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 914\u2013921. SIAM (2012)","key":"46_CR5","DOI":"10.1137\/1.9781611973099.73"},{"key":"46_CR6","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)"},{"issue":"3","key":"46_CR7","doi-asserted-by":"publisher","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 of Computing Systems\u00a047(3), 637\u2013654 (2010)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"46_CR8","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"},{"doi-asserted-by":"crossref","unstructured":"Cygan, M., Kratsch, S., Nederlof, J.: Fast hamiltonicity checking via bases of perfect matchings. In: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 301\u2013310 (2013)","key":"46_CR9","DOI":"10.1145\/2488608.2488646"},{"issue":"40-42","key":"46_CR10","doi-asserted-by":"publisher","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","volume":"411","author":"M. Cygan","year":"2010","unstructured":"Cygan, M., Pilipczuk, M.: Exact and approximate bandwidth. Theoretical Computer Science\u00a0411(40-42), 3701\u20133713 (2010)","journal-title":"Theoretical Computer Science"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-39206-1_31","volume-title":"Automata, Languages, and Programming","author":"M. Cygan","year":"2013","unstructured":"Cygan, M., Pilipczuk, M.: Faster exponential-time algorithms in graphs of bounded average degree. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol.\u00a07965, pp. 364\u2013375. Springer, Heidelberg (2013)"},{"issue":"1","key":"46_CR12","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"},{"doi-asserted-by":"crossref","unstructured":"Izumi, T., Wadayama, T.: A new direction for counting perfect matchings. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 591\u2013598. IEEE (2012)","key":"46_CR13","DOI":"10.1109\/FOCS.2012.28"},{"key":"46_CR14","first-page":"1","volume":"92","author":"L. Kronecker","year":"1882","unstructured":"Kronecker, L.: Grundz\u00fcge einer arithmetischen theorie der algebraischen gr\u00f6ssen. J. Reine Angew. Math.\u00a092, 1\u2013122 (1882)","journal-title":"J. Reine Angew. Math."},{"doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: Proceedings of the 42nd ACM symposium on Theory of computing, STOC 2010, pp. 321\u2013330. ACM (2010)","key":"46_CR15","DOI":"10.1145\/1806689.1806735"},{"key":"46_CR16","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":"46_CR17","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440147","volume-title":"Combinatorial mathematics","author":"H.J. Ryser","year":"1963","unstructured":"Ryser, H.J.: Combinatorial mathematics. Mathematical Association of America, Washington, DC (1963)"},{"issue":"3-4","key":"46_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Schonhage","year":"1971","unstructured":"Schonhage, A., Strassen, V.: Schnelle multiplikation grosser zahlen. Computing\u00a07(3-4), 281\u2013292 (1971)","journal-title":"Computing"},{"issue":"3","key":"46_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ipl.2005.06.007","volume":"96","author":"R.A. Servedio","year":"2005","unstructured":"Servedio, R.A., Wan, A.: Computing sparse permanents faster. Information Processing Letters\u00a096(3), 89\u201392 (2005)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge University Press (2009)","key":"46_CR20","DOI":"10.1017\/CBO9780511814549"},{"key":"46_CR21","first-page":"43","volume":"1","author":"J. Turk","year":"1982","unstructured":"Turk, J.: Fast arithmetic operations on numbers and polynomials. Mathematisch Centrum Computational Methods in Number Theory\u00a01, 43\u201354 (1982)","journal-title":"Mathematisch Centrum Computational Methods in Number Theory"}],"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-662-43948-7_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T22:11:46Z","timestamp":1597961506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}