| 2026 | ICALP | Kronecker Scaling of Tensors with Applications to Arithmetic Circuits and Algorithms. | Andreas Bjrklund, Petteri Kaski, Tomohiro Koana, Jesper Nederlof |
| 2025 | SODA | Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture. | Andreas Bjrklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt |
| 2024 | ICALP | Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. | Andreas Bjrklund, Petteri Kaski, Jesper Nederlof |
| 2024 | STOC | The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True. | Andreas Bjrklund, Petteri Kaski |
| 2022 | STOC | The shortest even cycle problem is tractable. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski |
| 2021 | ICALP | Counting Short Vector Pairs by Inner Product and Relations to the Permanent. | Andreas Bjrklund, Petteri Kaski |
| 2021 | SODA | The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. | Andreas Bjrklund, Petteri Kaski |
| 2021 | STACS | An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs. | Andreas Bjrklund |
| 2019 | ICALP | Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors. | Andreas Bjrklund, Ryan Williams |
| 2019 | ICALP | Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. | Andreas Bjrklund, Petteri Kaski, Ryan Williams |
| 2019 | ICALP | Approximate Counting of k-Paths: Deterministic and in Polynomial Space. | Andreas Bjrklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2018 | ISAAC | Exploiting Sparsity for Bipartite Hamiltonicity. | Andreas Bjrklund |
| 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 |
| 2017 | ICALP | Directed Hamiltonicity and Out-Branchings via Generalized Laplacians. | Andreas Bjrklund, Petteri Kaski, Ioannis Koutis |
| 2016 | PODC | How Proofs are Prepared at Camelot: Extended Abstract. | Andreas Bjrklund, Petteri Kaski |
| 2015 | ALENEX | Engineering Motif Search for Large Graphs. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri |
| 2015 | ICALP | The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. | Andreas Bjrklund, Holger Dell, Thore Husfeldt |
| 2015 | ICALP | Spotting Trees with Few Leaves. | Andreas Bjrklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi |
| 2014 | ESA | Fast Witness Extraction Using a Decision Oracle. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2014 | ICALP | Shortest Two Disjoint Paths in Polynomial Time. | Andreas Bjrklund, Thore Husfeldt |
| 2014 | ICALP | Listing Triangles. | Andreas Bjrklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick |
| 2014 | SODA | Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2013 | FOCS | The Parity of Directed Hamiltonian Cycles. | Andreas Bjrklund, Thore Husfeldt |
| 2013 | STACS | Probably Optimal Graph Motifs. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2012 | SODA | Counting perfect matchings as fast as Ryser. | Andreas Bjrklund |
| 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 |
| 2010 | FOCS | Determinant Sums for Undirected Hamiltonicity. | Andreas Bjrklund |
| 2010 | ICALP | Covering and Packing in Linear Space. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2010 | STACS | Exact Covers via Determinants. | Andreas Bjrklund |
| 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 |
| 2005 | ESA | Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs. | Andreas Bjrklund |
| 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 | WADS | Fast Boolean Matrix Multiplication for Highly Clustered Data. | Andreas Bjrklund, Andrzej Lingas |