{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:54:33Z","timestamp":1725738873919},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392054"},{"type":"electronic","value":"9783642392061"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39206-1_31","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T17:20:16Z","timestamp":1372785616000},"page":"364-375","source":"Crossref","is-referenced-by-count":5,"title":["Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree"],"prefix":"10.1007","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","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"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A.: Determinant Sums for Undirected Hamiltonicity. In: FOCS, pp. 173\u2013182. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.24"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A.: Counting perfect matchings as fast as Ryser. In: Rabani, Y. (ed.) SODA, pp. 914\u2013921. SIAM (2012)","DOI":"10.1137\/1.9781611973099.73"},{"issue":"3","key":"31_CR4","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 Comput. Syst.\u00a047(3), 637\u2013654 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"31_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/2151171.2151181","volume":"8","author":"A. Bj\u00f6rklund","year":"2012","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The traveling salesman problem in bounded degree graphs. ACM Transactions on Algorithms\u00a08(2), 18 (2012)","journal-title":"ACM Transactions on Algorithms"},{"key":"31_CR6","doi-asserted-by":"crossref","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 (2012)","DOI":"10.1109\/CCC.2012.36"},{"key":"31_CR7","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. J. Soc. Ind. Appl. Math.\u00a010, 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"2","key":"31_CR8","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. J. Comput. Syst. Sci.\u00a062(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Izumi, T., Wadayama, T.: A new direction for counting perfect matchings. In: FOCS, pp. 591\u2013598. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.28"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Known algorithms on graphs on bounded treewidth are probably optimal. In: Randall, D. (ed.) SODA, pp. 777\u2013789. SIAM (2011)","DOI":"10.1137\/1.9781611973082.61"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Patrascu, M., Williams, R.: On the Possibility of Faster SAT Algorithms. In: SODA, pp. 1065\u20131075 (2010)","DOI":"10.1137\/1.9781611973075.86"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Ryser, H.: Combinatorial Mathematics. The Carus mathematical monographs. Mathematical Association of America (1963)","DOI":"10.5948\/UPO9781614440147"},{"issue":"3","key":"31_CR13","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. Inf. Process. Lett.\u00a096(3), 89\u201392 (2005)","journal-title":"Inf. Process. Lett."},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"}],"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-39206-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T14:46:16Z","timestamp":1596033976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39206-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392054","9783642392061"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39206-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}