Andreas Björklund

According to our database1, Andreas Björklund authored at least 60 papers between 2000 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Shortest Two Disjoint Paths in Polynomial Time.
SIAM J. Comput., 2019

A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer.
ACM Journal of Experimental Algorithmics, 2019

Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants.
Algorithmica, 2019

Approximate Counting of k-Paths: Deterministic and in Polynomial Space.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
A faster hafnian formula for complex matrices and its benchmarking on the Titan supercomputer.
CoRR, 2018

Counting Connected Subgraphs with Maximum-Degree-Aware Sieving.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Exploiting Sparsity for Bipartite Hamiltonicity.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time.
ACM Trans. Algorithms, 2017

Spotting Trees with Few Leaves.
SIAM J. Discrete Math., 2017

Narrow sieves for parameterized paths and packings.
J. Comput. Syst. Sci., 2017

Computing the permanent modulo a prime power.
Inf. Process. Lett., 2017

Directed Hamiltonicity and Out-Branchings via Generalized Laplacians.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Exact Graph Coloring Using Inclusion-Exclusion.
Encyclopedia of Algorithms, 2016

Fast Zeta Transforms for Lattices with Few Irreducibles.
ACM Trans. Algorithms, 2016

Modular Sieves for Directed Hamiltonian Cycles.
CoRR, 2016

How proofs are prepared at Camelot.
CoRR, 2016

Constrained Multilinear Detection and Generalized Graph Motifs.
Algorithmica, 2016

Below All Subsets for Some Permutational Counting Problems .
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Coloring Graphs Having Few Colorings Over Path Decompositions.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

How Proofs are Prepared at Camelot: Extended Abstract.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Determinant Sums for Hamiltonicity (Invited Talk).
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
Uniquely Coloring Graphs over Path Decompositions.
CoRR, 2015

The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Engineering Motif Search for Large Graphs.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Determinant Sums for Undirected Hamiltonicity.
SIAM J. Comput., 2014

Listing Triangles.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Fast Witness Extraction Using a Decision Oracle.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Counting closed trails.
Inf. Process. Lett., 2013

Probably Optimal Graph Motifs.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

The Parity of Directed Hamiltonian Cycles.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
The traveling salesman problem in bounded degree graphs.
ACM Trans. Algorithms, 2012

Below All Subsets for Permutational Counting Problems
CoRR, 2012

Shortest cycle through specified elements.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Counting perfect matchings as fast as Ryser.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

The Path Taken for k-Path.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011
Covering and packing in linear space.
Inf. Process. Lett., 2011

2010
Trimmed Moebius Inversion and Graphs of Bounded Degree.
Theory Comput. Syst., 2010

Evaluation of permanents in rings and semirings.
Inf. Process. Lett., 2010

Exact Covers via Determinants.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

2009
Set Partitioning via Inclusion-Exclusion.
SIAM J. Comput., 2009

On evaluation of permanents
CoRR, 2009

Counting Paths and Packings in Halves.
Proceedings of the Algorithms, 2009

2008
Exact Graph Coloring Using Inclusion-Exclusion.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The fast intersection transform with applications to counting paths
CoRR, 2008

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.
Algorithmica, 2008

The Travelling Salesman Problem in Bounded Degree Graphs.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Computing the Tutte Polynomial in Vertex-Exponential Time.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Algorithmic Bounds for Presumably Hard Combinatorial Problems.
PhD thesis, 2007

Fourier meets möbius: fast subset convolution.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Inclusion-Exclusion Based Algorithms for Graph Colouring.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Inclusion--Exclusion Algorithms for Counting Set Partitions.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs.
Proceedings of the Algorithms, 2005

2004
Approximating Longest Directed Paths and Cycles.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Finding a Path of Superlogarithmic Length.
SIAM J. Comput., 2003

Approximating Longest Directed Path
Electronic Colloquium on Computational Complexity (ECCC), 2003

2001
Fast Boolean Matrix Multiplication for Highly Clustered Data.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

2000
Optimal Adaptive Fault Diagnosis of Hypercubes.
Proceedings of the Algorithm Theory, 2000


  Loading...