According to our database1, Dirk Bongartz authored at least 11 papers between 2000 and 2011.
Legend:Book In proceedings Article PhD thesis Other
Proceedings of the Algorithms Unplugged, 2011
Proceedings of the Taschenbuch der Algorithmen, 2008
On k-connectivity problems with sharpened triangle inequality.
J. Discrete Algorithms, 2008
A weighted HP model for protein folding with diagonal contacts.
Protein folding in the HP model on grid lattices with diagonals.
Discrete Applied Mathematics, 2007
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theor. Comput. Sci., 2004
Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints.
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).
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem.
Computers and Artificial Intelligence, 2001
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem.
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