Dirk Bongartz - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2011

Public-Key CryptographyDirk Bongartz, Walter Unger. In Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Algorithms Unplugged. pages 147-158, Springer, 2011. [doi]

2008

On k-connectivity problems with sharpened triangle inequalityHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. jda, 6(4):605-617, 2008. [doi]

2007

A weighted HP model for protein folding with diagonal contactsHans-Joachim BÃ¶ckenhauer, Dirk Bongartz. ita, 41(4):375-402, 2007. [doi]

Protein folding in the HP model on grid lattices with diagonalsHans-Joachim Böckenhauer, Dirk Bongartz. DAM, 155(2):230-256, 2007. [doi]

2004

Some Notes on the Complexity of Protein Similarity Search under mRNA Structure ConstraintsDirk Bongartz. sofsem 2004: 174-183 [doi]

Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract)Hans-Joachim Böckenhauer, Dirk Bongartz. mfcs 2004: 227-238 [doi]

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequalityHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. TCS, 326(1-3):137-153, 2004. [doi]

2003

On k-Edge-Connectivity Problems with Sharpened Triangle InequalityHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. ciac 2003: 189-200 [doi]

2002

On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle InequalityHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. fsttcs 2002: 59-70 [doi]

2001

On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring ProblemDirk Bongartz. cai, 20(4):325-357, 2001.

2000

On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring ProblemDirk Bongartz. sofsem 2000: 298-306 [doi]

Sign in or sign up to see more results.

runs on WebDSL