No. Title Author Year
1 Counting Connected Subgraphs with Maximum-Degree-Aware Sieving Björklund, Andreas et al. 2018
2 Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm Björklund, Andreas et al. 2018
3 Exploiting Sparsity for Bipartite Hamiltonicity Björklund, Andreas 2018
4 Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants Björklund, Andreas et al. 2018
5 Determinant Sums for Hamiltonicity (Invited Talk) Björklund, Andreas 2017
6 Directed Hamiltonicity and Out-Branchings via Generalized Laplacians Björklund, Andreas et al. 2017
7 Below All Subsets for Some Permutational Counting Problems Björklund, Andreas 2016
8 Coloring Graphs Having Few Colorings Over Path Decompositions Björklund, Andreas 2016
9 Probably Optimal Graph Motifs Björklund, Andreas et al. 2013
10 Exact Covers via Determinants Björklund, Andreas 2010
Current Page :
Number of result pages: 2
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI