|
Search the dblp DataBase
Andreas Björklund:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Andreas Björklund
Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:839-849 [Conf]
- Andreas Björklund, Thore Husfeldt
Inclusion--Exclusion Algorithms for Counting Set Partitions. [Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:575-582 [Conf]
- Andreas Björklund, Thore Husfeldt
Finding a Path of Superlogarithmic Length. [Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:985-992 [Conf]
- Andreas Björklund, Thore Husfeldt
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:548-559 [Conf]
- Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
Approximating Longest Directed Paths and Cycles. [Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:222-233 [Conf]
- Andreas Björklund
Optimal Adaptive Fault Diagnosis of Hypercubes. [Citation Graph (0, 0)][DBLP] SWAT, 2000, pp:527-534 [Conf]
- Andreas Björklund, Andrzej Lingas
Fast Boolean Matrix Multiplication for Highly Clustered Data. [Citation Graph (0, 0)][DBLP] WADS, 2001, pp:258-263 [Conf]
- Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
Approximating Longest Directed Path [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:032, pp:- [Journal]
- Andreas Björklund, Thore Husfeldt
Finding a Path of Superlogarithmic Length. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:6, pp:1395-1402 [Journal]
- Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fourier meets möbius: fast subset convolution. [Citation Graph (0, 0)][DBLP] STOC, 2007, pp:67-74 [Conf]
- Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fourier meets Möbius: fast subset convolution [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Counting Paths and Packings in Halves. [Citation Graph (, )][DBLP]
Computing the Tutte Polynomial in Vertex-Exponential Time. [Citation Graph (, )][DBLP]
The Travelling Salesman Problem in Bounded Degree Graphs. [Citation Graph (, )][DBLP]
Covering and Packing in Linear Space. [Citation Graph (, )][DBLP]
Trimmed Moebius Inversion and Graphs of Bounded Degree. [Citation Graph (, )][DBLP]
Exact Covers via Determinants. [Citation Graph (, )][DBLP]
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. [Citation Graph (, )][DBLP]
Computing the Tutte polynomial in vertex-exponential time [Citation Graph (, )][DBLP]
Trimmed Moebius Inversion and Graphs of Bounded Degree [Citation Graph (, )][DBLP]
The fast intersection transform with applications to counting paths [Citation Graph (, )][DBLP]
Counting Paths and Packings in Halves [Citation Graph (, )][DBLP]
On evaluation of permanents [Citation Graph (, )][DBLP]
Exact Covers via Determinants [Citation Graph (, )][DBLP]
Narrow sieves for parameterized paths and packings [Citation Graph (, )][DBLP]
Determinant Sums for Undirected Hamiltonicity [Citation Graph (, )][DBLP]
Inclusion-Exclusion Based Algorithms for Graph Colouring. [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs
|