| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Volker Heun Johannes Fischer , Volker Heun, Stefan Kramer : Fast Frequent String Mining Using Suffix Arrays. ICDM 2005 : 609-612 Volker Heun, Ernst W. Mayr : Efficient Embeddings into Hypercube-like Topologies. Comput. J. 46 (6): 632-644 (2003) Volker Heun: Approximate protein folding in the HP side chain model on extended cubic lattices. Discrete Applied Mathematics 127 (1): 163-177 (2003) Volker Heun, Ernst W. Mayr : Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. J. Algorithms 43 (1): 17-50 (2002) Volker Heun, Ernst W. Mayr : Efficient Dynamic Embeddings of Binary Trees into Hypercubes. J. Algorithms 43 (1): 51-84 (2002) Volker Heun, Ernst W. Mayr : Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. J. Parallel Distrib. Comput. 61 (8): 1110-1125 (2001) Volker Heun: Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices. ESA 1999 : 212-223 Volker Heun, Wolfgang Merkle , Ulrich Weigand : Proving the PCP-Theorem. Lectures on Proof Verification and Approximation Algorithms 1997 : 83-160 Volker Heun, Ernst W. Mayr : A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. Euro-Par, Vol. I 1996 : 222-233 Volker Heun, Ernst W. Mayr : Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. IRREGULAR 1996 : 287-298 Volker Heun, Ernst W. Mayr : Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. STACS 1996 : 157-168 Volker Heun, Ernst W. Mayr : A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. J. Algorithms 20 (2): 375-399 (1996) 1 [ 12 ] 2 [ 12 ] 3 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 7 ] [ 8 ] [ 9 ] [ 11 ] 4 [ 5 ] 5 [ 5 ]  ©2006 Association for Computing Machinery |
