# Andreas Björklund

- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**We present a fast algorithm for the subset convolution problem:given functions <i>f</i> and <i>g</i> defined on the lattice of subsets of an<i>n</i>-element set <i>n</i>, compute their subset… Expand

Given a set $N$ with $n$ elements and a family $\mathcal{F}$ of subsets, we show how to partition $N$ into $k$ such subsets in $2^n n^{O(1)}$ time. We also consider variations of this problem where… Expand

IEEE 51st Annual Symposium on Foundations of…

We present a Monte Carlo algorithm for Hamilton city detection in an $n$-vertex undirected graph running in $O^*(1.657^{n})$ time. To the best of our knowledge, this is the first super polynomial… Expand

We present a Monte Carlo algorithm for Hamiltonicity detection in an $n$-vertex undirected graph running in $O(1.657^{n})$ time. To the best of our knowledge, this is the first superpolynomial… Expand

Abstract
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion–exclusion characterizations.
We show… Expand

We show that there is a polynomial space algorithm that counts the number of perfect matchings in an n-vertex graph in O*(2n/2) ⊂ O(1.415n) time. (O*(f(n)) suppresses functions polylogarithmic in… Expand

We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem. Our algorithms… Expand

47th Annual IEEE Symposium on Foundations of…

Given a set U with n elements and a family of subsets S sube 2 <sup>U</sup> we show how to count the number of k-partitions S<sub>1 </sub> cup ... cup S<sub>k</sub> = U into subsets S<sub>i</sub>… Expand

We give a randomized algorithm that finds a shortest simple cycle through a given set of k vertices or edges in an n-vertex undirected graph in time 2knO(1).

We study ways to expedite Yates’s algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius inversion that proceeds… Expand