The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hans-Joachim Böckenhauer: [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, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:72-86 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:59-70 [Conf]
  4. 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]
  5. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:382-394 [Conf]
  6. Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
    On the Approximation Hardness of Some Generalizations of TSP. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:184-195 [Conf]
  7. Hans-Joachim Böckenhauer
    Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:38-49 [Conf]
  8. 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]
  9. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:31, pp:- [Journal]
  10. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Approximation algorithms for the TSP with sharpened triangle inequality. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:3, pp:133-138 [Journal]
  11. Hans-Joachim Böckenhauer, Sebastian Seibert
    Improved lower bounds on the approximability of the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:3, pp:213-255 [Journal]
  12. Hans-Joachim Böckenhauer
    Communication in the two-way listen-in vertex-disjoint paths mode. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:264, n:1, pp:65-90 [Journal]
  13. 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]
  14. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:285, n:1, pp:3-24 [Journal]
  15. Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
    Efficient Algorithms for the Spoonerism Problem. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:78-92 [Conf]

  16. The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. [Citation Graph (, )][DBLP]


  17. Improved Approximations for TSP with Simple Precedence Constraints. [Citation Graph (, )][DBLP]


  18. Reoptimization of the Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]


  19. Reusing Optimal TSP Solutions for Locally Modified Input Instances. [Citation Graph (, )][DBLP]


  20. On the Advice Complexity of Online Problems. [Citation Graph (, )][DBLP]


  21. Reoptimization of the Metric Deadline TSP. [Citation Graph (, )][DBLP]


  22. On the Hardness of Reoptimization. [Citation Graph (, )][DBLP]


  23. Reoptimization of Steiner Trees. [Citation Graph (, )][DBLP]


  24. A Local Move Set for Protein Folding in Triangular Lattice Models. [Citation Graph (, )][DBLP]


Search in 0.137secs, Finished in 0.139secs
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