| Set partitioning via inclusion-exclusion A Björklund, T Husfeldt, M Koivisto SIAM Journal on Computing 39 (2), 546-563, 2009 | 463 | 2009 |
| Fourier meets Möbius: fast subset convolution A Björklund, T Husfeldt, P Kaski, M Koivisto Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 393 | 2007 |
| Marked ancestor problems S Alstrup, T Husfeldt, T Rauhe Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998 | 162 | 1998 |
| Narrow sieves for parameterized paths and packings A Björklund, T Husfeldt, P Kaski, M Koivisto Journal of Computer and System Sciences 87, 119-139, 2017 | 160 | 2017 |
| Exponential time complexity of the permanent and the Tutte polynomial H Dell, T Husfeldt, D Marx, N Taslaman, M Wahlen ACM Transactions on Algorithms (TALG) 10 (4), 1-32, 2014 | 126 | 2014 |
| Inclusion–Exclusion Algorithms for Counting Set Partitions A Bjorklund, T Husfeldt Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium …, 2006 | 110 | 2006 |
| Approximating longest directed paths and cycles A Björklund, T Husfeldt, S Khanna Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004 | 100 | 2004 |
| Exact algorithms for exact satisfiability and number of perfect matchings A Björklund, T Husfeldt Algorithmica 52, 226-249, 2008 | 97 | 2008 |
| Computing the Tutte polynomial in vertex-exponential time A Björklund, T Husfeldt, P Kaski, M Koivisto 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 677-686, 2008 | 96 | 2008 |
| The travelling salesman problem in bounded degree graphs A Björklund, T Husfeldt, P Kaski, M Koivisto International Colloquium on Automata, Languages, and Programming, 198-209, 2008 | 66 | 2008 |
| The first parameterized algorithms and computational experiments challenge H Dell, T Husfeldt, BMP Jansen, P Kaski, C Komusiewicz, FA Rosamond International Symposium on Parameterized and Exact Computation, 1-9, 2017 | 65 | 2017 |
| Trimmed Moebius inversion and graphs of bounded degree A Björklund, T Husfeldt, P Kaski, M Koivisto Theory of Computing Systems 47 (3), 637-654, 2010 | 65 | 2010 |
| Shortest cycle through specified elements A Björklund, T Husfeldt, N Taslaman Proceedings of the twenty-third annual ACM-SIAM symposium on discrete …, 2012 | 61 | 2012 |
| Finding a path of superlogarithmic length A Björklund, T Husfeldt SIAM Journal on Computing 32 (6), 1395-1402, 2003 | 59 | 2003 |
| Counting paths and packings in halves A Björklund, T Husfeldt, P Kaski, M Koivisto European Symposium on Algorithms, 578-586, 2009 | 58 | 2009 |
| The traveling salesman problem in bounded degree graphs A Björklund, T Husfeldt, P Kaski, M Koivisto ACM Transactions on Algorithms (TALG) 8 (2), 1-13, 2012 | 51 | 2012 |
| Shortest two disjoint paths in polynomial time A Björklund, T Husfeldt Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 44 | 2014 |
| New lower bound techniques for dynamic partial sums and related problems T Husfeldt, T Rauhe SIAM Journal on Computing 32 (3), 736-753, 2003 | 44* | 2003 |
| Extensor-coding C Brand, H Dell, T Husfeldt Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 41 | 2018 |
| Fast zeta transforms for lattices with few irreducibles A Björklund, T Husfeldt, P Kaski, M Koivisto, J Nederlof, P Parviainen ACM Transactions on Algorithms (TALG) 12 (1), 1-19, 2015 | 36 | 2015 |