Bodo Manthey 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	1111	311
h 指数	19	9
i10 指数	33	6

120

2001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320245 4 8 10 35 28 27 30 45 25 52 51 77 53 110 82 68 66 59 49 49 46 82 24

开放获取的出版物数量

查看全部

18 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Heiko RöglinProfessor of Computer Science, University of Bonn在 cs.uni-bonn.de 的电子邮件经过验证
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, Germany在 cs.uni-saarland.de 的电子邮件经过验证
Kamiel CornelissenPhD Student in Applied Mathematics, University of Twente在 utwente.nl 的电子邮件经过验证
Maciej LiskiewiczUniversity of Lübeck在 tcs.uni-luebeck.de 的电子邮件经过验证
Christian EngelsNational Institute of Informatics, Tokyo, Japan在 cs.uni-saarland.de 的电子邮件经过验证
Ruben HoeksmaUniversity of Twente在 utwente.nl 的电子邮件经过验证
Raghavendra Rao B VIIT Madras在 cse.iitm.ac.in 的电子邮件经过验证
Jesse van RhijnPhD student, University of Twente在 utwente.nl 的电子邮件经过验证
Marc UetzProfessor of Discrete Mathematics and Mathematical Programming, University of Twente在 utwente.nl 的电子邮件经过验证
Endre BorosDistinguished Professor, MSIS Department, Rutgers University在 rutgers.edu 的电子邮件经过验证
Vladimir GurvichRBS and RUTCOR, Rutgers University; Higher School of Economics, Moscow, Professor在 hse.ru 的电子邮件经过验证
Johann HurinkProfessor Mathematics of Operations Research, University of Twente在 utwente.nl 的电子邮件经过验证
Jiri SgallComputer Science Institute of Charles University在 iuuk.mff.cuni.cz 的电子邮件经过验证
Manfred KufleitnerUniversity of Stuttgart在 fmi.uni-stuttgart.de 的电子邮件经过验证
Marvin KünnemannPostdoc at Max Planck Institute for Informatics, Saarbrücken, Germany在 mpi-inf.mpg.de 的电子邮件经过验证
Narayanaswamy N SIIT Madras在 cse.iitm.ac.in 的电子邮件经过验证
Rahul CSAssistant Professor, School of Mathematics & Computer Science, IIT Goa, India在 iitgoa.ac.in 的电子邮件经过验证
Kern, WalterUniversiteit Twente在 utwente.nl 的电子邮件经过验证
Karl BringmannProfessor in Computer Science, Saarland University在 cs.uni-saarland.de 的电子邮件经过验证
Christian SohlerProfessor for Algorithmic Data Analysis, University of Cologne在 uni-koeln.de 的电子邮件经过验证

关注

Bodo Manthey

Associate Professor, University of Twente

在 utwente.nl 的电子邮件经过验证 - 首页

Smoothed Analysis Algorithms Combinatorial Optimiziation Multi-Criteria Optimization Theoretical Computer Science


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Smoothed analysis of the k-means method D Arthur, B Manthey, H Röglin Journal of the ACM (JACM) 58 (5), 1-31, 2011	133	2011
k-Means has Polynomial Smoothed Complexity D Arthur, B Manthey, H Röglin Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009	78	2009
Average-case approximation ratio of the 2-opt algorithm for the TSP C Engels, B Manthey Operations Research Letters 37 (2), 83-84, 2009	48	2009
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality M Bläser, B Manthey, J Sgall Journal of discrete algorithms 4 (4), 623-632, 2006	45	2006
Smoothed analysis of binary search trees B Manthey, R Reischuk Theoretical Computer Science 378 (3), 292-315, 2007	41	2007
Computing cycle covers without short cycles M Bläser, B Siebert Algorithms—ESA 2001, 368-379, 2001	40	2001
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences B Manthey, H Röglin International Symposium on Algorithms and Computation, 1024-1033, 2009	38*	2009
Improved Smoothed Analysis of the k-Means Method B Manthey, H Röglin Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009	38	2009
Smoothed analysis of the successive shortest path algorithm T Brunsch, K Cornelissen, B Manthey, H Röglin, C Rösner SIAM Journal on Computing 44 (6), 1798-1819, 2015	36	2015
Approximating maximum weight cycle covers in directed graphs with weights zero and one M Bläser, B Manthey Algorithmica 42, 121-139, 2005	36	2005
On approximating restricted cycle covers B Manthey SIAM Journal on Computing 38 (1), 181-206, 2008	31	2008
Approximation algorithms for multi-criteria traveling salesman problems B Manthey, L Shankar Ram Algorithmica 53 (1), 69-88, 2009	30	2009
Private computation: k-connected versus 1-connected networks M Bläser, A Jakoby, M Liskiewicz, B Manthey Journal of cryptology 19 (3), 341-357, 2006	30*	2006
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions E Boros, K Elbassioni, M Fouz, V Gurvich, K Makino, B Manthey Algorithmica 80, 3132-3157, 2018	28*	2018
Smoothed analysis: analysis of algorithms beyond worst case B Manthey, H Röglin IT-Information Technology 53 (6), 280-286, 2011	28	2011
Smoothed analysis of the 2-Opt heuristic for the TSP: Polynomial bounds for Gaussian noise B Manthey, R Veenstra Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong …, 2013	27	2013
On approximating multicriteria TSP B Manthey ACM Transactions on Algorithms (TALG) 8 (2), 1-18, 2012	25	2012
Minimum-weight cycle covers and their approximability B Manthey Discrete Applied Mathematics 157 (7), 1470-1480, 2009	22	2009
Smoothed analysis of belief propagation for minimum-cost flow and matching T Brunsch, K Cornelissen, B Manthey, H Röglin International Workshop on Algorithms and Computation, 182-193, 2013	21	2013
Smoothed analysis of partitioning algorithms for Euclidean functionals M Bläser, B Manthey, BVR Rao Algorithmica 66, 397-418, 2013	19	2013

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用