EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


Research Project: SMABEP: Smoothed Analysis of Belief Propagation
Home Policy Brochure Browse Search User Area Contact Help

2013

Bläser, M. and Manthey, B. and Rao, B.V.R. (2013) Smoothed analysis of partitioning algorithms for Euclidean functionals. Algorithmica, 66 (2). pp. 397-418. ISSN 0178-4617 *** ISI Impact 0,49 ***
Bringmann, K. and Engels, C. and Manthey, B. and Rao, B. V. R. (2013) Random shortest paths: non-euclidean instances for metric optimization problems. In: Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), 26-30 Aug 2013, Klosterneuburg, Austria. pp. 219-230. Lecture Notes in Computer Science 8087. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-40312-5
Brunsch, T. and Cornelissen, K. and Manthey, B. and Röglin, H. (2013) Smoothed analysis of belief propagation for minimum-cost flow and matching. Journal of Graph Algorithms and Applications, 17 (6). pp. 647-670. ISSN 1526-1719
Brunsch, T. and Cornelissen, K. and Manthey, B. and Röglin, H. (2013) Smoothed analysis of the successive shortest path algorithm. In: Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013), 21-23 May 2013, Enschede, Netherlands. pp. 27-30. CTIT Workshop Proceedings WP 13-01. Centre for Telematics and Information Technology, University of Twente. ISSN 0929-0672
Brunsch, T. and Cornelissen, K. and Manthey, B. and Röglin, H. (2013) Smoothed analysis of the successive shortest path algorithm. In: Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms, 6-8 Jan 2013, New Orleans, LA, USA. pp. 1180-1189. SIAM. ISSN 1557-9468 ISBN 978-1-611972-52-8
Brunsch, T. and Cornelissen, K. and Manthey, B. and Röglin, H. (2013) Smoothed analysis of belief propagation for minimum-cost flow and matching. In: Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM 2013), 14-16 Feb 2013, Kharagpur, India. pp. 182-193. Lecture Notes in Computer Science 7748. Springer Verlag. ISBN 978-3-642-36064-0
Manthey, B. and Plociennik, K. (2013) Approximating independent set in perturbed graphs. Discrete applied mathematics, 161 (12). pp. 1761-1768. ISSN 0166-218X *** ISI Impact 0,72 ***
Manthey, B. and Röglin, H. (2013) Worst-case and smoothed analysis of k-means clustering with Bregman divergences. Journal of Computational Geometry, 4 (1). pp. 94-132. ISSN 1920-180X
Manthey, B. and Veenstra, H.J. (2013) Smoothed analysis of the 2-opt heuristic for the TSP: polynomial bounds for Gaussian noise. In: Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013), 16-18 Dec 2013, Hong Kong, China. pp. 579-589. Lecture Notes in Computer Science 8283. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-45029-7

2012

Bläser, M. and Manthey, B. (2012) Smoothed complexity theory. In: 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, 27-31 Aug 2012, Bratislava, Slovakia. pp. 198-209. Lecture Notes in Computer Science 7464. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-32588-5
Damerow, V. and Manthey, B. and Meyer auf der Heide, F. and Räcke, H. and Scheideler, C. and Sohler, C. and Tantau, T. (2012) Smoothed analysis of left-to-right maxima with applications. ACM Transactions on Algorithms, 8 (3). 30:1-30:28. ISSN 1549-6325 *** ISI Impact 0,54 ***
Engels, C. and Manthey, B. and Rao, B. V. Raghavendra (2012) Random shortest path metrics with applications. In: Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), 29-31 May 2012, Munich, Germany. pp. 121-124. Universität der Bundeswehr München. ISBN 978-3-943207-05-7
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 0,49 ***
Manthey, B. (2012) Multi-criteria TSP: Min and max combined. Operations research letters, 40 (1). pp. 36-38. ISSN 0167-6377 *** ISI Impact 0,52 ***
Manthey, B. (2012) On approximating multi-criteria TSP. ACM Transactions on Algorithms, 8 (2). 17:1-17:18. ISSN 1549-6325 *** ISI Impact 0,54 ***
Manthey, B. (2012) Deterministic algorithms for multi-criteria Max-TSP. Discrete applied mathematics, 160 (15). pp. 2277-2285. ISSN 0166-218X *** ISI Impact 0,72 ***

2011

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 2,37 ***
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