Thomas Ottmann

1.4k total citations
71 papers, 630 citations indexed

About

Thomas Ottmann is a scholar working on Artificial Intelligence, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Thomas Ottmann has authored 71 papers receiving a total of 630 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Artificial Intelligence, 15 papers in Computer Graphics and Computer-Aided Design and 13 papers in Computer Networks and Communications. Recurrent topics in Thomas Ottmann's work include Computational Geometry and Mesh Generation (15 papers), Algorithms and Data Compression (12 papers) and Multimedia Communication and Technology (11 papers). Thomas Ottmann is often cited by papers focused on Computational Geometry and Mesh Generation (15 papers), Algorithms and Data Compression (12 papers) and Multimedia Communication and Technology (11 papers). Thomas Ottmann collaborates with scholars based in Germany, Canada and Australia. Thomas Ottmann's co-authors include Derick Wood, Rainer Müller, Ivan Tomek, Ralf Hartmut Güting, Peter Widmayer, Eljas Soisalon-Soininen, D. Wood, Tobias Lauer, Daniele Pretolani and Markus Krebs and has published in prestigious journals such as Information Sciences, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Thomas Ottmann

62 papers receiving 553 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Thomas Ottmann Germany 15 204 190 118 93 92 71 630
Antonios Symvonis Greece 11 166 0.8× 184 1.0× 43 0.4× 8 0.1× 84 0.9× 58 431
T. J. Jankun-Kelly United States 15 122 0.6× 680 3.6× 197 1.7× 131 1.4× 31 0.3× 35 899
Keith Andrews Austria 16 38 0.2× 476 2.5× 241 2.0× 141 1.5× 14 0.2× 60 742
Corin R. Anderson United States 10 63 0.3× 148 0.8× 311 2.6× 56 0.6× 29 0.3× 15 655
Kazuo Misue Japan 8 95 0.5× 512 2.7× 127 1.1× 104 1.1× 52 0.6× 60 703
P. Eades Australia 6 119 0.6× 583 3.1× 138 1.2× 117 1.3× 101 1.1× 13 797
Brad Vander Zanden United States 10 34 0.2× 143 0.8× 213 1.8× 85 0.9× 27 0.3× 19 632
Hwan-Gue Cho South Korea 14 100 0.5× 189 1.0× 170 1.4× 43 0.5× 8 0.1× 131 718
Jon Meyer United States 7 27 0.1× 249 1.3× 101 0.9× 67 0.7× 9 0.1× 9 506
Yang Shi China 19 35 0.2× 757 4.0× 262 2.2× 126 1.4× 47 0.5× 45 1.1k

Countries citing papers authored by Thomas Ottmann

Since Specialization
Citations

This map shows the geographic impact of Thomas Ottmann'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 Thomas Ottmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Ottmann more than expected).

Fields of papers citing papers by Thomas Ottmann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas Ottmann. 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 Thomas Ottmann. The network helps show where Thomas Ottmann may publish in the future.

Co-authorship network of co-authors of Thomas Ottmann

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Ottmann. A scholar is included among the top collaborators of Thomas Ottmann 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 Thomas Ottmann. Thomas Ottmann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ottmann, Thomas, et al.. (2013). Lecture Recording — a Success Story. it - Information Technology. 55(3). 115–122. 3 indexed citations
2.
Ottmann, Thomas, et al.. (2011). Lecture Recording - vom Experiment zum Hochschulalltag.. Opus-HSO (Offenburg University of Applied Sciences). 1 indexed citations
3.
Ottmann, Thomas, et al.. (2005). Controlling the Electronic Whiteboard’s Writing Surface without Cluttered Toolboxes: Shifting the Focus Back to Content Delivery. E-Learn: World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education. 2005(1). 3053–3068.
4.
Krebs, Markus, et al.. (2005). Student-built algorithm visualizations for assessment. ACM SIGCSE Bulletin. 37(3). 281–285. 4 indexed citations
5.
Ottmann, Thomas, et al.. (2004). Creation, Presentation, Capture, and Replay of Freehand Writings in e-Lecture Scenarios. EdMedia: World Conference on Educational Media and Technology. 2004(1). 791–796. 2 indexed citations
6.
Ottmann, Thomas, et al.. (2004). Der Universitäre Lehrverbund Informatik - eine Bilanz.. Softwaretechnik-Trends. 24. 6 indexed citations
7.
Ottmann, Thomas, et al.. (2002). Means and Methods in Automatic Courseware Production: Experience and Technical Challenges. E-Learn: World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education. 2002(1). 553–560. 33 indexed citations
8.
Lauer, Tobias & Thomas Ottmann. (2001). Animations for Teaching Purposes: Now and Tomorrow. Zenodo (CERN European Organization for Nuclear Research). 5 indexed citations
9.
Andersson, Arne & Thomas Ottmann. (1995). New Tight Bounds on Uniquely Represented Dictionaries. SIAM Journal on Computing. 24(5). 1091–1103. 4 indexed citations
10.
Ottmann, Thomas, et al.. (1994). An efficient data structure for bidirectional heuristic search. European Conference on Artificial Intelligence. 600–604. 3 indexed citations
11.
Ottmann, Thomas & Ivan Tomek. (1994). Educational Multimedia and Hypermedia, 1994. 57 indexed citations
12.
Malucelli, Federico, Thomas Ottmann, & Daniele Pretolani. (1993). Efficient labelling algorithms for the maximum noncrossing matching problem. Discrete Applied Mathematics. 47(2). 175–179. 19 indexed citations
13.
Güting, Ralf Hartmut & Thomas Ottmann. (1987). New algorithms for special cases of the hidden line elimination problem. Computer Vision Graphics and Image Processing. 40(2). 188–204. 37 indexed citations
14.
Ottmann, Thomas, et al.. (1985). Weight-balanced trees are not stratified.. OpenGrey (Institut de l'Information Scientifique et Technique). 25. 24–30. 1 indexed citations
15.
Ottmann, Thomas, et al.. (1981). 1-Pass Top-Down Update Schemes for Balanced Search Trees.. 279–292. 2 indexed citations
16.
Ottmann, Thomas, Arnold L. Rosenberg, Hans-Werner Six, & Derick Wood. (1981). A Realistic Cost Measure for Binary Search Trees.. 163–172. 1 indexed citations
17.
Büning, Hans Kleine & Thomas Ottmann. (1977). Kleine universelle mehrdimensionale Turingmaschinen.. Journal of automata, languages and combinatorics. 13. 179–201. 5 indexed citations
18.
Ottmann, Thomas. (1975). Eine universelle Turingmaschine mit zweidimensionalem Band, 7 Buchstaben und 2 Zuständen.. Journal of automata, languages and combinatorics. 11. 27–38. 2 indexed citations
19.
Ottmann, Thomas, et al.. (1974). Simulation endlicher Automaten durch Ketten aus einfachen Bausteinautomaten.. Journal of automata, languages and combinatorics. 10. 133–148. 1 indexed citations
20.
Ottmann, Thomas. (1973). Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen. Mathematical logic quarterly. 19(14-18). 223–238. 5 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

Rankless by CCL
2026