EEMCS

Fouz, M. and Kufleitner, M. and Manthey, B. and Zeini Jahromi, N. (2012) On smoothed analysis of quicksort and Hoare's find. Algorithmica, 62 (3-4). pp. 879-905. ISSN 0178-4617 *** ISI Impact 1,239 ***

Manthey, B. (2012) Multi-criteria TSP: Min and max combined. Operations research letters, 40 (1). pp. 36-38. ISSN 0167-6377 *** ISI Impact 0,739 ***

Manthey, B. (2012) On approximating multi-criteria TSP. ACM Transactions on Algorithms, 8 (2). 17:1-17:18. ISSN 1549-6325 *** ISI Impact 0,932 ***

Arthur, D. and Manthey, B. and Röglin, H. (2011) Smoothed analysis of the k-means method. Journal of the ACM, 58 (5). 19:1-19:31. ISSN 0004-5411 *** ISI Impact 3,375 ***

Bläser, M. and Jakoby, A. and Liskiewicz, M. and Manthey, B. (2011) Privacy in non-private environments. Theory of Computing Systems, 48 (1). pp. 211-245. ISSN 1432-4350 *** ISI Impact 0,600 ***

Bläser, M. and Manthey, B. and Rao, B.V.R. (2011) Smoothed analysis of partitioning algorithms for Euclidean functionals. In: 12th International Symposium on Algorithms and Data Structures, WADS 2011, 15-17 Aug 2011, New York, NY, USA. pp. 110-121. Lecture Notes in Computer Science 6844. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-22299-3

Boros, E. and Elbassioni, K. and Fouz, M. and Gurvich, V. and Makino, K. and Manthey, B. (2011) Stochastic mean payoff games: smoothed analysis and approximation schemes. In: 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, 4-8 Jul 2011, Zurich, Switzerland. pp. 147-158. Lecture Notes in Computer Science 6755. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-22005-0

Manthey, B. (2011) Deterministic algorithms for multi-criteria TSP. In: Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011), 23-25 May 2011, Tokyo, Japan. pp. 264-275. Lecture Notes in Computer Science 6648. Springer Verlag. ISBN 978-3-642-20876-8

Manthey, B. (2011) Towards explaining the speed of k-means. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, 2011. pp. 45-54. ISSN not assigned

Manthey, B. and Röglin, H. (2011) Smoothed analysis: analysis of algorithms beyond worst case. it - Information Technology, 53 (6). pp. 280-286. ISSN 1611-2776

Bomhoff, M.J. and Manthey, B. (2010) Bisimplicial edges in bipartite graphs. In: Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010), 25-27 May 2010, Cologne, Germany. pp. 29-32. University of Cologne. ISBN not assigned

Manthey, B. (2010) Multi-criteria TSP: Min and Max combined. In: 7th International Workshop Approximation and Online Algorithms (WAOA 2009), 10-11 Sep 2009, Copenhagen, Denmark. pp. 205-216. Lecture Notes in Computer Science 5893. Springer Verlag. ISBN 978-3-642-12450-1

Manthey, B. and Plociennik, K. (2010) Approximating independent set in semi-random graphs. In: Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010), 25-27 May 2010, Cologne, Germany. pp. 119-122. University of Cologne. ISBN not assigned

Arpe, J. and Manthey, B. (2009) Approximability of Minimum AND-Circuits. Algorithmica, 53 (3). pp. 337-357. ISSN 0178-4617 *** ISI Impact 1,239 ***

Arthur, D. and Manthey, B. and Röglin, H. (2009) k-Means has polynomial smoothed complexity. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), 24-27 Oct 2009, Atlanta, GA, USA. pp. 405-414. IEEE Computer Society. ISBN 978-0-7695-3850-1

Engels, C. and Manthey, B. (2009) Average-case approximation ratio of the 2-opt algorithm for the TSP. Operations Research Letters, 37 (2). pp. 83-84. ISSN 0167-6377 *** ISI Impact 0,739 ***

