 | 2008 |
|---|
| 11 |       | Dirk Bongartz,
Walter Unger:
Public-Key-Kryptographie.
Taschenbuch der Algorithmen 2008: 157-169 |
| 10 | | 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): 605-617 (2008) |
| 2007 |
|---|
| 9 | | Hans-Joachim Böckenhauer,
Dirk Bongartz:
Protein folding in the HP model on grid lattices with diagonals.
Discrete Applied Mathematics 155(2): 230-256 (2007) |
| 8 | | Hans-Joachim Böckenhauer,
Dirk Bongartz:
A weighted HP model for protein folding with diagonal contacts.
ITA 41(4): 375-402 (2007) |
| 2004 |
|---|
| 7 | | Hans-Joachim Böckenhauer,
Dirk Bongartz:
Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract).
MFCS 2004: 227-238 |
| 6 | | Dirk Bongartz:
Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints.
SOFSEM 2004: 174-183 |
| 5 | | 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): 137-153 (2004) |
| 2003 |
|---|
| 4 | | 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: 189-200 |
| 2002 |
|---|
| 3 | | 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: 59-70 |
| 2001 |
|---|
| 2 |  | Dirk Bongartz:
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem.
Computers and Artificial Intelligence 20(4): (2001) |
| 2000 |
|---|
| 1 | | Dirk Bongartz:
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem.
SOFSEM 2000: 298-306 |
