| 2009 |
|---|
| 22 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Counting Paths and Packings in Halves
CoRR abs/0904.3093: (2009) |
| 21 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
On evaluation of permanents
CoRR abs/0904.3251: (2009) |
| 2008 |
|---|
| 20 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Computing the Tutte Polynomial in Vertex-Exponential Time.
FOCS 2008: 677-686 |
| 19 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
The Travelling Salesman Problem in Bounded Degree Graphs.
ICALP (1) 2008: 198-209 |
| 18 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree.
STACS 2008: 85-96 |
| 17 | EE | Andreas Björklund,
Thore Husfeldt:
Exact Graph Coloring Using Inclusion-Exclusion.
Encyclopedia of Algorithms 2008 |
| 16 | EE | Andreas Björklund,
Thore Husfeldt:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.
Algorithmica 52(2): 226-249 (2008) |
| 15 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree
CoRR abs/0802.2834: (2008) |
| 14 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
The fast intersection transform with applications to counting paths
CoRR abs/0809.2489: (2008) |
| 2007 |
|---|
| 13 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Fourier meets möbius: fast subset convolution.
STOC 2007: 67-74 |
| 12 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Computing the Tutte polynomial in vertex-exponential time
CoRR abs/0711.2585: (2007) |
| 2006 |
|---|
| 11 | EE | Andreas Björklund,
Thore Husfeldt:
Inclusion--Exclusion Algorithms for Counting Set Partitions.
FOCS 2006: 575-582 |
| 10 | EE | Andreas Björklund,
Thore Husfeldt:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.
ICALP (1) 2006: 548-559 |
| 9 | EE | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Fourier meets Möbius: fast subset convolution
CoRR abs/cs/0611101: (2006) |
| 8 | EE | Andreas Björklund,
Thore Husfeldt:
Inclusion-Exclusion Based Algorithms for Graph Colouring.
Electronic Colloquium on Computational Complexity (ECCC) 13(044): (2006) |
| 2005 |
|---|
| 7 | EE | Andreas Björklund:
Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs.
ESA 2005: 839-849 |
| 2004 |
|---|
| 6 | EE | Andreas Björklund,
Thore Husfeldt,
Sanjeev Khanna:
Approximating Longest Directed Paths and Cycles.
ICALP 2004: 222-233 |
| 2003 |
|---|
| 5 | EE | Andreas Björklund,
Thore Husfeldt,
Sanjeev Khanna:
Approximating Longest Directed Path
Electronic Colloquium on Computational Complexity (ECCC) 10(032): (2003) |
| 4 | EE | Andreas Björklund,
Thore Husfeldt:
Finding a Path of Superlogarithmic Length.
SIAM J. Comput. 32(6): 1395-1402 (2003) |
| 2002 |
|---|
| 3 | EE | Andreas Björklund,
Thore Husfeldt:
Finding a Path of Superlogarithmic Length.
ICALP 2002: 985-992 |
| 2001 |
|---|
| 2 | EE | Andreas Björklund,
Andrzej Lingas:
Fast Boolean Matrix Multiplication for Highly Clustered Data.
WADS 2001: 258-263 |
| 2000 |
|---|
| 1 | EE | Andreas Björklund:
Optimal Adaptive Fault Diagnosis of Hypercubes.
SWAT 2000: 527-534 |
