{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:25Z","timestamp":1725558985104},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_61","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"727-737","source":"Crossref","is-referenced-by-count":2,"title":["Covering and Packing in Linear Space"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bj\u00f6rklund","sequence":"first","affiliation":[]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[]},{"given":"Mikko","family":"Koivisto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","first-page":"217","volume-title":"Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics","author":"R. Bellman","year":"1960","unstructured":"Bellman, R.: Combinatorial Processes and Dynamic Programming. In: Bellman, R., Hall, M. (eds.) Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics, vol.\u00a010, pp. 217\u2013249. American Mathematical Society, Providence (1960)"},{"key":"61_CR2","doi-asserted-by":"crossref","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. Assoc. Comput. Mach.\u00a09, 61\u201363 (1962)","journal-title":"J. Assoc. Comput. Mach."},{"key":"61_CR3","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\u2013exclusion. SIAM J. Comput. Special Issue for FOCS\u00a02006\u00a039, 546\u2013563 (2009)","journal-title":"SIAM J. Comput. Special Issue for FOCS\u00a02006"},{"key":"61_CR4","first-page":"67","volume-title":"39th ACM Symposium on Theory of Computing (STOC\u00a02007)","author":"A. Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: fast subset convolution. In: 39th ACM Symposium on Theory of Computing (STOC\u00a02007), pp. 67\u201374. ACM Press, New York (2007)"},{"key":"61_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/FOCS.2008.40","volume-title":"49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008)","author":"A. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time. In: 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 677\u2013686. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"61_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1435375.1435384","volume":"5","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A., Stepanov, A.: Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Transactions on Algorithms\u00a05, 1\u201317 (2008)","journal-title":"ACM Transactions on Algorithms"},{"key":"61_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. Indust. Appl. Math.\u00a010, 196\u2013210 (1962)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"61_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/21.148425","volume":"22","author":"R. Kennes","year":"1991","unstructured":"Kennes, R.: Computational aspects of the Moebius transform of a graph. IEEE Transactions on Systems, Man, and Cybernetics\u00a022, 201\u2013223 (1991)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"Koivisto, M., Parviainen, P.: A space-time tradeoff for permutation problems. In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 484\u2013492 (2010)","DOI":"10.1137\/1.9781611973075.41"},{"key":"61_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics\u00a03, 23\u201328 (1965)","journal-title":"Israel Journal of Mathematics"}],"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-14165-2_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:20:36Z","timestamp":1619785236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}