Thore Husfeldt

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 24

Top Topics

Range Searching

Exact Computation

Top Venues

Publications

Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt
time? Fast deterministic set partitioning under the asymptotic rank conjecture. CoRR (2024)
Andreas Björklund, Thore Husfeldt, Petteri Kaski
The shortest even cycle problem is tractable. STOC (2022)
Radu Curticapean, Holger Dell, Thore Husfeldt
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ESA (2021)
Radu Curticapean, Holger Dell, Thore Husfeldt
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths. CoRR (2021)
Andreas Björklund, Thore Husfeldt, Petteri Kaski
The Shortest Even Cycle Problem is Tractable. CoRR (2021)
Thore Husfeldt
The Presburger Award 2021 - Laudatio for Shayan Oveis Gharan. Bull. EATCS 134 (2021)
Thore Husfeldt, Meena Mahajan, Mikolaj Bojanczyk
The Presburger Award for Young Scientists 2021 - Call for Nominations. Bull. EATCS 132 (2020)
Karl Bringmann, Thore Husfeldt, Måns Magnusson
Multivariate Analysis of Orthogonal Range Searching and Graph Distances. Algorithmica 82 (8) (2020)
Thore Husfeldt
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). CPM (2020)
Andreas Björklund, Thore Husfeldt
Shortest Two Disjoint Paths in Polynomial Time. SIAM J. Comput. 48 (6) (2019)
Thore Husfeldt, Meena Mahajan, Anca Muscholl
The Presburger Award for Young Scientists 2020 - Call for Nominations. Bull. EATCS 129 (2019)
Andreas Björklund, Thore Husfeldt
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. CoRR (2018)
Andreas Björklund, Thore Husfeldt
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. ISAAC (2018)
Karl Bringmann, Thore Husfeldt, Måns Magnusson
Multivariate Analysis of Orthogonal Range Searching and Graph Distances. IPEC (2018)
Cornelius Brand, Holger Dell, Thore Husfeldt
Extensor-Coding. CoRR (2018)
Karl Bringmann, Thore Husfeldt, Måns Magnusson
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth. CoRR (2018)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. ISAAC (2018)
Cornelius Brand, Holger Dell, Thore Husfeldt
Extensor-coding. STOC (2018)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. 87 (2017)
Thore Husfeldt, Iyad A. Kanj
Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica 79 (1) (2017)
Andreas Björklund, Thore Husfeldt, Isak Lyckberg
Computing the permanent modulo a prime power. Inf. Process. Lett. 125 (2017)
Thore Husfeldt
Computing Graph Distances Parameterized by Treewidth and Diameter. IPEC (2016)
Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond
The First Parameterized Algorithms and Computational Experiments Challenge. IPEC (2016)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, Pekka Parviainen
Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Trans. Algorithms 12 (1) (2016)
Thore Husfeldt
Graph colouring algorithms. CoRR (2015)
Andreas Björklund, Holger Dell, Thore Husfeldt
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. ICALP (1) (2015)
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ACM Trans. Algorithms 10 (4) (2014)
Andreas Björklund, Thore Husfeldt
Shortest Two Disjoint Paths in Polynomial Time. ICALP (1) (2014)
Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Dagstuhl Reports 3 (8) (2013)
Andreas Björklund, Thore Husfeldt
The Parity of Directed Hamiltonian Cycles CoRR (2013)
Andreas Björklund, Thore Husfeldt
The Parity of Directed Hamiltonian Cycles. FOCS (2013)
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial CoRR (2012)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The traveling salesman problem in bounded degree graphs. ACM Trans. Algorithms 8 (2) (2012)
Andreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen
Fast zeta transforms for lattices with few irreducibles. SODA (2012)
Andreas Björklund, Thore Husfeldt, Nina Taslaman
Shortest cycle through specified elements. SODA (2012)
Thore Husfeldt
Invitation to Algorithmic Uses of Inclusion-Exclusion. ICALP (2) (2011)
Thore Husfeldt
Invitation to Algorithmic Uses of Inclusion-Exclusion CoRR (2011)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and packing in linear space. Inf. Process. Lett. 111 (21-22) (2011)
Holger Dell, Thore Husfeldt, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ICALP (1) (2010)
Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin
10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Exact Complexity of NP-hard Problems (2010)
Thore Husfeldt, Nina Taslaman
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected. IPEC (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Evaluation of permanents in rings and semirings. Inf. Process. Lett. 110 (20) (2010)
Holger Dell, Thore Husfeldt, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial. Electron. Colloquium Comput. Complex. 17 (2010)
Thore Husfeldt, Nina Taslaman
The Exponential Time Complexity of Computing the Probability That a Graph is Connected CoRR (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and Packing in Linear Space. ICALP (1) (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Narrow sieves for parameterized paths and packings CoRR (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Trimmed Moebius Inversion and Graphs of Bounded Degree. Theory Comput. Syst. 47 (3) (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Paths and Packings in Halves. ESA (2009)
Andreas Björklund, Thore Husfeldt, Mikko Koivisto
Set Partitioning via Inclusion-Exclusion. SIAM J. Comput. 39 (2) (2009)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Paths and Packings in Halves CoRR (2009)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
On evaluation of permanents CoRR (2009)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The fast intersection transform with applications to counting paths CoRR (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The Travelling Salesman Problem in Bounded Degree Graphs. ICALP (1) (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Computing the Tutte Polynomial in Vertex-Exponential Time. FOCS (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Trimmed Moebius Inversion and Graphs of Bounded Degree CoRR (2008)
Andreas Björklund, Thore Husfeldt
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. Algorithmica 52 (2) (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Trimmed Moebius Inversion and Graphs of Bounded Degree. STACS (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fourier meets möbius: fast subset convolution. STOC (2007)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Computing the Tutte polynomial in vertex-exponential time CoRR (2007)
Andreas Björklund, Thore Husfeldt
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. ICALP (1) (2006)
Andreas Björklund, Thore Husfeldt
Inclusion--Exclusion Algorithms for Counting Set Partitions. FOCS (2006)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fourier meets Möbius: fast subset convolution CoRR (2006)
Andreas Björklund, Thore Husfeldt
Inclusion-Exclusion Based Algorithms for Graph Colouring. Electron. Colloquium Comput. Complex. 13 (044) (2006)
Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup
Black box for constant-time insertion in priority queues (note). ACM Trans. Algorithms 1 (1) (2005)
Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
Approximating Longest Directed Paths and Cycles. ICALP (2004)
Stephen Alstrup, Thore Husfeldt, Theis Rauhe
Dynamic nested brackets. Inf. Comput. 193 (2) (2004)
Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
Approximating Longest Directed Path Electron. Colloquium Comput. Complex. 10 (032) (2003)
Thore Husfeldt, Theis Rauhe
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. SIAM J. Comput. 32 (3) (2003)
Andreas Björklund, Thore Husfeldt
Finding a Path of Superlogarithmic Length. SIAM J. Comput. 32 (6) (2003)
Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos
Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81 (3) (2002)
Andreas Björklund, Thore Husfeldt
Finding a Path of Superlogarithmic Length. ICALP (2002)
Stephen Alstrup, Thore Husfeldt, Theis Rauhe
A cell probe lower bound for dynamic nearest-neighbor searching. SODA (2001)
Thore Husfeldt, Theis Rauhe
Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. ICALP (1998)
Stephen Alstrup, Thore Husfeldt, Theis Rauhe
Marked Ancestor Problems. FOCS (1998)
Thore Husfeldt, Theis Rauhe, Søren Skyum
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. SWAT (1996)
Thore Husfeldt, Theis Rauhe, Søren Skyum
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. Nord. J. Comput. 3 (4) (1996)
Thore Husfeldt
Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink. ESA (1995)
Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum
Dynamic Algorithms for the Dyck Languages. WADS (1995)