Andreas Björklund (Former)
1 – 62 of 62
- show: 100
- |
- 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
Shortest two disjoint paths in polynomial time
(
- 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
- 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
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
-
Mark
Spotting Trees with Few Leaves
(
- Contribution to journal › Article
-
Mark
Computing the permanent modulo a prime power
(
- Contribution to journal › Article
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
- 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
-
Mark
Below All Subsets for Some Permutational Counting Problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Coloring Graphs Having Few Colorings Over Path Decompositions
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2015
-
Mark
Spotting Trees with Few Leaves
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems
2015) The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) 9134. p.231-242(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Engineering Motif Search for Large Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2014
-
Mark
Determinant Sums for Undirected Hamiltonicity
(
- Contribution to journal › Article
-
Mark
Fast Witness Extraction using a Decision Oracle
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Shortest Two Disjoint Paths in Polynomial Time
2014) Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014 8572. p.211-222(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Listing Triangles
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2013
-
Mark
The Parity of Directed Hamiltonian Cycles
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Closed Trails
(
- Contribution to journal › Letter
-
Mark
Probably Optimal Graph Motifs
2013) 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), LIPIcs 20. p.20-31(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2012
-
Mark
The Traveling Salesman Problem in Bounded Degree Graphs
(
- Contribution to journal › Article
-
Mark
Fast zeta transforms for point lattices
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Shortest cycle through specified elements
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Below All Subsets for Some Permutational Counting Problems
(
- Contribution to journal › Article
-
Mark
Counting perfect matchings as fast as Ryser
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2011
-
Mark
Covering and packing in linear space
(
- Contribution to journal › Article
- 2010
-
Mark
Determinant sums for undirected Hamiltonicity
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact covers via determinants
2010) 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010 5. p.95-106(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Trimmed moebius inversion and graphs of bounded degree
(
- Contribution to journal › Article
-
Mark
Evaluation of permanents in rings and semirings
(
- Contribution to journal › Article
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
-
Mark
Covering and packing in linear space
2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) 6198. p.727-737(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2009
-
Mark
Counting paths and packings in halves
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Set partitioning via inclusion-exclusion
(
- Contribution to journal › Article
- 2008
-
Mark
Exact algorithms for exact satisfiability and number of perfect matchings
(
- Contribution to journal › Article
-
Mark
The travelling salesman problem in bounded degree graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact graph coloring using inclusion–exclusion
2008) p.289-290(
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
Trimmed moebius inversion and graphs of bounded degree
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Computing the Tutte polynomial in vertex-exponential time
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Algorithmic Bounds for Presumably Hard Combinatorial Problems
2007)(
- Thesis › Doctoral thesis (compilation)
-
Mark
Fourier meets Möbius: fast subset convolution
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2006
-
Mark
Inclusion-exclusion algorithms for counting set partitions
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact algorithms for exact satisfiability and number of perfect matchings
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2005
-
Mark
Approximating integer quadratic programs and MAXCUT in subdense graphs
(
- Contribution to journal › Article
- 2004
-
Mark
Approximating longest directed paths and cycles
(
- Contribution to journal › Article
- 2003
-
Mark
Finding a path of superlogarithmic length
(
- Contribution to journal › Article
-
Mark
Approximating Longest Path
2003)(
- Thesis › Licentiate thesis
- 2002
-
Mark
Finding a path of superlogarithmic length
2002) Proceedings of 29th International Colloquium on Automata, Languages and Programming LNCS 2380. p.985-992(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2001
-
Mark
Fast Boolean matrix multiplication for highly clustered data
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding