Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink. - Thore Husfeldt (ESA, 1995)

Dynamic Algorithms for the Dyck Languages. - Gudmund Skovbjerg Frandsen; Thore Husfeldt; Peter Bro Miltersen; Theis Rauhe; Søren Skyum (WADS, 1995)

Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. - Thore Husfeldt; Theis Rauhe; Søren Skyum (SWAT, 1996)

Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. - Thore Husfeldt; Theis Rauhe; Søren Skyum (Nord. J. Comput., 1996)

Marked Ancestor Problems. - Stephen Alstrup; Thore Husfeldt; Theis Rauhe (FOCS, 1998)

Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. - Thore Husfeldt; Theis Rauhe (ICALP, 1998)

A cell probe lower bound for dynamic nearest-neighbor searching. - Stephen Alstrup; Thore Husfeldt; Theis Rauhe (SODA, 2001)

Lower bounds for approximate polygon decomposition and minimum gap. - Joachim Gudmundsson; Thore Husfeldt; Christos Levcopoulos (Inf. Process. Lett., 2002)

Approximating Longest Directed Path - Andreas Björklund; Thore Husfeldt; Sanjeev Khanna (Electron. Colloquium Comput. Complex., 2003)

Finding a Path of Superlogarithmic Length. - Andreas Björklund; Thore Husfeldt (SIAM J. Comput., 2003)

New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. - Thore Husfeldt; Theis Rauhe (SIAM J. Comput., 2003)

Approximating Longest Directed Paths and Cycles. - Andreas Björklund; Thore Husfeldt; Sanjeev Khanna (ICALP, 2004)

Dynamic nested brackets. - Stephen Alstrup; Thore Husfeldt; Theis Rauhe (Inf. Comput., 2004)

Black box for constant-time insertion in priority queues (note). - Stephen Alstrup; Thore Husfeldt; Theis Rauhe; Mikkel Thorup (ACM Trans. Algorithms, 2005)

Inclusion–Exclusion Algorithms for Counting Set Partitions. - Andreas Björklund; Thore Husfeldt (FOCS, 2006)

Inclusion-Exclusion Based Algorithms for Graph Colouring. - Andreas Björklund; Thore Husfeldt (Electron. Colloquium Comput. Complex., 2006)

Fourier meets möbius: fast subset convolution. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (STOC, 2007)

Computing the Tutte Polynomial in Vertex-Exponential Time. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (FOCS, 2008)

The Travelling Salesman Problem in Bounded Degree Graphs. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (ICALP (1), 2008)

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. - Andreas Björklund; Thore Husfeldt (Algorithmica, 2008)

The fast intersection transform with applications to counting paths - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (CoRR, 2008)

Exact Graph Coloring Using Inclusion-Exclusion. - Andreas Björklund; Thore Husfeldt (Encyclopedia of Algorithms, 2008)

Counting Paths and Packings in Halves. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (ESA, 2009)

On evaluation of permanents - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (CoRR, 2009)

Set Partitioning via Inclusion-Exclusion. - Andreas Björklund; Thore Husfeldt; Mikko Koivisto (SIAM J. Comput., 2009)

10441 Abstracts Collection - Exact Complexity of NP-hard Problems. - Thore Husfeldt; Dieter Kratsch; Ramamohan Paturi; Gregory B. Sorkin (Exact Complexity of NP-hard Problems, 2010)

The Exponential Time Complexity of Computing the Probability That a Graph Is Connected. - Thore Husfeldt; Nina Taslaman (IPEC, 2010)

Exponential Time Complexity of the Permanent and the Tutte Polynomial. - Holger Dell; Thore Husfeldt; Martin Wahlen (Electron. Colloquium Comput. Complex., 2010)

Evaluation of permanents in rings and semirings. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (Inf. Process. Lett., 2010)

Trimmed Moebius Inversion and Graphs of Bounded Degree. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (Theory Comput. Syst., 2010)

Invitation to Algorithmic Uses of Inclusion-Exclusion. - Thore Husfeldt (ICALP (2), 2011)

Covering and packing in linear space. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (Inf. Process. Lett., 2011)

Shortest cycle through specified elements. - Andreas Björklund; Thore Husfeldt; Nina Taslaman (SODA, 2012)

The traveling salesman problem in bounded degree graphs. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (ACM Trans. Algorithms, 2012)

The Parity of Directed Hamiltonian Cycles. - Andreas Björklund; Thore Husfeldt (FOCS, 2013)

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). - Thore Husfeldt; Ramamohan Paturi; Gregory B. Sorkin; Ryan Williams 001 (Dagstuhl Reports, 2013)

Exponential Time Complexity of the Permanent and the Tutte Polynomial. - Holger Dell; Thore Husfeldt; Dániel Marx; Nina Taslaman; Martin Wahlen (ACM Trans. Algorithms, 2014)

The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. - Andreas Björklund; Holger Dell; Thore Husfeldt (ICALP (1), 2015)

Graph colouring algorithms. - Thore Husfeldt (CoRR, 2015)

The First Parameterized Algorithms and Computational Experiments Challenge. - Holger Dell; Thore Husfeldt; Bart M. P. Jansen; Petteri Kaski; Christian Komusiewicz; Frances A. Rosamond (IPEC, 2016)

Computing Graph Distances Parameterized by Treewidth and Diameter. - Thore Husfeldt (IPEC, 2016)

Fast Zeta Transforms for Lattices with Few Irreducibles. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto; Jesper Nederlof; Pekka Parviainen (ACM Trans. Algorithms, 2016)

Exact Graph Coloring Using Inclusion-Exclusion. - Andreas Björklund; Thore Husfeldt (Encyclopedia of Algorithms, 2016)

Guest Editorial: Special Issue on Parameterized and Exact Computation. - Thore Husfeldt; Iyad A. Kanj (Algorithmica, 2017)

Computing the permanent modulo a prime power. - Andreas Björklund; Thore Husfeldt; Isak Lyckberg (Inf. Process. Lett., 2017)

Narrow sieves for parameterized paths and packings. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (J. Comput. Syst. Sci., 2017)

Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. - Andreas Björklund; Thore Husfeldt (ISAAC, 2018)

Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. - Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto (ISAAC, 2018)

Extensor-coding. - Cornelius Brand; Holger Dell; Thore Husfeldt (STOC, 2018)

Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth. - Karl Bringmann; Thore Husfeldt; Måns Magnusson (CoRR, 2018)

The Presburger Award for Young Scientists 2020 - Call for Nominations. - Thore Husfeldt; Meena Mahajan; Anca Muscholl (Bull. EATCS, 2019)

Shortest Two Disjoint Paths in Polynomial Time. - Andreas Björklund; Thore Husfeldt (SIAM J. Comput., 2019)

Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). - Thore Husfeldt (CPM, 2020)

Multivariate Analysis of Orthogonal Range Searching and Graph Distances. - Karl Bringmann; Thore Husfeldt; Måns Magnusson (Algorithmica, 2020)

The Presburger Award for Young Scientists 2021 - Call for Nominations. - Thore Husfeldt; Meena Mahajan; Mikolaj Bojanczyk (Bull. EATCS, 2020)

Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. - Radu Curticapean; Holger Dell; Thore Husfeldt (ESA, 2021)

The Presburger Award 2021 - Laudatio for Shayan Oveis Gharan. - Thore Husfeldt (Bull. EATCS, 2021)

The shortest even cycle problem is tractable. - Andreas Björklund; Thore Husfeldt; Petteri Kaski (STOC, 2022)

Chromatic number in 1.9999n time? Fast deterministic set partitioning under the asymptotic rank conjecture. - Andreas Björklund; Radu Curticapean; Thore Husfeldt; Petteri Kaski; Kevin Pratt (CoRR, 2024)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture. - Andreas Björklund; Radu Curticapean; Thore Husfeldt; Petteri Kaski; Kevin Pratt (SODA, 2025)

Finding longer cycles via shortest colourful cycle. - Andreas Björklund; Thore Husfeldt (SOSA, 2025)