| 2026 | MFCS | Counting Equitable k-Colorings in Graphs of Bounded Clique-Width. | Holger Dell, Thore Husfeldt, Amir Nikabadi |
| 2025 | SODA | Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture. | Andreas Bjrklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt |
| 2022 | STOC | The shortest even cycle problem is tractable. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski |
| 2021 | ESA | Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. | Radu Curticapean, Holger Dell, Thore Husfeldt |
| 2020 | CPM | Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). | Thore Husfeldt |
| 2018 | ISAAC | Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. | Andreas Bjrklund, Thore Husfeldt |
| 2018 | ISAAC | Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2018 | STOC | Extensor-coding. | Cornelius Brand, Holger Dell, Thore Husfeldt |
| 2015 | ICALP | The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. | Andreas Bjrklund, Holger Dell, Thore Husfeldt |
| 2014 | ICALP | Shortest Two Disjoint Paths in Polynomial Time. | Andreas Bjrklund, Thore Husfeldt |
| 2013 | FOCS | The Parity of Directed Hamiltonian Cycles. | Andreas Bjrklund, Thore Husfeldt |
| 2012 | SODA | Shortest cycle through specified elements. | Andreas Bjrklund, Thore Husfeldt, Nina Taslaman |
| 2012 | SODA | Fast zeta transforms for lattices with few irreducibles. | Andreas Bjrklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen |
| 2011 | ICALP | Invitation to Algorithmic Uses of Inclusion-Exclusion. | Thore Husfeldt |
| 2010 | ICALP | Covering and Packing in Linear Space. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2010 | ICALP | Exponential Time Complexity of the Permanent and the Tutte Polynomial. | Holger Dell, Thore Husfeldt, Martin Wahlen |
| 2009 | ESA | Counting Paths and Packings in Halves. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2008 | FOCS | Computing the Tutte Polynomial in Vertex-Exponential Time. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2008 | ICALP | The Travelling Salesman Problem in Bounded Degree Graphs. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2008 | STACS | Trimmed Moebius Inversion and Graphs of Bounded Degree. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2007 | STOC | Fourier meets mbius: fast subset convolution. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2006 | FOCS | Inclusion--Exclusion Algorithms for Counting Set Partitions. | Andreas Bjrklund, Thore Husfeldt |
| 2006 | ICALP | Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. | Andreas Bjrklund, Thore Husfeldt |
| 2004 | ICALP | Approximating Longest Directed Paths and Cycles. | Andreas Bjrklund, Thore Husfeldt, Sanjeev Khanna |
| 2002 | ICALP | Finding a Path of Superlogarithmic Length. | Andreas Bjrklund, Thore Husfeldt |
| 2001 | SODA | A cell probe lower bound for dynamic nearest-neighbor searching. | Stephen Alstrup, Thore Husfeldt, Theis Rauhe |
| 1998 | FOCS | Marked Ancestor Problems. | Stephen Alstrup, Thore Husfeldt, Theis Rauhe |
| 1998 | ICALP | Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. | Thore Husfeldt, Theis Rauhe |
| 1995 | ESA | Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink. | Thore Husfeldt |
| 1995 | WADS | Dynamic Algorithms for the Dyck Languages. | Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Sren Skyum |