No. |
Title |
Author |
Year |
---|

1 |
An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs |
Björklund, Andreas |
2021 |

2 |
Counting Short Vector Pairs by Inner Product and Relations to the Permanent |
Björklund, Andreas et al. |
2021 |

3 |
Approximate Counting of k-Paths: Deterministic and in Polynomial Space |
Björklund, Andreas et al. |
2019 |

4 |
Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors |
Björklund, Andreas et al. |
2019 |

5 |
Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction |
Björklund, Andreas et al. |
2019 |

6 |
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving |
Björklund, Andreas et al. |
2018 |

7 |
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm |
Björklund, Andreas et al. |
2018 |

8 |
Exploiting Sparsity for Bipartite Hamiltonicity |
Björklund, Andreas |
2018 |

9 |
Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants |
Björklund, Andreas et al. |
2018 |

10 |
Determinant Sums for Hamiltonicity (Invited Talk) |
Björklund, Andreas |
2017 |

11 |
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians |
Björklund, Andreas et al. |
2017 |

12 |
Below All Subsets for Some Permutational Counting Problems |
Björklund, Andreas |
2016 |

13 |
Coloring Graphs Having Few Colorings Over Path Decompositions |
Björklund, Andreas |
2016 |

14 |
Probably Optimal Graph Motifs |
Björklund, Andreas et al. |
2013 |

15 |
Exact Covers via Determinants |
Björklund, Andreas |
2010 |

16 |
Trimmed Moebius Inversion and Graphs of Bounded Degree |
Björklund, Andreas et al. |
2008 |