The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Bodo Manthey Bodo Siebert ( http://dblp.L3S.de/Authors/Bodo_Manthey )

URL (Homepage):  http://wwwhome.math.utwente.nl/~mantheyb/  Author page on DBLP  Author page in RDF  Community of Bodo Manthey in ASPL-2

Publication years (Num. hits)
2001-2005 (21) 2006-2007 (16) 2008-2009 (18) 2010-2012 (12)
Publication types (Num. hits)
article(37) inproceedings(29) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 21 occurrences of 17 keywords

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