| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Bodo Manthey |
Multi-criteria TSP: Min and max combined.  |
Oper. Res. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi |
On Smoothed Analysis of Quicksort and Hoare's Find.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey |
On approximating multicriteria TSP.  |
ACM Transactions on Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Smoothed Complexity Theory  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | David Arthur, Bodo Manthey, Heiko Röglin |
Smoothed Analysis of the k-Means Method.  |
J. ACM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Privacy in Non-private Environments.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Heiko Röglin |
Smoothed Analysis: Analysis of Algorithms Beyond Worst Case.  |
it - Information Technology  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey |
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey |
Deterministic Algorithms for Multi-criteria TSP.  |
TAMC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao |
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Kai Plociennik |
Approximating Independent Set in Semi-Random Graphs.  |
CTW  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Matthijs Bomhoff, Bodo Manthey |
Bisimplicial Edges in Bipartite Graphs.  |
CTW  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Christian Engels, Bodo Manthey |
Average-case approximation ratio of the 2-opt algorithm for the TSP.  |
Oper. Res. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, L. Shankar Ram |
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Traveling salesman problem, Multi-criteria optimization |
| 1 | Jan Arpe, Bodo Manthey |
Approximability of Minimum AND-Circuits.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Circuit design, Inapproximability |
| 1 | David Arthur, Bodo Manthey, Heiko Röglin |
k-Means has Polynomial Smoothed Complexity  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi |
On Smoothed Analysis of Quicksort and Hoare's Find  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey |
Minimum-weight cycle covers and their approximability.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Heiko Röglin |
Improved smoothed analysis of the k-means method.  |
SODA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey |
On Approximating Multi-Criteria TSP.  |
STACS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi |
On Smoothed Analysis of Quicksort and Hoare's Find.  |
COCOON  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey |
Multi-Criteria TSP: Min and Max Combined.  |
WAOA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Arthur, Bodo Manthey, Heiko Röglin |
k-Means Has Polynomial Smoothed Complexity.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
clustering, k-means, smoothed analysis |
| 1 | Bodo Manthey, Heiko Röglin |
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences.  |
ISAAC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Thomas Heynen, Bodo Manthey |
Adding cardinality constraints to integer programs with applications to maximum satisfiability.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Heiko Röglin |
Improved Smoothed Analysis of the k-Means Method  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, Oliver Putz |
Approximating Multi-Criteria Max-TSP  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey |
On Approximating Restricted Cycle Covers.  |
SIAM J. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, Oliver Putz |
Approximating Multi-criteria Max-TSP.  |
ESA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Till Tantau |
Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise.  |
MFCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Till Tantau |
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey |
On Approximating Restricted Cycle Covers.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey, Rüdiger Reischuk |
Smoothed analysis of binary search trees.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey |
Approximate Pareto Curves for the Asymmetric Traveling Salesman Problem  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey |
Minimum-Weight Cycle Covers and Their Approximability.  |
WG  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Till Tantau |
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.  |
Probabilistic Methods in the Design and Analysis of Algorithms  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jan Arpe, Bodo Manthey |
Approximability of Minimum AND-Circuits.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Private Computation: k-Connected versus 1-Connected Networks.  |
J. Cryptology  |
2006 |
DBLP DOI BibTeX RDF |
Connectivity, Randomness, Secure multi-party computation, Secure function evaluation, Parity, Private computation |
| 1 | Bodo Manthey |
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey, L. Shankar Ram |
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey |
Minimum-weight Cycle Covers and Their Approximability  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, Jiri Sgall |
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality.  |
J. Discrete Algorithms  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey |
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions.  |
WG  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arpe, Bodo Manthey |
Approximability of Minimum AND-Circuits.  |
Complexity of Boolean Functions  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jan Arpe, Bodo Manthey |
Approximability of Minimum AND-Circuits.  |
SWAT  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, L. Shankar Ram |
Approximation Algorithms for Multi-criteria Traveling Salesman Problems.  |
WAOA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey |
Non-approximability of weighted multiple sequence alignment for arbitrary metrics.  |
Inf. Process. Lett.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Rüdiger Reischuk |
Smoothed Analysis of the Height of Binary Search Trees  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey, Rüdiger Reischuk |
The intractability of computing the Hamming distance.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One.  |
Algorithmica  |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Combinatorial optimization, Traveling salesman problem, Inapproximability, Cycle covers |
| 1 | Bodo Manthey |
On Approximating Restricted Cycle Covers  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey |
Approximability of cycle covers and smoothed analysis of binary search trees.  |
|
2005 |
RDF |
|
| 1 | Bodo Manthey |
On Approximating Restricted Cycle Covers.  |
WAOA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, Rüdiger Reischuk |
Smoothed Analysis of Binary Search Trees.  |
ISAAC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Bodo Manthey |
New lower and upper bounds for the competitive ratio of transmission protocols.  |
Inf. Process. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Privacy in Non-private Environments.  |
ASIACRYPT  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Privacy in Non-Private Environments  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Private Computation - k-connected versus 1-connected Networks  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Bodo Manthey |
Non-approximability of weighted multiple sequence alignment.  |
Theor. Comput. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Böhme, Bodo Manthey |
The Computational Power of Compiling C++.  |
Bulletin of the EATCS  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Budget balanced mechanisms for the multicast pricing problem with rates.  |
ACM Conference on Electronic Commerce  |
2003 |
DBLP DOI BibTeX RDF |
cost-sharing functions, multicast pricing, mechanism design |
| 1 | Bodo Manthey, Rüdiger Reischuk |
The Intractability of Computing the Hamming Distance.  |
ISAAC  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Two Approximation Algorithms for 3-Cycle Covers.  |
APPROX  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint.  |
ISAAC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert |
Private Computation - k-Connected versus 1-Connected Networks.  |
CRYPTO  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Siebert |
Computing Cycle Covers without Short Cycles.  |
ESA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Siebert |
Non-approximability of Weighted Multiple Sequence Alignment.  |
COCOON  |
2001 |
DBLP DOI BibTeX RDF |
|