Dirk Bongartz

According to our database, Dirk Bongartz authored at least 12 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Wir unterrichten Schülerinnen und Schüler.

Dirk Bongartz

Proceedings of the Wirksamer Informatikunterricht., 2024

2011

Public-Key Cryptography.

Dirk Bongartz, Walter Unger

Proceedings of the Algorithms Unplugged, 2011

2008

Public-Key-Kryptographie.

Dirk Bongartz, Walter Unger

Proceedings of the Taschenbuch der Algorithmen, 2008

On k-connectivity problems with sharpened triangle inequality.

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger

J. Discrete Algorithms, 2008

2007

A weighted HP model for protein folding with diagonal contacts.

Hans-Joachim Böckenhauer, Dirk Bongartz

RAIRO Theor. Informatics Appl., 2007

Protein folding in the HP model on grid lattices with diagonals.

Hans-Joachim Böckenhauer, Dirk Bongartz

Discret. Appl. Math., 2007

2004

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger

Theor. Comput. Sci., 2004

Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints.

Dirk Bongartz

Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract).

Hans-Joachim Böckenhauer, Dirk Bongartz

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2001

On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem.

Dirk Bongartz

Comput. Artif. Intell., 2001

2000

On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem.

Dirk Bongartz

Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000