| Algorithms for reporting and counting geometric intersections Bentley, Ottmann IEEE Transactions on computers 100 (9), 643-647, 1979 | 1521 | 1979 |
| Algorithmen und datenstrukturen P Widmayer, T Ottmann BI Wissenschaftsverlag, 1993 | 704 | 1993 |
| The “Authoring on the Fly” system for automated recording and replay of (tele) presentations R Müller, T Ottmann Multimedia Systems 8, 158-176, 2000 | 177 | 2000 |
| A dictionary machine (for VLSI) Ottmann, Stockmeyer IEEE Transactions on Computers 100 (9), 892-897, 1982 | 116 | 1982 |
| Dense multiway trees K Culik, T Ottmann, D Wood ACM Transactions on Database Systems (TODS) 6 (3), 486-512, 1981 | 115 | 1981 |
| Numerical stability of geometric algorithms T Ottmann, G Theimt, C Ullrich Proceedings of the third annual symposium on Computational geometry, 119-125, 1987 | 111 | 1987 |
| On the definition and computation of rectilinear convex hulls T Ottmann, E Soisalon-Soininen, D Wood Information Sciences 33 (3), 157-171, 1984 | 108 | 1984 |
| New algorithms for special cases of the hidden line elimination problem RH Güting, T Ottmann Computer Vision, Graphics, and Image Processing 40 (2), 188-204, 1987 | 86 | 1987 |
| The edge-flipping distance of triangulations S Hanke, T Ottmann, S Schuierer Journal of Universal Computer Science 2 (8), 570-579, 1996 | 79 | 1996 |
| Authoring on the Fly C Bacher, R Müller, T Ottmann, M Will Informatik und Lernen in der Informationsgesellschaft: 7. GI-Fachtagung …, 1997 | 73 | 1997 |
| Means and methods in automatic courseware production: experience and technical challenges T Ottmann, T Lauer E-Learn: World Conference on E-Learning in Corporate, Government, Healthcare …, 2002 | 63 | 2002 |
| Relaxed balanced red-black trees S Hanke, T Ottmann, E Soisalon-Soininen Italian Conference on Algorithms and Complexity, 193-204, 1997 | 60 | 1997 |
| 1-2 brother trees or AVL trees revisited T Ottmann, D Wood The computer journal 23 (3), 248-255, 1980 | 56 | 1980 |
| Tools and Services for Authoring on the Fly C Bacher, T Ottmann Proceedings of the Conference on Educational Multimedia and Hypermedia, 7-12, 1996 | 52 | 1996 |
| Efficient labelling algorithms for the maximum noncrossing matching problem F Malucelli, T Ottmann, D Pretolani Discrete Applied Mathematics 47 (2), 175-179, 1993 | 52 | 1993 |
| Enumerating extreme points in higher dimensions T Ottmann, S Schuierer, S Soundaralakshmi Annual Symposium on Theoretical Aspects of Computer Science, 562-570, 1995 | 50 | 1995 |
| The complexity and decidability of separation B Chazelle, T Ottmann, E Soisalon-Soininen, D Wood Automata, Languages and Programming: 11th Colloquium Antwerp, Belgium, July …, 1984 | 48 | 1984 |
| Priority search trees in secondary memory C Icking, R Klein, T Ottmann Graph-Theoretic Concepts in Computer Science: International Workshop WG'87 …, 1988 | 47 | 1988 |
| The" authoring on the fly" system for automatic presentation recording W Hürst, G Maass, R Müller, T Ottmann CHI'01 Extended Abstracts on Human Factors in Computing Systems, 5-6, 2001 | 43 | 2001 |
| The complexity of manipulating hierarchically defined sets of rectangles JL Bentley, T Ottmann, P Widmayer Computational Geometry 1, 127-158, 1983 | 40 | 1983 |
