default search action
Andreas Björklund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c46]Andreas Björklund, Petteri Kaski, Jesper Nederlof:
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. ICALP 2024: 26:1-26:20 - [c45]Andreas Björklund
, Petteri Kaski
The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True. STOC 2024: 859-870 - [i31]Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt:
Chromatic number in 1.9999n time? Fast deterministic set partitioning under the asymptotic rank conjecture. CoRR abs/2404.04987 (2024) - [i30]Andreas Björklund, Thore Husfeldt:
Finding longer cycles via shortest colourful cycle. CoRR abs/2408.03699 (2024) - 2023
- [i29]Andreas Björklund, Petteri Kaski, Jesper Nederlof:
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. CoRR abs/2308.01574 (2023) - [i28]Andreas Björklund, Petteri Kaski:
The Asymptotic Rank Conjecture and the Set Cover Conjecture are not Both True. CoRR abs/2310.11926 (2023) - 2022
- [c44]Andreas Björklund, Thore Husfeldt, Petteri Kaski:
The shortest even cycle problem is tractable. STOC 2022: 117-130 - 2021
- [j19]Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. ACM Trans. Algorithms 17(3): 26:1-26:44 (2021) - [c43]Andreas Björklund, Petteri Kaski:
Counting Short Vector Pairs by Inner Product and Relations to the Permanent. ICALP 2021: 29:1-29:21 - [c42]Andreas Björklund, Petteri Kaski:
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. SODA 2021: 2333-2345 - [c41]Andreas Björklund:
An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs. STACS 2021: 15:1-15:12 - [i27]Andreas Björklund, Thore Husfeldt, Petteri Kaski:
The Shortest Even Cycle Problem is Tractable. CoRR abs/2111.02992 (2021) - 2020
- [i26]Andreas Björklund, Petteri Kaski:
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. CoRR abs/2003.03595 (2020) - [i25]Andreas Björklund, Petteri Kaski:
Counting Short Vector Pairs by Inner Product and Relations to the Permanent. CoRR abs/2007.14092 (2020) - [i24]Andreas Björklund:
An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs. CoRR abs/2009.11780 (2020)
2010 – 2019
- 2019
- [j18]Andreas Björklund, Petteri Kaski, Ryan Williams:
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. Algorithmica 81(10): 4010-4028 (2019) - [j17]Andreas Björklund, Brajesh Gupt
A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer. ACM J. Exp. Algorithmics 24(1): 1.11:1-1.11:17 (2019) - [j16]Andreas Björklund, Thore Husfeldt
Shortest Two Disjoint Paths in Polynomial Time. SIAM J. Comput. 48(6): 1698-1710 (2019) - [c40]Andreas Björklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Deterministic and in Polynomial Space. ICALP 2019: 24:1-24:15 - [c39]Andreas Björklund, Ryan Williams:
Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors. ICALP 2019: 25:1-25:14 - [c38]Andreas Björklund, Petteri Kaski, Ryan Williams:
Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. ICALP 2019: 26:1-26:13 - 2018
- [c37]Andreas Björklund:
Exploiting Sparsity for Bipartite Hamiltonicity. ISAAC 2018: 3:1-3:11 - [c36]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. ISAAC 2018: 17:1-17:12 - [c35]Andreas Björklund, Thore Husfeldt:
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. ISAAC 2018: 19:1-19:13 - [i23]Andreas Björklund, Brajesh Gupt, Nicolás Quesada:
A faster hafnian formula for complex matrices and its benchmarking on the Titan supercomputer. CoRR abs/1805.12498 (2018) - [i22]Andreas Björklund, Thore Husfeldt:
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. CoRR abs/1806.07586 (2018) - 2017
- [j15]Andreas Björklund, Thore Husfeldt, Isak Lyckberg:
Computing the permanent modulo a prime power. Inf. Process. Lett. 125: 20-25 (2017) - [j14]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. 87: 119-139 (2017) - [j13]Andreas Björklund, Vikram Kamat, Lukasz Kowalik
Spotting Trees with Few Leaves. SIAM J. Discret. Math. 31(2): 687-713 (2017) - [j12]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. ACM Trans. Algorithms 13(4): 48:1-48:26 (2017) - [c34]Andreas Björklund, Petteri Kaski, Ioannis Koutis
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians. ICALP 2017: 91:1-91:14 - [c33]Andreas Björklund, Petteri Kaski, R. Ryan Williams:
Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants. IPEC 2017: 6:1-6:13 - 2016
- [j11]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Constrained Multilinear Detection and Generalized Graph Motifs. Algorithmica 74(2): 947-967 (2016) - [j10]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Trans. Algorithms 12(1): 4:1-4:19 (2016) - [c32]Andreas Björklund:
Determinant Sums for Hamiltonicity (Invited Talk). IPEC 2016: 1:1-1:1 - [c31]Andreas Björklund, Petteri Kaski:
How Proofs are Prepared at Camelot: Extended Abstract. PODC 2016: 391-400 - [c30]Andreas Björklund:
Coloring Graphs Having Few Colorings Over Path Decompositions. SWAT 2016: 13:1-13:9 - [c29]Andreas Björklund:
Below All Subsets for Some Permutational Counting Problems . SWAT 2016: 17:1-17:11 - [r2]Andreas Björklund, Thore Husfeldt:
Exact Graph Coloring Using Inclusion-Exclusion. Encyclopedia of Algorithms 2016: 694-695 - [i21]Andreas Björklund, Petteri Kaski:
How proofs are prepared at Camelot. CoRR abs/1602.01295 (2016) - [i20]Andreas Björklund, Ioannis Koutis:
Modular Sieves for Directed Hamiltonian Cycles. CoRR abs/1607.04002 (2016) - 2015
- [c28]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Engineering Motif Search for Large Graphs. ALENEX 2015: 104-118 - [c27]Andreas Björklund, Holger Dell, Thore Husfeldt:
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. ICALP (1) 2015: 231-242 - [c26]Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi
Spotting Trees with Few Leaves. ICALP (1) 2015: 243-255 - [i19]Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi:
Spotting Trees with Few Leaves. CoRR abs/1501.00563 (2015) - [i18]Andreas Björklund:
Uniquely Coloring Graphs over Path Decompositions. CoRR abs/1504.03670 (2015) - [i17]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Fast Witness Extraction Using a Decision Oracle. CoRR abs/1508.03572 (2015) - 2014
- [j9]Andreas Björklund:
Determinant Sums for Undirected Hamiltonicity. SIAM J. Comput. 43(1): 280-299 (2014) - [c25]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Fast Witness Extraction Using a Decision Oracle. ESA 2014: 149-160 - [c24]Andreas Björklund, Thore Husfeldt:
Shortest Two Disjoint Paths in Polynomial Time. ICALP (1) 2014: 211-222 - [c23]Andreas Björklund, Rasmus Pagh
Listing Triangles. ICALP (1) 2014: 223-234 - [c22]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time. SODA 2014: 594-603 - 2013
- [j8]Andreas Björklund, Petteri Kaski:
Counting closed trails. Inf. Process. Lett. 113(1-2): 1-3 (2013) - [c21]Andreas Björklund, Thore Husfeldt:
The Parity of Directed Hamiltonian Cycles. FOCS 2013: 727-735 - [c20]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Probably Optimal Graph Motifs. STACS 2013: 20-31 - [i16]Andreas Björklund, Thore Husfeldt:
The Parity of Directed Hamiltonian Cycles. CoRR abs/1301.7250 (2013) - [i15]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Counting thin subgraphs via packings faster than meet-in-the-middle time. CoRR abs/1306.4111 (2013) - 2012
- [j7]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The traveling salesman problem in bounded degree graphs. ACM Trans. Algorithms 8(2): 18:1-18:13 (2012) - [c19]Andreas Björklund:
The Path Taken for k-Path. IPEC 2012: 1 - [c18]Andreas Björklund:
Counting perfect matchings as fast as Ryser. SODA 2012: 914-921 - [c17]Andreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen:
Fast zeta transforms for lattices with few irreducibles. SODA 2012: 1436-1444 - [c16]Andreas Björklund, Thore Husfeldt, Nina Taslaman:
Shortest cycle through specified elements. SODA 2012: 1747-1753 - [i14]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Probably Optimal Graph Motifs. CoRR abs/1209.1082 (2012) - [i13]Andreas Björklund:
Below All Subsets for Permutational Counting Problems. CoRR abs/1211.0391 (2012) - 2011
- [j6]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and packing in linear space. Inf. Process. Lett. 111(21-22): 1033-1036 (2011) - [i12]Andreas Björklund:
Counting Perfect Matchings as Fast as Ryser. CoRR abs/1107.4466 (2011) - 2010
- [j5]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Evaluation of permanents in rings and semirings. Inf. Process. Lett. 110(20): 867-870 (2010) - [j4]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Trimmed Moebius Inversion and Graphs of Bounded Degree. Theory Comput. Syst. 47(3): 637-654 (2010) - [c15]Andreas Björklund:
Determinant Sums for Undirected Hamiltonicity. FOCS 2010: 173-182 - [c14]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and Packing in Linear Space. ICALP (1) 2010: 727-737 - [c13]Andreas Björklund:
Exact Covers via Determinants. STACS 2010: 95-106 - [i11]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Narrow sieves for parameterized paths and packings. CoRR abs/1007.1161 (2010) - [i10]Andreas Björklund:
Determinant Sums for Undirected Hamiltonicity. CoRR abs/1008.0541 (2010)
2000 – 2009
- 2009
- [j3]Andreas Björklund, Thore Husfeldt, Mikko Koivisto
Set Partitioning via Inclusion-Exclusion. SIAM J. Comput. 39(2): 546-563 (2009) - [c12]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Paths and Packings in Halves. ESA 2009: 578-586 - [i9]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Paths and Packings in Halves. CoRR abs/0904.3093 (2009) - [i8]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
On evaluation of permanents. CoRR abs/0904.3251 (2009) - [i7]Andreas Björklund:
Exact Covers via Determinants. CoRR abs/0910.0460 (2009) - 2008
- [j2]Andreas Björklund, Thore Husfeldt:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. Algorithmica 52(2): 226-249 (2008) - [c11]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Computing the Tutte Polynomial in Vertex-Exponential Time. FOCS 2008: 677-686 - [c10]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The Travelling Salesman Problem in Bounded Degree Graphs. ICALP (1) 2008: 198-209 - [c9]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree. STACS 2008: 85-96 - [r1]Andreas Björklund, Thore Husfeldt:
Exact Graph Coloring Using Inclusion-Exclusion. Encyclopedia of Algorithms 2008 - [i6]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree. CoRR abs/0802.2834 (2008) - [i5]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
The fast intersection transform with applications to counting paths. CoRR abs/0809.2489 (2008) - 2007
- [b1]Andreas Björklund:
Algorithmic Bounds for Presumably Hard Combinatorial Problems. Lund University, Sweden, 2007 - [c8]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Fourier meets möbius: fast subset convolution. STOC 2007: 67-74 - [i4]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Computing the Tutte polynomial in vertex-exponential time. CoRR abs/0711.2585 (2007) - 2006
- [c7]Andreas Björklund, Thore Husfeldt:
Inclusion--Exclusion Algorithms for Counting Set Partitions. FOCS 2006: 575-582 - [c6]Andreas Björklund, Thore Husfeldt:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. ICALP (1) 2006: 548-559 - [i3]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Fourier meets Möbius: fast subset convolution. CoRR abs/cs/0611101 (2006) - [i2]Andreas Björklund, Thore Husfeldt:
Inclusion-Exclusion Based Algorithms for Graph Colouring. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c5]Andreas Björklund:
Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs. ESA 2005: 839-849 - 2004
- [c4]Andreas Björklund, Thore Husfeldt, Sanjeev Khanna:
Approximating Longest Directed Paths and Cycles. ICALP 2004: 222-233 - 2003
- [j1]Andreas Björklund, Thore Husfeldt:
Finding a Path of Superlogarithmic Length. SIAM J. Comput. 32(6): 1395-1402 (2003) - [i1]Andreas Björklund, Thore Husfeldt, Sanjeev Khanna:
Approximating Longest Directed Path. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c3]Andreas Björklund, Thore Husfeldt:
Finding a Path of Superlogarithmic Length. ICALP 2002: 985-992 - 2001
- [c2]Andreas Björklund, Andrzej Lingas:
Fast Boolean Matrix Multiplication for Highly Clustered Data. WADS 2001: 258-263 - 2000
- [c1]Andreas Björklund:
Optimal Adaptive Fault Diagnosis of Hypercubes. SWAT 2000: 527-534
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-14 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: