Research output per year
Research output per year
Search results
-
2015
Monstret i Turings bibliotek
Translated title of the contribution :The Monster in the Library of Turing Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
-
2014
Exponential Time Complexity of the Permanent and the Tutte Polynomial
Dell, H., Husfeldt, T., Marx, D., Taslaman, N. S. & Wahlén, M., 2014, In: A C M Transactions on Algorithms. 10, 4, p. 21:1-21:32 32 p., 21.Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
-
2013
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time: Dagstuhl Seminar 13331
Husfeldt, T., Paturi, R., Sorkin, G. B. & Williams, R., 2013, In: Dagstuhl Seminar Proceedings. 3, 8, p. 40-72 33 p.Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
-
2012
The traveling salesman problem in bounded degree graphs
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2012, In: A C M Transactions on Algorithms. 8, 2Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
-
2011
Covering and packing in linear space
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2011, In: Information Processing Letters. 111, 21-22, p. 1033 3 p.Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
-
2010
Evaluation of permanents in rings and semirings
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2010, In: Information Processing Letters. 110, p. 867–870Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
-
Trimmed Moebius Inversion and Graphs of Bounded Degree
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2010, In: Theory of Computing Systems. 47, 3, p. 637-654Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
-
2009
Set partitioning via inclusion–exclusion
Björklund, A., Husfeldt, T. & Koivisto, M., 2009, In: SIAM Journal on Computing. 39, 2, p. 546-563Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
-
2008
Exact algorithms for exact satisfiability and number of perfect matchings
Björklund, A. & Husfeldt, T., 2008, In: Algorithmica. 52, 2, p. 226-249Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review