About Me
I got a PhD in computer science from the University of Lübeck and a "Habilitation" from Saarland University and held postdoctoral positions at Saarland University and at Yale University. Since 2009, I am affiliated with the University of Twente.
Organisations
Research
My research area is design and analysis of algorithms, in particular, smoothed and probabilistic analysis of algorithms.
Publications
Recent
Manthey, B.
, & van Rhijn, J. (2023).
Approximation Ineffectiveness of a Tour-Untangling Heuristic. In J. Byrka, & A. Wiese (Eds.),
Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Proceedings (pp. 1-13). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14297 LNCS). Springer. Advance online publication.
https://doi.org/10.1007/978-3-031-49815-2_1
Manthey, B.
, & van Rhijn, J. (Accepted/In press).
Approximation Ineffectiveness of a Tour-Untangling Heuristic. ArXiv.org.
https://arxiv.org/abs/2302.11264
Manthey, B.
, & van Rhijn, J. (Accepted/In press).
Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering. ArXiv.org.
https://arxiv.org/abs/2309.10368
Manthey, B.
, & van Rhijn, J. (2023).
Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. In S. Iwata, S. Iwata, & N. Kakimura (Eds.),
34th International Symposium on Algorithms and Computation (ISAAC 2023) Article 52 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 283). Dagstuhl.
https://doi.org/10.4230/LIPIcs.ISAAC.2023.52
Klootwijk, S.
, & Manthey, B. (2023).
Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics.
Algorithmica,
85(12), 3793-3815.
https://doi.org/10.1007/s00453-023-01167-3
Hochstättler, W.
, Hurink, J.
, Manthey, B.
, Paulusma, D., Peis, B.
, & Still, G. (2021).
In Memoriam Walter Kern.
Discrete applied mathematics,
303, 2-3.
https://doi.org/10.1016/j.dam.2021.08.034
Klootwijk, S. (2021).
Probabilistic Analyses of Combinatorial Optimization Problems on Random Shortest Path Metrics. [PhD Thesis - Research UT, graduation UT, University of Twente]. University of Twente.
https://doi.org/10.3990/1.9789036552493
Klootwijk, S.
, Manthey, B., & Visser, S. K. (2021).
Probabilistic analysis of optimization problems on generalized random shortest path metrics.
Theoretical computer science,
866, 107-122.
https://doi.org/10.1016/j.tcs.2021.03.016
Manthey, B.
, & Hurink, J. (2021).
Preface: 17th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019).
Discrete applied mathematics,
303, 1.
https://doi.org/10.1016/j.dam.2021.08.033
Manthey, B.
, & Reijnders, V. M. J. J. (2021).
Probabilistic properties of highly connected random geometric graphs.
Discrete applied mathematics, 366-376.
https://doi.org/10.1016/j.dam.2019.04.007
Manthey, B. (2020).
Smoothed Analysis of Local Search. In T. Roughgarden (Ed.),
Beyond the Worst-Case Analysis of Algorithms (pp. 285-308). Cambridge University Press.
https://doi.org/10.1017/9781108637435.018
Cornelissen, K.
, & Manthey, B. (2020).
Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm.
Journal of graph algorithms and applications,
24(3), 397-421.
https://doi.org/10.7155/jgaa.00539
Klootwijk, S.
, & Manthey, B. (2020).
Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics. In M. Drmota, & C. Heuberger (Eds.),
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020) Article 19 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 159). Dagstuhl.
https://doi.org/10.4230/LIPIcs.AofA.2020.19
Hurink, J. L.
, Klootwijk, S.
, Manthey, B.
, Reijnders, V.
, & Schoot Uiterkamp, M. (Eds.) (2019).
Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. (DSI Workshop Proceedings Series; No. WP 19-01). University of Twente.
Klootwijk, S.
, & Manthey, B. (2019).
Probabilistic Analysis of Facility Location on Random Shortest Path Metrics. In F. Manea, B. Martin, D. Paulusma, & G. Primiero (Eds.),
Computing with Foresight and Industry: 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings (pp. 37-49). (Lecture Notes in Computer Science; Vol. 11558). Springer.
https://doi.org/10.1007/978-3-030-22996-2_4
Klootwijk, S.
, Manthey, B., & Visser, S. K. (2019).
Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics. In S. Nakano, G. K. Das, P. S. Mandal, & K. Mukhopadhyaya (Eds.),
WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27-March 2, 2019. Proceedings (pp. 108-120). (Lecture Notes in Computer Science; Vol. 11355), (Theoretical Computer Science and General Issues). Springer.
https://doi.org/10.1007/978-3-030-10564-8_9
UT Research Information System
Google Scholar Link
Affiliated Study Programmes
Bachelor
Master
Courses Academic Year 2023/2024
Courses in the current academic year are added at the moment they are finalised in the Osiris system. Therefore it is possible that the list is not yet complete for the whole academic year.
Courses Academic Year 2022/2023
Current Projects
Finished Projects
Contact Details
+31534896619
(secretary)
Visiting Address
University of Twente
Faculty of Electrical Engineering, Mathematics and Computer Science
Zilverling
(building no. 11), room 4010
Hallenweg 19
7522NH Enschede
The Netherlands
Mailing Address
University of Twente
Faculty of Electrical Engineering, Mathematics and Computer Science
Zilverling
4010
P.O. Box 217
7500 AE Enschede
The Netherlands