Fouz, M. and Kufleitner, M. and Manthey, B. and Zeini Jahromi, N. (2009) On smoothed analysis of quicksort and Hoare's find. In: Proceedings of the 15th Annual International Computing and Combinatorics Conference, COCOON 2009, 13-15 Jul 2009, Niagara Falls, NY, USA. pp. 158-167. Lecture Notes in Computer Science 5609. Springer. ISBN 978-3-642-02881-6

Manthey, B. (2009) Minimum-weight cycle covers and their approximability. Discrete Applied Mathematics, 157 (7). pp. 1470-1480. ISSN 0166-218X *** ISI Impact 0,822 ***

Manthey, B. (2009) On approximating multi-criteria TSP. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, 26-28 Feb 2009, Freiburg, Germany. pp. 637-648. Dagstuhl Research Online Publication Server. ISBN 978-3-939897-09-5

Manthey, B. and Röglin, H. (2009) Worst-case and smoothed analysis of -means clustering with Bregman divergences. In: Proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC 2009, 16-18 Dec 2009, Honolulu, Hawaii, USA. pp. 1024-1033. Lecture Notes in Computer Science 5878. Springer. ISBN 978-3-642-10630-9

Manthey, B. and Röglin, H. (2009) Improved smoothed analysis of the -means method. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, 4-6 Jan 2009, New York, NY, USA. pp. 461-470. SIAM. ISBN not assigned

Manthey, B. and Shankar Ram, L. (2009) Approximation algorithms for multi-criteria traveling salesman problems. Algorithmica, 53 (1). pp. 69-88. ISSN 0178-4617 *** ISI Impact 1,239 ***

Bläser, M. and Heynen, T. and Manthey, B. (2008) Adding cardinality constraints to integer programs with applications to maximum satisfiability. Information processing letters, 105 (5). pp. 194-198. ISSN 0020-0190 *** ISI Impact 0,612 ***

Manthey, B. (2008) On approximating restricted cycle covers. SIAM Journal on Computing, 38 (1). pp. 181-206. ISSN 0097-5397 *** ISI Impact 2,321 ***

Manthey, B. and Reischuk, R. (2007) Smoothed analysis of binary search trees. Theoretical computer science, 378 (3). pp. 292-315. ISSN 0304-3975 *** ISI Impact 0,838 ***

Bläser, M. and Jakoby, A. and Liskiewicz, M. and Manthey, B. (2006) Private computation: k-connected versus 1-connected networks. Journal of Cryptology, 19 (3). pp. 341-357. ISSN 0933-2790 *** ISI Impact 2,675 ***

Bläser, M. and Manthey, B. and Sgall, J. (2006) An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. Journal of Discrete Algorithms, 4 (4). pp. 623-632. ISSN 1468-0904

Bläser, M. and Manthey, B. (2005) Approximating maximum weight cycle covers in directed graphs with weights zero and one. Algorithmica, 42 (2). pp. 121-139. ISSN 0178-4617 *** ISI Impact 1,239 ***

Manthey, B. (2005) Non-approximability of weighted multiple sequence alignment for arbitrary metrics. Information processing letters, 95 (3). pp. 389-395. ISSN 0020-0190 *** ISI Impact 0,612 ***

Manthey, B. and Reischuk, R. (2005) The intractability of computing the Hamming distance. Theoretical computer science, 337 (1-3). pp. 331-346. ISSN 0304-3975 *** ISI Impact 0,838 ***

Liskiewicz, M. and Manthey, B. (2004) New lower and upper bounds for the competitive ratio of transmission protocols. Information processing letters, 89 (6). pp. 297-301. ISSN 0020-0190 *** ISI Impact 0,612 ***

Böhme, M. and Manthey, B. (2003) The computational power of compiling C++. Bulletin of the European Association for Theoretical Computer Science, 81. pp. 264-270. ISSN 0252-9742

Manthey, B. (2003) Non-approximability of weighted multiple sequence alignment. Theoretical computer science, 296 (1). pp. 179-192. ISSN 0304-3975 *** ISI Impact 0,838 ***