Falk Hüffner

2.3k total citations
33 papers, 618 citations indexed

About

Falk Hüffner is a scholar working on Computational Theory and Mathematics, Molecular Biology and Computer Networks and Communications. According to data from OpenAlex, Falk Hüffner has authored 33 papers receiving a total of 618 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 12 papers in Molecular Biology and 6 papers in Computer Networks and Communications. Recurrent topics in Falk Hüffner's work include Advanced Graph Theory Research (21 papers), Complexity and Algorithms in Graphs (18 papers) and Bioinformatics and Genomic Networks (7 papers). Falk Hüffner is often cited by papers focused on Advanced Graph Theory Research (21 papers), Complexity and Algorithms in Graphs (18 papers) and Bioinformatics and Genomic Networks (7 papers). Falk Hüffner collaborates with scholars based in Germany, Israel and United States. Falk Hüffner's co-authors include Rolf Niedermeier, Jiong Guo, Jens Gramm, Sebastian Wernicke, Christian Komusiewicz, Hannes Moser, Thomas Zichner, Michael Dom, Nadja Betzler and Ron Shamir and has published in prestigious journals such as Nucleic Acids Research, Bioinformatics and European Journal of Operational Research.

In The Last Decade

Falk Hüffner

33 papers receiving 579 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Falk Hüffner Germany 17 407 174 145 113 48 33 618
Christian Komusiewicz Germany 15 334 0.8× 136 0.8× 91 0.6× 124 1.1× 76 1.6× 63 538
Danny Hermelin Israel 13 548 1.3× 249 1.4× 85 0.6× 134 1.2× 69 1.4× 59 799
Maw‐Shang Chang Taiwan 15 377 0.9× 154 0.9× 53 0.4× 50 0.4× 15 0.3× 54 524
Frances Rosamond Australia 16 698 1.7× 258 1.5× 52 0.4× 159 1.4× 14 0.3× 64 878
Stefan Kratsch Germany 15 553 1.4× 188 1.1× 48 0.3× 110 1.0× 16 0.3× 56 672
Ramesh Hariharan India 17 343 0.8× 172 1.0× 187 1.3× 447 4.0× 37 0.8× 48 728
Yngve Villanger Norway 17 604 1.5× 233 1.3× 61 0.4× 97 0.9× 9 0.2× 46 675
Jens Gramm Germany 13 298 0.7× 156 0.9× 146 1.0× 157 1.4× 8 0.2× 24 475
Martin Dietzfelbinger Germany 13 259 0.6× 302 1.7× 66 0.5× 369 3.3× 13 0.3× 56 629
Bernhard Haeupler United States 13 229 0.6× 455 2.6× 53 0.4× 194 1.7× 31 0.6× 79 659

Countries citing papers authored by Falk Hüffner

Since Specialization
Citations

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

Fields of papers citing papers by Falk Hüffner

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Falk Hüffner

This figure shows the co-authorship network connecting the top 25 collaborators of Falk Hüffner. A scholar is included among the top collaborators of Falk Hüffner 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 Falk Hüffner. Falk Hüffner 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.
Bevern, René van, Robert Bredereck, Sepp Hartung, et al.. (2017). Fixed-parameter algorithms for DAG Partitioning. Discrete Applied Mathematics. 220. 134–160. 3 indexed citations
2.
Bredereck, Robert, Jiehua Chen, Falk Hüffner, & Stefan Kratsch. (2017). Parameterized complexity of team formation in social networks. Theoretical Computer Science. 717. 26–36. 3 indexed citations
3.
Hüffner, Falk, Christian Komusiewicz, Rolf Niedermeier, & Sebastian Wernicke. (2016). Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems. Methods in molecular biology. 1526. 363–402. 2 indexed citations
4.
Bevern, René van, Jiehua Chen, Falk Hüffner, et al.. (2015). Approximability and parameterized complexity of multicover by c-intervals. Information Processing Letters. 115(10). 744–749. 1 indexed citations
5.
Hüffner, Falk, et al.. (2015). A graph modification approach for finding core–periphery structures in protein interaction networks. Algorithms for Molecular Biology. 10(1). 16–16. 16 indexed citations
6.
Hüffner, Falk, et al.. (2014). Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 11(3). 455–467. 10 indexed citations
7.
Dorn, Britta, et al.. (2011). Exploiting bounded signal flow for graph orientation based on cause–effect pairs. Algorithms for Molecular Biology. 6(1). 21–21. 6 indexed citations
8.
Hüffner, Falk, Christian Komusiewicz, Hannes Moser, & Rolf Niedermeier. (2009). Isolation concepts for clique enumeration: Comparison and computational experiments. Theoretical Computer Science. 410(52). 5384–5397. 6 indexed citations
9.
Dom, Michael, et al.. (2009). Fixed-parameter tractability results for feedback set problems in tournaments. Journal of Discrete Algorithms. 8(1). 76–86. 30 indexed citations
10.
Komusiewicz, Christian, Falk Hüffner, Hannes Moser, & Rolf Niedermeier. (2009). Isolation concepts for efficiently enumerating dense subgraphs. Theoretical Computer Science. 410(38-40). 3640–3654. 26 indexed citations
11.
Brückner, Stefan, Falk Hüffner, Richard M. Karp, Ron Shamir, & Roded Sharan. (2009). Torque: topology-free querying of protein interaction networks. Nucleic Acids Research. 37(Web Server). W106–W108. 28 indexed citations
12.
Hüffner, Falk, et al.. (2009). Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3). 237–252. 1 indexed citations
13.
Hüffner, Falk, Rolf Niedermeier, & Sebastian Wernicke. (2008). Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems. Methods in molecular biology. 453. 395–421. 3 indexed citations
14.
Gramm, Jens, Jiong Guo, Falk Hüffner, & Rolf Niedermeier. (2008). Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics. 13. 37 indexed citations
15.
Guo, Jiong, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, & Johannes Uhlmann. (2007). Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European Journal of Operational Research. 186(2). 542–553. 19 indexed citations
16.
Guo, Jiong, Jens Gramm, Falk Hüffner, Rolf Niedermeier, & Sebastian Wernicke. (2006). Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences. 72(8). 1386–1396. 76 indexed citations
17.
Gramm, Jens, Jiong Guo, Falk Hüffner, & Rolf Niedermeier. (2005). Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. Theory of Computing Systems. 38(4). 373–392. 51 indexed citations
18.
Dom, Michael, Jiong Guo, Falk Hüffner, & Rolf Niedermeier. (2005). Error Compensation in Leaf Power Problems. Algorithmica. 44(4). 363–381. 17 indexed citations
19.
Gramm, Jens, Jiong Guo, Falk Hüffner, & Rolf Niedermeier. (2004). Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. Algorithmica. 39(4). 321–347. 43 indexed citations
20.
Gramm, Jens, Falk Hüffner, & Rolf Niedermeier. (2002). Closest Strings, Primer Design, and Motif Search. 5 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