Bodo Manthey

958 total citations
50 papers, 346 citations indexed

About

Bodo Manthey is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Bodo Manthey has authored 50 papers receiving a total of 346 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 23 papers in Artificial Intelligence and 20 papers in Computer Networks and Communications. Recurrent topics in Bodo Manthey's work include Complexity and Algorithms in Graphs (25 papers), Optimization and Search Problems (20 papers) and Advanced Graph Theory Research (12 papers). Bodo Manthey is often cited by papers focused on Complexity and Algorithms in Graphs (25 papers), Optimization and Search Problems (20 papers) and Advanced Graph Theory Research (12 papers). Bodo Manthey collaborates with scholars based in Germany, Netherlands and United States. Bodo Manthey's co-authors include Heiko Röglin, David Arthur, Markus Bläser, Rüdiger Reischuk, Jiřı́ Sgall, Kamiel Cornelissen, Johann L. Hurink, Mahmoud Fouz, Manfred Kufleitner and Maciej Liśkiewicz and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Bodo Manthey

46 papers receiving 321 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Bodo Manthey Germany	10	136	113	86	72	46	50	346
Ravishankar Krishnaswamy United States	13	83 0.6×	80 0.7×	220 2.6×	109 1.5×	49 1.1×	39	375
Kimbal George Marriott Australia	3	183 1.3×	101 0.9×	202 2.3×	72 1.0×	20 0.4×	7	433
Shahriar Lotfi Iran	12	276 2.0×	102 0.9×	134 1.6×	50 0.7×	32 0.7×	52	503
Leonidas Pitsoulis Greece	10	100 0.7×	62 0.5×	71 0.8×	123 1.7×	22 0.5×	30	326
Guido Proietti Italy	14	95 0.7×	209 1.8×	259 3.0×	49 0.7×	101 2.2×	68	543
Donald K. Wagner United States	9	69 0.5×	170 1.5×	140 1.6×	64 0.9×	29 0.6×	32	403
Tadao Takaoka New Zealand	10	162 1.2×	200 1.8×	118 1.4×	23 0.3×	60 1.3×	50	402
P. M. Camerini Italy	11	70 0.5×	190 1.7×	114 1.3×	122 1.7×	29 0.6×	19	389
Alexander Ageev Russia	10	88 0.6×	209 1.8×	225 2.6×	128 1.8×	21 0.5×	24	464
Giulia Galbiati Italy	12	82 0.6×	269 2.4×	168 2.0×	171 2.4×	37 0.8×	32	469

Countries citing papers authored by Bodo Manthey

Since Specialization

Citations

This map shows the geographic impact of Bodo Manthey's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bodo Manthey with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bodo Manthey more than expected).

Fields of papers citing papers by Bodo Manthey

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bodo Manthey. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bodo Manthey. The network helps show where Bodo Manthey may publish in the future.

Co-authorship network of co-authors of Bodo Manthey

This figure shows the co-authorship network connecting the top 25 collaborators of Bodo Manthey. A scholar is included among the top collaborators of Bodo Manthey based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Bodo Manthey. Bodo Manthey is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Manthey, Bodo, et al.. (2025). Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem. Discrete Applied Mathematics. 375. 7–16.

Hurink, Johann L., et al.. (2019). Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Data Archiving and Networked Services (DANS). 5 indexed citations

Manthey, Bodo, et al.. (2016). Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope. Discrete Applied Mathematics. 215. 136–145. 1 indexed citations

Künnemann, Marvin & Bodo Manthey. (2015). Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP. University of Twente Research Information. 1–4. 1 indexed citations

Cornelissen, Kamiel, et al.. (2013). Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013). 5 indexed citations

Cornelissen, Kamiel, et al.. (2013). Smoothed analysis of the successive shortest path algorithm. University of Twente Research Information. 1180–1189. 6 indexed citations

Manthey, Bodo. (2012). Deterministic algorithms for multi-criteria Max-TSP. Discrete Applied Mathematics. 160(15). 2277–2285. 4 indexed citations

Manthey, Bodo, et al.. (2011). Bisimplicial edges in bipartite graphs. Discrete Applied Mathematics. 161(12). 1699–1706.

Manthey, Bodo. (2011). Multi-criteria TSP: Min and max combined. Operations Research Letters. 40(1). 36–38. 2 indexed citations

10.

Manthey, Bodo & Heiko Röglin. (2009). Improved smoothed analysis of the k-means method. arXiv (Cornell University). 461–470. 16 indexed citations

11.

Manthey, Bodo. (2009). On Approximating Multi-Criteria TSP. University of Twente Research Information. 3. 637–648. 9 indexed citations

12.

Manthey, Bodo & Heiko Röglin. (2009). Improved Smoothed Analysis of the k-Means Method. 461–470. 7 indexed citations

13.

Manthey, Bodo. (2008). Minimum-weight cycle covers and their approximability. Discrete Applied Mathematics. 157(7). 1470–1480. 4 indexed citations

14.

Manthey, Bodo & Rüdiger Reischuk. (2007). Smoothed analysis of binary search trees. Theoretical Computer Science. 378(3). 292–315. 15 indexed citations

15.

Bläser, Markus, et al.. (2007). Adding cardinality constraints to integer programs with applications to maximum satisfiability. Information Processing Letters. 105(5). 194–198. 2 indexed citations

16.

Manthey, Bodo & Rüdiger Reischuk. (2005). Smoothed Analysis of the Height of Binary Search Trees. Electronic colloquium on computational complexity. 2 indexed citations

17.

Manthey, Bodo. (2005). Approximability of Cycle Covers and Smoothed Analysis of Binary Search Trees. 57–66. 1 indexed citations

18.

Manthey, Bodo & Rüdiger Reischuk. (2005). The intractability of computing the Hamming distance. Theoretical Computer Science. 337(1-3). 331–346. 8 indexed citations

19.

Bläser, Markus, Bodo Manthey, & Jiřı́ Sgall. (2005). An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. Journal of Discrete Algorithms. 4(4). 623–632. 19 indexed citations

20.

Böhme, Martin & Bodo Manthey. (2003). The computational power of compiling C. University of Twente Research Information. 81. 264–270. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact