The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bodo Manthey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Markus Bläser, Bodo Manthey
    Two Approximation Algorithms for 3-Cycle Covers. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:40-50 [Conf]
  2. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Privacy in Non-private Environments. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2004, pp:137-151 [Conf]
  3. Markus Bläser, Bodo Manthey
    Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:187-198 [Conf]
  4. Bodo Manthey, Rüdiger Reischuk
    The Intractability of Computing the Hamming Distance. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:88-97 [Conf]
  5. Bodo Manthey, Rüdiger Reischuk
    Smoothed Analysis of Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:483-492 [Conf]
  6. Markus Bläser, Bodo Manthey
    Budget balanced mechanisms for the multicast pricing problem with rates. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:194-195 [Conf]
  7. Jan Arpe, Bodo Manthey
    Approximability of Minimum AND-Circuits. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:292-303 [Conf]
  8. Bodo Manthey
    On Approximating Restricted Cycle Covers. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:282-295 [Conf]
  9. Bodo Manthey, L. Shankar Ram
    Approximation Algorithms for Multi-criteria Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:302-315 [Conf]
  10. Bodo Manthey
    Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:336-347 [Conf]
  11. Markus Bläser, Bodo Manthey
    Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:2, pp:121-139 [Journal]
  12. Martin Böhme, Bodo Manthey
    The Computational Power of Compiling C++. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:81, n:, pp:264-270 [Journal]
  13. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Private Computation - k-connected versus 1-connected Networks [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:009, pp:- [Journal]
  14. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Privacy in Non-Private Environments [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:071, pp:- [Journal]
  15. Bodo Manthey, Rüdiger Reischuk
    Smoothed Analysis of the Height of Binary Search Trees [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:063, pp:- [Journal]
  16. Maciej Liskiewicz, Bodo Manthey
    New lower and upper bounds for the competitive ratio of transmission protocols. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:6, pp:297-301 [Journal]
  17. Bodo Manthey
    Non-approximability of weighted multiple sequence alignment for arbitrary metrics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:3, pp:389-395 [Journal]
  18. Markus Bläser, Bodo Manthey, Jiri Sgall
    An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:623-632 [Journal]
  19. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Private Computation: k-Connected versus 1-Connected Networks. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:3, pp:341-357 [Journal]
  20. Bodo Manthey
    Non-approximability of weighted multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:179-192 [Journal]
  21. Bodo Manthey, Rüdiger Reischuk
    The intractability of computing the Hamming distance. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:331-346 [Journal]
  22. Bodo Manthey
    Minimum-weight Cycle Covers and Their Approximability [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  23. Bodo Manthey
    Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  24. Bodo Manthey, L. Shankar Ram
    Approximation Algorithms for Multi-Criteria Traveling Salesman Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  25. Bodo Manthey
    On Approximating Restricted Cycle Covers [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  26. Bodo Manthey, Rüdiger Reischuk
    Smoothed analysis of binary search trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:3, pp:292-315 [Journal]

  27. On Smoothed Analysis of Quicksort and Hoare's Find. [Citation Graph (, )][DBLP]


  28. Approximability of Minimum AND-Circuits. [Citation Graph (, )][DBLP]


  29. Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. [Citation Graph (, )][DBLP]


  30. Approximating Multi-criteria Max-TSP. [Citation Graph (, )][DBLP]


  31. k-Means Has Polynomial Smoothed Complexity. [Citation Graph (, )][DBLP]


  32. Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. [Citation Graph (, )][DBLP]


  33. Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. [Citation Graph (, )][DBLP]


  34. Improved smoothed analysis of the k-means method. [Citation Graph (, )][DBLP]


  35. On Approximating Multi-Criteria TSP. [Citation Graph (, )][DBLP]


  36. Multi-Criteria TSP: Min and Max Combined. [Citation Graph (, )][DBLP]


  37. Minimum-Weight Cycle Covers and Their Approximability. [Citation Graph (, )][DBLP]


  38. Approximability of Minimum AND-Circuits. [Citation Graph (, )][DBLP]


  39. Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. [Citation Graph (, )][DBLP]


  40. Approximate Pareto Curves for the Asymmetric Traveling Salesman Problem [Citation Graph (, )][DBLP]


  41. Approximating Multi-Criteria Max-TSP [Citation Graph (, )][DBLP]


  42. Improved Smoothed Analysis of the k-Means Method [Citation Graph (, )][DBLP]


  43. k-Means has Polynomial Smoothed Complexity [Citation Graph (, )][DBLP]


  44. On Smoothed Analysis of Quicksort and Hoare's Find [Citation Graph (, )][DBLP]


  45. Minimum-weight cycle covers and their approximability. [Citation Graph (, )][DBLP]


  46. On Approximating Restricted Cycle Covers. [Citation Graph (, )][DBLP]


  47. Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. [Citation Graph (, )][DBLP]


  48. Approximability of Minimum AND-Circuits. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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