Thore Husfeldt
Thore Husfeldt
IT University of Copenhagen and Lund University
Bekræftet mail på itu.dk - Startside
Titel
Citeret af
Citeret af
År
Set partitioning via inclusion-exclusion
A Björklund, T Husfeldt, M Koivisto
SIAM Journal on Computing 39 (2), 546-563, 2009
3672009
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
3252007
Marked ancestor problems
S Alstrup, T Husfeldt, T Rauhe
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
1431998
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
133*2017
Inclusion–Exclusion Algorithms for Counting Set Partitions
A Bjorklund, T Husfeldt
Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium …, 2006
952006
Exact algorithms for exact satisfiability and number of perfect matchings
A Björklund, T Husfeldt
Algorithmica 52 (2), 226-249, 2008
832008
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
772008
Approximating longest directed paths and cycles
A Björklund, T Husfeldt, S Khanna
International Colloquium on Automata, Languages, and Programming, 222-233, 2004
752004
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
632008
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
562010
Finding a path of superlogarithmic length
A Björklund, T Husfeldt
SIAM Journal on Computing 32 (6), 1395-1402, 2003
562003
Exponential time complexity of the permanent and the Tutte polynomial
H Dell, T Husfeldt, D Marx, N Taslaman, M Wahlén
ACM Transactions on Algorithms (TALG) 10 (4), 1-32, 2014
532014
Counting paths and packings in halves
A Björklund, T Husfeldt, P Kaski, M Koivisto
European Symposium on Algorithms, 578-586, 2009
492009
The first parameterized algorithms and computational experiments challenge
H Dell, T Husfeldt, BMP Jansen, P Kaski, C Komusiewicz, FA Rosamond
11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017
452017
New lower bound techniques for dynamic partial sums and related problems
T Husfeldt, T Rauhe
SIAM Journal on Computing 32 (3), 736-753, 2003
42*2003
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
412012
Shortest cycle through specified elements
A Björklund, T Husfeldt, N Taslaman
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012
402012
Shortest two disjoint paths in polynomial time
A Björklund, T Husfeldt
International Colloquium on Automata, Languages, and Programming, 211-222, 2014
362014
Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
T Husfeldt, T Rauhe, S Skyum
Nordic Journal of Computing 3 (4), 323–336, 1996
331996
Extensor-coding
C Brand, H Dell, T Husfeldt
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
232018
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20