Efficient embeddings of treelike graphs into hypercubes. - Volker Heun (Shaker, 1996)

A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. - Volker Heun; Ernst W. Mayr (Euro-Par, Vol. I, 1996)

Effiziente Einbettungen baumartiger Graphen in den Hyperwürfel. - Volker Heun (Ausgezeichnete Informatikdissertationen, 1996)

Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. - Volker Heun; Ernst W. Mayr (IRREGULAR, 1996)

Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. - Volker Heun; Ernst W. Mayr (STACS, 1996)

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. - Volker Heun; Ernst W. Mayr (J. Algorithms, 1996)

Proving the PCP-Theorem. - Volker Heun; Wolfgang Merkle; Ulrich Weigand (Lectures on Proof Verification and Approximation Algorithms, 1997)

Grundlegende Algorithmen - Einführung in den Entwurf und die Analyse effizienter Algorithmen. - Volker Heun (Vieweg, 2000)

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. - Volker Heun; Ernst W. Mayr (J. Parallel Distributed Comput., 2001)

Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. - Volker Heun; Ernst W. Mayr (J. Algorithms, 2002)

Efficient Dynamic Embeddings of Binary Trees into Hypercubes. - Volker Heun; Ernst W. Mayr (J. Algorithms, 2002)

Efficient Embeddings into Hypercube-like Topologies. - Volker Heun; Ernst W. Mayr (Comput. J., 2003)

Approximate protein folding in the HP side chain model on extended cubic lattices. - Volker Heun (Discret. Appl. Math., 2003)

Fast Frequent String Mining Using Suffix Arrays. - Johannes Fischer 001; Volker Heun; Stefan Kramer 001 (ICDM, 2005)

Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. - Johannes Fischer 001; Volker Heun (CPM, 2006)

Optimal String Mining Under Frequency Constraints. - Johannes Fischer 001; Volker Heun; Stefan Kramer 001 (PKDD, 2006)

SimShiftDB: Chemical-Shift-Based Homology Modeling. - Simon W. Ginzinger; Thomas Gräupl; Volker Heun (BIRD, 2007)

A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. - Johannes Fischer 001; Volker Heun (ESCAPE, 2007)

Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. - Johannes Fischer 001; Volker Heun; Horst Martin Stühler (DCC, 2008)

Veranstaltung zum Tagungsmotto: Bioinformatik und Biotechnologie. - Volker Heun; Ralf Zimmer (GI Jahrestagung (2), 2008)

Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. - Johannes Fischer 001; Volker Heun (IWOCA, 2008)

Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees. - Volker Heun (Inf. Process. Lett., 2008)

Finding Range Minima in the Middle: Approximations and Applications. - Johannes Fischer 001; Volker Heun (Math. Comput. Sci., 2010)

Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. - Johannes Fischer 001; Volker Heun (SIAM J. Comput., 2011)

Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns. - Benjamin Albrecht; Volker Heun (SEA, 2012)

Bioinformatics Advances Biology and Medicine by Turning Big Data Troves into Knowledge. - Julien Gagneur; Caroline C. Friedel; Volker Heun; Ralf Zimmer; Burkhard Rost (50 Jahre Universitäts-Informatik in München, 2017)

Bioinformatics advances biology and medicine by turning big data troves into knowledge. - Julien Gagneur; Caroline C. Friedel; Volker Heun; Ralf Zimmer; Burkhard Rost (Inform. Spektrum, 2017)