Thore Husfeldt

2.2k total citations
42 papers, 708 citations indexed

About

Thore Husfeldt is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Thore Husfeldt has authored 42 papers receiving a total of 708 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 15 papers in Artificial Intelligence and 10 papers in Computer Networks and Communications. Recurrent topics in Thore Husfeldt's work include Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (16 papers) and Algorithms and Data Compression (11 papers). Thore Husfeldt is often cited by papers focused on Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (16 papers) and Algorithms and Data Compression (11 papers). Thore Husfeldt collaborates with scholars based in Denmark, Sweden and Finland. Thore Husfeldt's co-authors include Andreas Björklund, Mikko Koivisto, Petteri Kaski, Theis Rauhe, Stephen Alstrup, Pierre Fraigniaud, Javier Esparza, Ηλίας Κουτσουπιάς, Holger Dell and Måns Magnusson and has published in prestigious journals such as SIAM Journal on Computing, Lecture notes in computer science and Algorithmica.

In The Last Decade

Thore Husfeldt

40 papers receiving 663 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Thore Husfeldt Denmark 12 497 198 194 92 55 42 708
Andreas Björklund Sweden 12 497 1.0× 187 0.9× 125 0.6× 105 1.1× 65 1.2× 35 668
Prasad Raghavendra United States 19 689 1.4× 256 1.3× 358 1.8× 56 0.6× 66 1.2× 57 950
Stasys Jukna Germany 9 397 0.8× 111 0.6× 245 1.3× 76 0.8× 20 0.4× 42 571
Nadia Creignou France 13 576 1.2× 357 1.8× 285 1.5× 38 0.4× 57 1.0× 46 763
Amin Coja‐Oghlan Germany 16 321 0.6× 211 1.1× 200 1.0× 146 1.6× 124 2.3× 75 670
Yury Makarychev United States 15 502 1.0× 212 1.1× 222 1.1× 35 0.4× 29 0.5× 51 769
Ravi B. Boppana United States 13 744 1.5× 216 1.1× 532 2.7× 97 1.1× 46 0.8× 26 1.1k
Danny Hermelin Israel 13 548 1.1× 249 1.3× 134 0.7× 72 0.8× 10 0.2× 59 799
Samuel Fiorini Belgium 14 399 0.8× 127 0.6× 119 0.6× 56 0.6× 21 0.4× 70 630
Konstantin Makarychev United States 18 553 1.1× 427 2.2× 349 1.8× 36 0.4× 33 0.6× 68 1.2k

Countries citing papers authored by Thore Husfeldt

Since Specialization
Citations

This map shows the geographic impact of Thore Husfeldt'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 Thore Husfeldt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thore Husfeldt more than expected).

Fields of papers citing papers by Thore Husfeldt

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thore Husfeldt. 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 Thore Husfeldt. The network helps show where Thore Husfeldt may publish in the future.

Co-authorship network of co-authors of Thore Husfeldt

This figure shows the co-authorship network connecting the top 25 collaborators of Thore Husfeldt. A scholar is included among the top collaborators of Thore Husfeldt 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 Thore Husfeldt. Thore Husfeldt 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.
Dell, Holger, et al.. (2021). Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
2.
Bringmann, Karl, Thore Husfeldt, & Måns Magnusson. (2020). Multivariate Analysis of Orthogonal Range Searching and Graph Distances. Algorithmica. 82(8). 2292–2315. 7 indexed citations
3.
Dell, Holger, et al.. (2018). Extensor-coding. IT University Of Copenhagen (IT University of Copenhagen). 151–164. 2 indexed citations
4.
Dell, Holger, Thore Husfeldt, Bart M. P. Jansen, et al.. (2017). The First Parameterized Algorithms and Computational Experiments Challenge. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 63. 1–9. 10 indexed citations
5.
Dell, Holger, et al.. (2014). Exponential Time Complexity of the Permanent and the Tutte Polynomial. ACM Transactions on Algorithms. 10(4). 1–32. 16 indexed citations
6.
Björklund, Andreas & Thore Husfeldt. (2013). The Parity of Directed Hamiltonian Cycles. Lund University Publications (Lund University). 727–735. 3 indexed citations
7.
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
8.
Björklund, Andreas, et al.. (2012). Fast Zeta Transforms for Lattices with Few Irreducibles. Lund University Publications (Lund University). 1436–1444. 3 indexed citations
9.
Björklund, Andreas, et al.. (2012). Shortest Cycle Through Specified Elements. 1747–1753. 7 indexed citations
10.
Husfeldt, Thore, Petteri Kaski, & Mikko Koivisto. (2010). Narrow sieves for parameterized paths and packings. 18 indexed citations
11.
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
12.
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
13.
Björklund, Andreas & Thore Husfeldt. (2006). Inclusion-Exclusion Based Algorithms for Graph Colouring.. Electronic colloquium on computational complexity. 13. 1 indexed citations
14.
Björklund, Andreas, Thore Husfeldt, & Sanjeev Khanna. (2003). Approximating Longest Directed Path. Electronic colloquium on computational complexity. 10. 4 indexed citations
15.
Husfeldt, Thore & Theis Rauhe. (2003). New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. SIAM Journal on Computing. 32(3). 736–753. 8 indexed citations
16.
Gudmundsson, Joachim, Thore Husfeldt, & Christos Levcopoulos. (2002). Lower bounds for approximate polygon decomposition and minimum gap. Information Processing Letters. 81(3). 137–141. 1 indexed citations
17.
Alstrup, Stephen, Thore Husfeldt, & Theis Rauhe. (2001). A cell probe lower bound for dynamic nearest-neighbor searching. Symposium on Discrete Algorithms. 779–780. 2 indexed citations
18.
Husfeldt, Thore & Theis Rauhe. (1997). Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method. BRICS Report Series. 4(32). 4 indexed citations
19.
Husfeldt, Thore, et al.. (1996). Lower bounds for dynamic transitive closure, planar point location, and parantheses matching. Nordic journal of computing. 3(4). 323–336. 4 indexed citations
20.
Frandsen, Gudmund Skovbjerg, et al.. (1995). Dynamic Algorithms for the Dyck Languages. BRICS Report Series. 2(1). 10 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

Breakdown of academic impact, for papers by Andreas Björklund Breakdown of academic impact, for papers by Prasad Raghavendra Breakdown of academic impact, for papers by Stasys Jukna Breakdown of academic impact, for papers by Nadia Creignou Breakdown of academic impact, for papers by Amin Coja‐Oghlan Breakdown of academic impact, for papers by Yury Makarychev Breakdown of academic impact, for papers by Ravi B. Boppana Breakdown of academic impact, for papers by Danny Hermelin Breakdown of academic impact, for papers by Samuel Fiorini Breakdown of academic impact, for papers by Konstantin Makarychev
Rankless by CCL
2026