Andreas Björklund

2.1k total citations
35 papers, 668 citations indexed

About

Andreas Björklund is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Statistics and Probability. According to data from OpenAlex, Andreas Björklund has authored 35 papers receiving a total of 668 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 13 papers in Discrete Mathematics and Combinatorics and 11 papers in Statistics and Probability. Recurrent topics in Andreas Björklund's work include Advanced Graph Theory Research (22 papers), Complexity and Algorithms in Graphs (17 papers) and Markov Chains and Monte Carlo Methods (10 papers). Andreas Björklund is often cited by papers focused on Advanced Graph Theory Research (22 papers), Complexity and Algorithms in Graphs (17 papers) and Markov Chains and Monte Carlo Methods (10 papers). Andreas Björklund collaborates with scholars based in Sweden, Finland and Denmark. Andreas Björklund's co-authors include Thore Husfeldt, Mikko Koivisto, Petteri Kaski, Łukasz Kowalik, Meirav Zehavi, Ryan Williams, Jesper Nederlof, Sanjeev Khanna, Saket Saurabh and Pekka Parviainen and has published in prestigious journals such as SIAM Journal on Computing, Algorithmica and Information Processing Letters.

In The Last Decade

Andreas Björklund

35 papers receiving 632 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Andreas Björklund Sweden 12 497 187 125 105 65 35 668
Thore Husfeldt Denmark 12 497 1.0× 198 1.1× 194 1.6× 92 0.9× 55 0.8× 42 708
Prasad Raghavendra United States 19 689 1.4× 256 1.4× 358 2.9× 56 0.5× 66 1.0× 57 950
Stasys Jukna Germany 9 397 0.8× 111 0.6× 245 2.0× 76 0.7× 20 0.3× 42 571
Samuel Fiorini Belgium 14 399 0.8× 127 0.7× 119 1.0× 56 0.5× 21 0.3× 70 630
Nadia Creignou France 13 576 1.2× 357 1.9× 285 2.3× 38 0.4× 57 0.9× 46 763
Magnus Wahlström United Kingdom 14 384 0.8× 135 0.7× 96 0.8× 62 0.6× 14 0.2× 49 510
Alexander V. Karzanov Russia 12 266 0.5× 103 0.6× 46 0.4× 75 0.7× 39 0.6× 37 409
J. Flum Germany 5 572 1.2× 197 1.1× 227 1.8× 59 0.6× 11 0.2× 10 714
Nabil Kahalé United States 11 224 0.5× 208 1.1× 133 1.1× 104 1.0× 41 0.6× 30 533
Bruce A. Reed Canada 15 719 1.4× 199 1.1× 102 0.8× 200 1.9× 39 0.6× 30 854

Countries citing papers authored by Andreas Björklund

Since Specialization
Citations

This map shows the geographic impact of Andreas Björklund's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andreas Björklund with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andreas Björklund more than expected).

Fields of papers citing papers by Andreas Björklund

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andreas Björklund. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andreas Björklund. The network helps show where Andreas Björklund may publish in the future.

Co-authorship network of co-authors of Andreas Björklund

This figure shows the co-authorship network connecting the top 25 collaborators of Andreas Björklund. A scholar is included among the top collaborators of Andreas Björklund based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andreas Björklund. Andreas Björklund is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lokshtanov, Daniel, Andreas Björklund, Saket Saurabh, & Meirav Zehavi. (2021). Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space. ACM Transactions on Algorithms. 17(3). 1–44. 2 indexed citations
2.
Björklund, Andreas, Petteri Kaski, & Ryan Williams. (2019). Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 132. 1–26. 4 indexed citations
3.
Björklund, Andreas, Petteri Kaski, & Łukasz Kowalik. (2017). Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. ACM Transactions on Algorithms. 13(4). 1–26. 3 indexed citations
4.
Björklund, Andreas. (2016). Below All Subsets for Some Permutational Counting Problems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 53. 1–17. 4 indexed citations
5.
Björklund, Andreas & Petteri Kaski. (2016). How Proofs are Prepared at Camelot. Lund University Publications (Lund University). 391–400. 5 indexed citations
6.
Björklund, Andreas, Thore Husfeldt, Petteri Kaski, et al.. (2015). Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Transactions on Algorithms. 12(1). 1–19. 7 indexed citations
7.
Björklund, Andreas & Thore Husfeldt. (2013). The Parity of Directed Hamiltonian Cycles. Lund University Publications (Lund University). 727–735. 3 indexed citations
8.
Björklund, Andreas. (2012). Counting perfect matchings as fast as Ryser. Symposium on Discrete Algorithms. 914–921. 14 indexed citations
9.
Björklund, Andreas, et al.. (2012). Shortest cycle through specified elements. Symposium on Discrete Algorithms. 1747–1753. 8 indexed citations
10.
Björklund, Andreas, Thore Husfeldt, Petteri Kaski, & Mikko Koivisto. (2012). The traveling salesman problem in bounded degree graphs. ACM Transactions on Algorithms. 8(2). 1–13. 25 indexed citations
11.
Björklund, Andreas, et al.. (2012). Fast Zeta Transforms for Lattices with Few Irreducibles. Lund University Publications (Lund University). 1436–1444. 3 indexed citations
12.
Björklund, Andreas, et al.. (2012). Shortest Cycle Through Specified Elements. 1747–1753. 7 indexed citations
13.
Björklund, Andreas, Thore Husfeldt, Petteri Kaski, & Mikko Koivisto. (2010). Evaluation of permanents in rings and semirings. Information Processing Letters. 110(20). 867–870. 7 indexed citations
14.
Björklund, Andreas. (2010). Determinant Sums for Undirected Hamiltonicity. Lund University Publications (Lund University). 173–182. 51 indexed citations
15.
Björklund, Andreas, Thore Husfeldt, Petteri Kaski, & Mikko Koivisto. (2009). Trimmed Moebius Inversion and Graphs of Bounded Degree. Theory of Computing Systems. 47(3). 637–654. 21 indexed citations
16.
Björklund, Andreas, Thore Husfeldt, & Mikko Koivisto. (2009). Set Partitioning via Inclusion-Exclusion. SIAM Journal on Computing. 39(2). 546–563. 166 indexed citations
17.
Björklund, Andreas, Thore Husfeldt, Petteri Kaski, & Mikko Koivisto. (2008). Computing the Tutte Polynomial in Vertex-Exponential Time. Lund University Publications (Lund University). 327. 677–686. 21 indexed citations
18.
Björklund, Andreas & Thore Husfeldt. (2007). Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. Algorithmica. 52(2). 226–249. 37 indexed citations
19.
Björklund, Andreas & Thore Husfeldt. (2006). Inclusion-Exclusion Based Algorithms for Graph Colouring.. Electronic colloquium on computational complexity. 13. 1 indexed citations
20.
Björklund, Andreas, Thore Husfeldt, & Sanjeev Khanna. (2003). Approximating Longest Directed Path. Electronic colloquium on computational complexity. 10. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026