Get started
Author

Thore Husfeldt

Observed names: Husfeldt, Thore, T. Husfeldt
Observed institutions: Karlsruhe Institute of Technology, University of Copenhagen, Lund University, Aarhus University, Danish National Research Foundation, IT University of Copenhagen
ORCID: 0000-0001-9078-4512
Observed ORCID: 0000-0001-9078-4512
OpenAlex ID: A5041727204
Set Partitioning via Inclusion-Exclusion
2009 · Andreas Björklund, Thore Husfeldt, et al. · SIAM Journal on Computing · 399
Fourier meets möbius: fast subset convolution
2007 · Andreas Björklund, Thore Husfeldt, et al. · ACM Symposium on Theory of Computing (STOC) · 327
Marked ancestor problems
2002 · S. Alstrup, T. Husfeldt, et al. · Annual Symposium on Foundations of Computer Science · 143
Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I
2014 · Javier Esparza, Pierre Fraigniaud, et al. · Lecture notes in computer science · 129
Exponential Time Complexity of the Permanent and the Tutte Polynomial
2014 · Holger Dell, Thore Husfeldt, et al. · ACM Transactions on Algorithms · 109
PDF
Algorithms - ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings
2009 · Björklund, Andreas, Husfeldt, Thore, et al. · Lecture notes in computer science · 93
Inclusion--Exclusion Algorithms for Counting Set Partitions
2006 · Andreas Bjorklund, Thore Husfeldt · Annual Symposium on Foundations of Computer Science · 88
Narrow sieves for parameterized paths and packings
· Thore Husfeldt, Petteri Kaski, et al. · 83
Narrow sieves for parameterized paths and packings
2017 · Andreas Björklund, Thore Husfeldt, et al. · Journal of Computer and System Sciences · 79
PDF
Computing the Tutte Polynomial in Vertex-Exponential Time
2008 · Andreas Björklund, Thore Husfeldt, et al. · Annual Symposium on Foundations of Computer Science · 79
PDF
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
2007 · Andreas Björklund, Thore Husfeldt · Algorithmica · 75
Approximating Longest Directed Paths and Cycles
2004 · Andreas Björklund, Thore Husfeldt, et al. · Lecture notes in computer science · 74
The traveling salesman problem in bounded degree graphs
2012 · Andreas Björklund, Thore Husfeldt, et al. · ACM Transactions on Algorithms · 71
Trimmed Moebius Inversion and Graphs of Bounded Degree
2009 · Andreas Björklund, Thore Husfeldt, et al. · Theory of Computing Systems · 63
PDF
The First Parameterized Algorithms and Computational Experiments Challenge
2017 · Dell, Holger, Husfeldt, Thore, et al. · Aaltodoc (Aalto University) · 54
PDF
Counting Paths and Packings in Halves
2009 · Andreas Björklund, Thore Husfeldt, et al. · Lecture notes in computer science · 53
The Travelling Salesman Problem in Bounded Degree Graphs
2008 · Andreas Björklund, Thore Husfeldt, et al. · Lecture notes in computer science · 49
Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II
2014 · Javier Esparza, Pierre Fraigniaud, et al. · Lecture notes in computer science · 47
Finding a Path of Superlogarithmic Length
2003 · Andreas Björklund, Thore Husfeldt · SIAM Journal on Computing · 46
Shortest Cycle Through Specified Elements
2012 · Andreas Björklund, Thore Husfeldt, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 44
Shortest Two Disjoint Paths in Polynomial Time
2014 · Andreas Björklund, Thore Husfeldt · Lecture notes in computer science · 29
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
2020 · Karl Bringmann, Thore Husfeldt, et al. · Algorithmica · 28
PDF
Shortest Two Disjoint Paths in Polynomial Time
2019 · Andreas Björklund, Thore Husfeldt · SIAM Journal on Computing · 28
Extensor-coding
2018 · Cornelius Brand, Holger Dell, et al. · ACM Symposium on Theory of Computing (STOC) · 27
PDF
Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method
1998 · Thore Husfeldt, Theis Rauhe · Lecture notes in computer science · 24
Works count: 107
Citation count: 2,749
H-index: 24
I10-index: 49
Year
Topic
Type