Dirk Bongartz

Publication Activity (10 Years)

Years Active: 2000-2008
Publications (10 Years): 0

Publications

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6 (4) (2008)
Hans-Joachim Böckenhauer, Dirk Bongartz
A weighted HP model for protein folding with diagonal contacts. RAIRO Theor. Informatics Appl. 41 (4) (2007)
Hans-Joachim Böckenhauer, Dirk Bongartz
Protein folding in the HP model on grid lattices with diagonals. Discret. Appl. Math. 155 (2) (2007)
Dirk Bongartz
Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints. SOFSEM (2004)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326 (1-3) (2004)
Hans-Joachim Böckenhauer, Dirk Bongartz
Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract). MFCS (2004)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC (2003)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS (2002)
Dirk Bongartz
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem. Comput. Artif. Intell. 20 (4) (2001)
Dirk Bongartz
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem. SOFSEM (2000)