The SCEAS System
| |||||||

## Search the dblp DataBase
Bodo Manthey:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Markus Bläser, Bodo Manthey
**Two Approximation Algorithms for 3-Cycle Covers.**[Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:40-50 [Conf] - 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] - 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] - Bodo Manthey, Rüdiger Reischuk
**The Intractability of Computing the Hamming Distance.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:88-97 [Conf] - Bodo Manthey, Rüdiger Reischuk
**Smoothed Analysis of Binary Search Trees.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:483-492 [Conf] - 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] - Jan Arpe, Bodo Manthey
**Approximability of Minimum AND-Circuits.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:292-303 [Conf] - Bodo Manthey
**On Approximating Restricted Cycle Covers.**[Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:282-295 [Conf] - Bodo Manthey, L. Shankar Ram
**Approximation Algorithms for Multi-criteria Traveling Salesman Problems.**[Citation Graph (0, 0)][DBLP] WAOA, 2006, pp:302-315 [Conf] - Bodo Manthey
**Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions.**[Citation Graph (0, 0)][DBLP] WG, 2006, pp:336-347 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Bodo Manthey
**Minimum-weight Cycle Covers and Their Approximability**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Bodo Manthey
**Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - 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] - Bodo Manthey
**On Approximating Restricted Cycle Covers**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - 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] **On Smoothed Analysis of Quicksort and Hoare's Find.**[Citation Graph (, )][DBLP]**Approximability of Minimum AND-Circuits.**[Citation Graph (, )][DBLP]**Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.**[Citation Graph (, )][DBLP]**Approximating Multi-criteria Max-TSP.**[Citation Graph (, )][DBLP]**k-Means Has Polynomial Smoothed Complexity.**[Citation Graph (, )][DBLP]**Worst-Case and Smoothed Analysis of**[Citation Graph (, )][DBLP]*k*-Means Clustering with Bregman Divergences.**Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise.**[Citation Graph (, )][DBLP]**Improved smoothed analysis of the**[Citation Graph (, )][DBLP]*k*-means method.**On Approximating Multi-Criteria TSP.**[Citation Graph (, )][DBLP]**Multi-Criteria TSP: Min and Max Combined.**[Citation Graph (, )][DBLP]**Minimum-Weight Cycle Covers and Their Approximability.**[Citation Graph (, )][DBLP]**Approximability of Minimum AND-Circuits.**[Citation Graph (, )][DBLP]**Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.**[Citation Graph (, )][DBLP]**Approximate Pareto Curves for the Asymmetric Traveling Salesman Problem**[Citation Graph (, )][DBLP]**Approximating Multi-Criteria Max-TSP**[Citation Graph (, )][DBLP]**Improved Smoothed Analysis of the k-Means Method**[Citation Graph (, )][DBLP]**k-Means has Polynomial Smoothed Complexity**[Citation Graph (, )][DBLP]**On Smoothed Analysis of Quicksort and Hoare's Find**[Citation Graph (, )][DBLP]**Minimum-weight cycle covers and their approximability.**[Citation Graph (, )][DBLP]**On Approximating Restricted Cycle Covers.**[Citation Graph (, )][DBLP]**Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.**[Citation Graph (, )][DBLP]**Approximability of Minimum AND-Circuits.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |