Andreas Björklund (Former)
1 – 20 of 62
- show: 20
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2022
-
Mark
The shortest even cycle problem is tractable
2022) 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 In Proceedings of the Annual ACM Symposium on Theory of Computing p.117-130(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2021
-
Mark
Approximate Counting of k-Paths : Simpler, Deterministic, and in Polynomial Space
(
- Contribution to journal › Article
-
Mark
The fine-grained complexity of computing the tutte polynomial of a linear matroid
2021) 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms p.2333-2345(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Contribution to journal › Article
-
Mark
A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
(
- Contribution to journal › Article
-
Mark
Approximate counting of K-paths : Deterministic and in polynomial space
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
2019) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 In Leibniz International Proceedings in Informatics (LIPIcs) 132. p.1-25(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
2019) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 In Leibniz International Proceedings in Informatics (LIPIcs) 132. p.1-26(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Shortest two disjoint paths in polynomial time
(
- Contribution to journal › Article
- 2018
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exploiting Sparsity for Bipartite Hamiltonicity
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
-
Mark
Computing the permanent modulo a prime power
(
- Contribution to journal › Article
-
Mark
Spotting Trees with Few Leaves
(
- Contribution to journal › Article
-
Mark
Counting thin subgraphs via packings faster than meet-in-the-middle time
(
- Contribution to journal › Article
-
Mark
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2016
-
Mark
Constrained Multilinear Detection and Generalized Graph Motifs
(
- Contribution to journal › Article
-
Mark
How Proofs are Prepared at Camelot
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding