Optimal Adaptive Fault Diagnosis of Hypercubes. - Andreas Björklund (SWAT, 2000)

Fast Boolean Matrix Multiplication for Highly Clustered Data. - Andreas Björklund; Andrzej Lingas (WADS, 2001)

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)

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

Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs. - Andreas Björklund (ESA, 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)

Algorithmic Bounds for Presumably Hard Combinatorial Problems. - Andreas Björklund (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)

Exact Covers via Determinants. - Andreas Björklund (STACS, 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)

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

The Path Taken for k-Path. - Andreas Björklund (IPEC, 2012)

Counting perfect matchings as fast as Ryser. - Andreas Björklund (SODA, 2012)

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

Below All Subsets for Permutational Counting Problems - Andreas Björklund (CoRR, 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)

Probably Optimal Graph Motifs. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik (STACS, 2013)

Counting closed trails. - Andreas Björklund; Petteri Kaski (Inf. Process. Lett., 2013)

Fast Witness Extraction Using a Decision Oracle. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik (ESA, 2014)

Listing Triangles. - Andreas Björklund; Rasmus Pagh; Virginia Vassilevska Williams; Uri Zwick (ICALP (1), 2014)

Determinant Sums for Undirected Hamiltonicity. - Andreas Björklund (SIAM J. Comput., 2014)

Engineering Motif Search for Large Graphs. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik; Juho Lauri (ALENEX, 2015)

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

Uniquely Coloring Graphs over Path Decompositions. - Andreas Björklund (CoRR, 2015)

Determinant Sums for Hamiltonicity (Invited Talk). - Andreas Björklund (IPEC, 2016)

How Proofs are Prepared at Camelot: Extended Abstract. - Andreas Björklund; Petteri Kaski (PODC, 2016)

Coloring Graphs Having Few Colorings Over Path Decompositions. - Andreas Björklund (SWAT, 2016)

Below All Subsets for Some Permutational Counting Problems . - Andreas Björklund (SWAT, 2016)

Constrained Multilinear Detection and Generalized Graph Motifs. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik (Algorithmica, 2016)

How proofs are prepared at Camelot. - Andreas Björklund; Petteri Kaski (CoRR, 2016)

Modular Sieves for Directed Hamiltonian Cycles. - Andreas Björklund; Ioannis Koutis (CoRR, 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)

Directed Hamiltonicity and Out-Branchings via Generalized Laplacians. - Andreas Björklund; Petteri Kaski; Ioannis Koutis (ICALP, 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)

Spotting Trees with Few Leaves. - Andreas Björklund; Vikram Kamat; Lukasz Kowalik; Meirav Zehavi (SIAM J. Discret. Math., 2017)

Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik (ACM Trans. Algorithms, 2017)

Exploiting Sparsity for Bipartite Hamiltonicity. - Andreas Björklund (ISAAC, 2018)

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)

A faster hafnian formula for complex matrices and its benchmarking on the Titan supercomputer. - Andreas Björklund; Brajesh Gupt; Nicolás Quesada (CoRR, 2018)

Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors. - Andreas Björklund; Ryan Williams 001 (ICALP, 2019)

Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. - Andreas Björklund; Petteri Kaski; Ryan Williams 001 (ICALP, 2019)

Approximate Counting of k-Paths: Deterministic and in Polynomial Space. - Andreas Björklund; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ICALP, 2019)

Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. - Andreas Björklund; Petteri Kaski; Ryan Williams 001 (Algorithmica, 2019)

A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer. - Andreas Björklund; Brajesh Gupt; Nicolás Quesada (ACM J. Exp. Algorithmics, 2019)

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

Counting Short Vector Pairs by Inner Product and Relations to the Permanent. - Andreas Björklund; Petteri Kaski (ICALP, 2021)

The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. - Andreas Björklund; Petteri Kaski (SODA, 2021)

An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs. - Andreas Björklund (STACS, 2021)

Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. - Daniel Lokshtanov; Andreas Björklund; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2021)

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

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. - Andreas Björklund; Petteri Kaski; Jesper Nederlof (ICALP, 2024)

The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True. - Andreas Björklund; Petteri Kaski (STOC, 2024)

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)

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms. - Andreas Björklund; Petteri Kaski; Tomohiro Koana; Jesper Nederlof (CoRR, 2025)