The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dirk Bongartz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:189-200 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:59-70 [Conf]
  3. Hans-Joachim Böckenhauer, Dirk Bongartz
    Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:227-238 [Conf]
  4. Dirk Bongartz
    On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:298-306 [Conf]
  5. Dirk Bongartz
    Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2004, pp:174-183 [Conf]
  6. Dirk Bongartz
    On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2001, v:20, n:4, pp:- [Journal]
  7. Hans-Joachim Böckenhauer, Dirk Bongartz
    Protein folding in the HP model on grid lattices with diagonals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:230-256 [Journal]
  8. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:137-153 [Journal]

Search in 0.000secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002