{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:03Z","timestamp":1725472023339},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_48","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"548-559","source":"Crossref","is-referenced-by-count":5,"title":["Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11754602_4","volume-title":"Recent Advances in Constraints","author":"O. Angelsmark","year":"2006","unstructured":"Angelsmark, O., Thapper, J.: Partitioning based algorithms for some colouring problems. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS (LNAI), vol.\u00a03978, pp. 44\u201358. Springer, Heidelberg (2006)"},{"issue":"4","key":"48_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(93)90033-6","volume":"47","author":"E.T. Bax","year":"1993","unstructured":"Bax, E.T.: Inclusion and exclusion algorithm for the Hamiltonian Path problem. Inf. Process. Lett.\u00a047(4), 203\u2013207 (1993)","journal-title":"Inf. Process. Lett."},{"key":"48_CR3","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Inclusion\u2013exclusion based algorithms for graph colouring. Technical Report TR06-44, Elect. Coll. Comput. Compl. (2006)"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"J.M. Byskov","year":"2004","unstructured":"Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters\u00a032, 547\u2013556 (2004)","journal-title":"Operations Research Letters"},{"key":"48_CR5","unstructured":"Byskov, J.M.: Exact algorithms for graph colouring and exact satisfiability. PhD thesis, University of Aarhus (2004)"},{"key":"48_CR6","unstructured":"Chien, S.: A determinant-based algorithm for counting perfect matchings in a general graph. In: Proc. 15th SODA, pp. 728\u2013735 (2004)"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1093\/comjnl\/14.1.38","volume":"14","author":"N. Christofides","year":"1971","unstructured":"Christofides, N.: An algorithm for the chromatic number of a graph. Computer J.\u00a014, 38\u201339 (1971)","journal-title":"Computer J."},{"issue":"3","key":"48_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput.\u00a09(3), 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"issue":"7","key":"48_CR9","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"issue":"2","key":"48_CR10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.7155\/jgaa.00064","volume":"7","author":"D. Eppstein","year":"2003","unstructured":"Eppstein, D.: Small maximal independent sets and faster exact graph coloring. J. Graph Algorithms and Applications\u00a07(2), 131\u2013140 (2003)","journal-title":"J. Graph Algorithms and Applications"},{"issue":"2","key":"48_CR11","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/S0196-6774(02)00224-9","volume":"45","author":"T. Feder","year":"2002","unstructured":"Feder, T., Motwani, R.: Worst-case time bounds for coloring and satisfiability problems. J. Algorithms\u00a045(2), 192\u2013201 (2002)","journal-title":"J. Algorithms"},{"key":"48_CR12","unstructured":"Feige, U., Kilian, J.: Exponential time algorithms for computing the bandwidth of a graph. Manuscript, cited in [24]"},{"issue":"3","key":"48_CR13","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1137\/0216034","volume":"16","author":"Y. Gurevich","year":"1987","unstructured":"Gurevich, Y., Shelah, S.: Expected computation time for Hamiltonian path problem. SIAM Journal on Computing\u00a016(3), 486\u2013502 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"48_CR14","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1137\/0406022","volume":"6","author":"M. Hujter","year":"1993","unstructured":"Hujter, M., Tuza, Z.: On the number of maximal independent sets in triangle-free graphs. SIAM J. Discrete Mathematics\u00a06(2), 284\u2013288 (1993)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In: Proc. 33rd STOC, pp. 712\u2013721 (2001)","DOI":"10.1145\/380752.380877"},{"issue":"3","key":"48_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: A note on the complexity of the chromatic number problem. Information Processing Letters\u00a05(3), 66\u201367 (1976)","journal-title":"Information Processing Letters"},{"issue":"1","key":"48_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ipl.2005.08.011","volume":"97","author":"B.A. Madsen","year":"2006","unstructured":"Madsen, B.A.: An algorithm for exact satisfiability analysed with the number of clauses as parameter. Information Processing Letters\u00a097(1), 28\u201330 (2006)","journal-title":"Information Processing Letters"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. In: Israel J. Math. (1965)","DOI":"10.1007\/BF02760024"},{"key":"48_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-30577-4_31","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"S. Porschen","year":"2005","unstructured":"Porschen, S.: On some weighted satisfiability and graph problems. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 278\u2013287. Springer, Heidelberg (2005)"},{"key":"48_CR20","doi-asserted-by":"crossref","unstructured":"Ryser, H.J.: Combinatorial Mathematics. Carus Math. Monographs, vol.\u00a014. Math. Assoc. America (1963)","DOI":"10.5948\/UPO9781614440147"},{"issue":"3","key":"48_CR21","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput.\u00a06(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"48_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"key":"48_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/978-3-540-27836-8_101","volume-title":"Automata, Languages and Programming","author":"R. Williams","year":"2004","unstructured":"Williams, R.: A new algorithm for optimal constraint satisfaction and its implications. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1227\u20131237. Springer, Heidelberg (2004)"},{"key":"48_CR24","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: Combinatorial optimization: Eureka, you shrink!, pp. 185\u2013207. Springer, Heidelberg (2003)"},{"key":"48_CR25","series-title":"Lecture Notes in Computer Science","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. LNCS, vol.\u00a03162, pp. 281\u2013290. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T21:58:09Z","timestamp":1586987889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11786986_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}