| Set partitioning via inclusion-exclusion A Björklund, T Husfeldt, M Koivisto SIAM Journal on Computing 39 (2), 546-563, 2009 | 547* | 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 | 395 | 2007 |
| Determinant sums for undirected hamiltonicity A Bjorklund SIAM Journal on Computing 43 (1), 280-299, 2014 | 290 | 2014 |
| 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 | 164 | 2017 |
| 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 | 116* | 2012 |
| Approximating longest directed paths and cycles A Björklund, T Husfeldt, S Khanna Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004 | 112* | 2004 |
| Listing triangles A Björklund, R Pagh, VV Williams, U Zwick International Colloquium on Automata, Languages, and Programming, 223-234, 2014 | 98 | 2014 |
| Exact algorithms for exact satisfiability and number of perfect matchings A Björklund, T Husfeldt Algorithmica 52, 226-249, 2008 | 98 | 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 |
| A faster hafnian formula for complex matrices and its benchmarking on a supercomputer A Björklund, B Gupt, N Quesada Journal of Experimental Algorithmics (JEA) 24, 1-17, 2019 | 90 | 2019 |
| Constrained multilinear detection and generalized graph motifs A Björklund, P Kaski, Ł Kowalik Algorithmica 74, 947-967, 2016 | 73* | 2016 |
| Position code MP Pettersson, A Björklund US Patent 6,667,695, 2003 | 72 | 2003 |
| Method and apparatus for extracting information from a target area within a two-dimensional graphical object in an image K Astrom, A Bjorklund, M Sjolin, M Andreasson US Patent App. 10/165,653, 2003 | 72 | 2003 |
| Shortest two disjoint paths in polynomial time A Björklund, T Husfeldt SIAM Journal on Computing 48 (6), 1698-1710, 2019 | 66* | 2019 |
| 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 | 66 | 2010 |
| Counting paths and packings in halves A Björklund, T Husfeldt, P Kaski, M Koivisto European Symposium on Algorithms, 578-586, 2009 | 64* | 2009 |
| 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 |
| Tracking objects on a touch surface T Christiansson, N Ohlsson, A Bjorklund, MP Wallander US Patent 8,982,084, 2015 | 50 | 2015 |
| Counting perfect matchings as fast as Ryser A Björklund Proceedings of the twenty-third annual acm-siam symposium on discrete …, 2012 | 48 | 2012 |
Thore HusfeldtIT University of CopenhagenVerified email at itu.dk
