- Smoothed Analysis of the k-Means Method David Arthur
- THE COMPUTATIONAL POWER OF COMPILING C++ Martin Bhme
- Eine untere Schranke fur die Approximierbarkeit des gewichteten
- Approximation Algorithms for Multi-criteria Traveling Salesman Problems
- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
- Minimum-weight Cycle Covers and Their Approximability
- On Approximating Restricted Cycle Covers Bodo Manthey
- Towards Explaining the Speed of k-Means Bodo Manthey
- Deterministic Algorithms for Multi-Criteria TSP Bodo Manthey
- Smoothed Analysis of Left-To-Right Maxima with Applications
- Privacy in Non-Private Environments Markus Blaser1
- Minimum-weight Cycle Covers and Their Approximability
- Average-Case Approximation Ratio of the 2-Opt Algorithm for the TSP
- On Approximating Restricted Cycle Covers Bodo Manthey
- Non-Approximability of Weighted Multiple Sequence Alignment for Arbitrary Metrics
- Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
- New Lower and Upper Bounds for the Competitive Ratio of Transmission Protocols
- Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
- Multi-Criteria TSP: Min and Max Combined Bodo Manthey
- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
- k-Means has Polynomial Smoothed Complexity David Arthur
- On Smoothed Analysis of Quicksort and Hoare's Find
- Improved Smoothed Analysis of the k-Means Method Bodo Manthey
- Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
- Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
- Two Approximation Algorithms for 3-Cycle Covers
- Private Computation k-connected versus 1-connected Networks
- Computing Cycle Covers without Short Cycles Markus Blaser and Bodo Siebert
- Non-Approximability of Weighted Multiple Sequence Alignment
- Approximability of Cycle Covers and Smoothed Analysis of Binary Search Trees
- SIIM-TR-A-02-08 SIIM Technical Report
- Die Komplexitat des Multiple Sequence Alignment Problems bei nichtmetrischen
- Private Computation: k-connected versus 1-connected Networks
- Smoothed Analysis of Binary Search Trees Bodo Manthey and Rudiger Reischuk
- Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
- The Intractability of Computing the Hamming Bodo Manthey and Rudiger Reischuk
- Multi-Criteria TSP: Min and Max Combined Bodo Manthey
- Approximability of Minimum AND-Circuits and Bodo Manthey2,
- On Smoothed Analysis of Quicksort and Hoare's Find Mahmoud Fouz1
- Symposium on Theoretical Aspects of Computer Science years (city), pp. numbers www.stacs-conf.org
- SIIM-TR-B-05-04 SIIM Technical Report
- An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
- The Intractability of Computing the Hamming Distance
- Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
- Approximating Multi-Criteria Max-TSP Markus Blaser, Bodo Manthey, and Oliver Putz
- FOCUS MUL 21, Heft 3/4, Seiten 195198 (2004) plus Literaturverzeichnis Institut fur Theoretische Informatik
- Privacy in Non-Private Environments Markus Blaser1
- Approximability of Cycle Covers and Smoothed Analysis of Binary Search Trees
- Adding Cardinality Constraints to Integer Programs with Applications to Maximum
- Smoothed Analysis of Binary Search Trees Bodo Manthey a,,1
- Bisimplicial Edges in Bipartite Graphs Matthijs Bomhoff, Bodo Manthey
- Non-approximability of Weighted Multiple Sequence Alignment
- Approximability of Minimum AND-Circuits Bodo Manthey,2
- Deterministic Algorithms for Multi-Criteria TSP Bodo Manthey
- Multi-Criteria TSP: Min and Max Combined Bodo Manthey
- Smoothed Analysis: Analysis of Algorithms Beyond Worst Case
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
