Volker Heun

761 total citations
16 papers, 185 citations indexed

About

Volker Heun is a scholar working on Molecular Biology, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Volker Heun has authored 16 papers receiving a total of 185 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Molecular Biology, 6 papers in Computer Networks and Communications and 6 papers in Artificial Intelligence. Recurrent topics in Volker Heun's work include Algorithms and Data Compression (6 papers), Interconnection Networks and Systems (5 papers) and Advanced Optical Network Technologies (4 papers). Volker Heun is often cited by papers focused on Algorithms and Data Compression (6 papers), Interconnection Networks and Systems (5 papers) and Advanced Optical Network Technologies (4 papers). Volker Heun collaborates with scholars based in Germany, Austria and United Kingdom. Volker Heun's co-authors include Johannes Fischer, Ernst Mayr, Simon Ginzinger, M.P. Coles, Stefan Krämer, Caroline C. Friedel, Ralf Zimmer, Julien Gagneur and Burkhard Rost and has published in prestigious journals such as SIAM Journal on Computing, Journal of Biomolecular NMR and Journal of Parallel and Distributed Computing.

In The Last Decade

Volker Heun

16 papers receiving 176 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Volker Heun Germany 7 109 78 48 45 35 16 185
Peide Qian China 8 156 1.4× 33 0.4× 80 1.7× 29 0.6× 18 0.5× 39 258
Benjamin Sach United Kingdom 7 89 0.8× 37 0.5× 34 0.7× 52 1.2× 16 0.5× 13 168
Simone Tini Italy 10 162 1.5× 68 0.9× 45 0.9× 193 4.3× 16 0.5× 54 275
Danièle Beauquier France 8 117 1.1× 55 0.7× 18 0.4× 197 4.4× 8 0.2× 22 246
Tomasz Waleń Poland 10 182 1.7× 213 2.7× 15 0.3× 90 2.0× 52 1.5× 40 334
Gopinath Chennupati United States 9 85 0.8× 21 0.3× 92 1.9× 17 0.4× 78 2.2× 36 231
Ward Douglas Maurer United States 6 142 1.3× 21 0.3× 94 2.0× 55 1.2× 45 1.3× 34 242
Josef Schwarz Czechia 6 97 0.9× 48 0.6× 22 0.5× 47 1.0× 6 0.2× 15 193
Tsvi Kopelowitz United States 10 119 1.1× 41 0.5× 117 2.4× 105 2.3× 33 0.9× 38 229
Anna Pagh Denmark 6 117 1.1× 13 0.2× 140 2.9× 25 0.6× 16 0.5× 6 185

Countries citing papers authored by Volker Heun

Since Specialization
Citations

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

Fields of papers citing papers by Volker Heun

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Volker Heun

This figure shows the co-authorship network connecting the top 25 collaborators of Volker Heun. A scholar is included among the top collaborators of Volker Heun 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 Volker Heun. Volker Heun is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

16 of 16 papers shown
1.
Gagneur, Julien, Caroline C. Friedel, Volker Heun, Ralf Zimmer, & Burkhard Rost. (2017). Bioinformatics advances biology and medicine by turning big data troves into knowledge. Informatik-Spektrum. 40(2). 153–160. 2 indexed citations
2.
Fischer, Johannes & Volker Heun. (2011). Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM Journal on Computing. 40(2). 465–492. 92 indexed citations
3.
Ginzinger, Simon, et al.. (2009). CheckShift improved: fast chemical shift reference correction with high accuracy. Journal of Biomolecular NMR. 44(4). 207–211. 9 indexed citations
4.
Fischer, Johannes & Volker Heun. (2009). Finding Range Minima in the Middle: Approximations and Applications. Mathematics in Computer Science. 3(1). 17–30. 6 indexed citations
5.
Heun, Volker. (2008). Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees. Information Processing Letters. 108(4). 222–225. 2 indexed citations
6.
Fischer, Johannes & Volker Heun. (2008). Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing.. 239–252. 4 indexed citations
7.
Fischer, Johannes, et al.. (2008). Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. 272–281. 8 indexed citations
8.
Ginzinger, Simon, et al.. (2007). CheckShift: automatic correction of inconsistent chemical shift referencing. Journal of Biomolecular NMR. 39(3). 223–227. 19 indexed citations
9.
Fischer, Johannes, Volker Heun, & Stefan Krämer. (2006). Fast Frequent String Mining Using Suffix Arrays. 609–612. 8 indexed citations
10.
Heun, Volker. (2003). Approximate protein folding in the HP side chain model on extended cubic lattices. Discrete Applied Mathematics. 127(1). 163–177. 3 indexed citations
11.
Heun, Volker. (2003). Efficient Embeddings into Hypercube-like Topologies. The Computer Journal. 46(6). 632–644. 5 indexed citations
12.
Heun, Volker. (2003). Grundlegende Algorithmen. 2 indexed citations
13.
Heun, Volker & Ernst Mayr. (2002). Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. Journal of Algorithms. 43(1). 17–50. 4 indexed citations
14.
Heun, Volker & Ernst Mayr. (2002). Efficient Dynamic Embeddings of Binary Trees into Hypercubes. Journal of Algorithms. 43(1). 51–84. 5 indexed citations
15.
Heun, Volker & Ernst Mayr. (2001). Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. Journal of Parallel and Distributed Computing. 61(8). 1110–1125. 6 indexed citations
16.
Heun, Volker & Ernst Mayr. (1996). A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. Journal of Algorithms. 20(2). 375–399. 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 Peide Qian Breakdown of academic impact, for papers by Benjamin Sach Breakdown of academic impact, for papers by Simone Tini Breakdown of academic impact, for papers by Danièle Beauquier Breakdown of academic impact, for papers by Tomasz Waleń Breakdown of academic impact, for papers by Gopinath Chennupati Breakdown of academic impact, for papers by Ward Douglas Maurer Breakdown of academic impact, for papers by Josef Schwarz Breakdown of academic impact, for papers by Tsvi Kopelowitz Breakdown of academic impact, for papers by Anna Pagh
Rankless by CCL
2026