| 2008 | FAW | Versioning Tree Structures by Path-Merging. | Khaireel A. Mohamed, Tobias Langner, Thomas Ottmann |
| 2008 | ISCC | Relaxed min-augmented range trees for the representation of dynamic IP router tables. | Christine Maindorfer, Bettina Br, Thomas Ottmann |
| 2008 | NCA | Is the Popular R*-tree Suited for Packet Classification? | Christine Maindorfer, Thomas Ottmann |
| 2007 | INFOCOM | A New Output-Sensitive Algorithm to Detect and Resolve Conflicts in Internet Router Tables. | Christine Maindorfer, Khaireel A. Mohamed, Thomas Ottmann, Amitava Datta |
| 2005 | ICCE | Overcoming Hard-To-Reach Toolboxes with On-Demand Menu Options for Cascading Electronic Whiteboards in Classrooms. | Khaireel A. Mohamed, Thomas Ottmann |
| 2005 | ITiCSE | Student-built algorithm visualizations for assessment: flexible generation, feedback and grading. | Markus Krebs, Tobias Lauer, Thomas Ottmann, Stephan Trahasch |
| 2004 | WWW | Post-processing inkml for random-access navigation of voluminous handwritten ink documents. | Khaireel A. Mohamed, Lioudmila Belenkaia, Thomas Ottmann |
| 2001 | CHI | The "Authoring on the Fly" system for automatic presentation recording. | Wolfgang Hrst, Gabriela Maass, Rainer Mller, Thomas Ottmann |
| 2000 | GI | Mglichkeiten und Grenzen der Virtualisierung des Informatikstudiums. | Thomas Ottmann |
| 1997 | CIAC | An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons. | Amitava Datta, Kamala Krithivasan, Thomas Ottmann |
| 1997 | CIAC | Relaxed Balanced Red-Black Trees. | Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen |
| 1997 | ESA | Relaxed Balance for Search Trees with Local Rebalancing. | Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen |
| 1995 | STACS | Enumerating Extreme Points in Higher Dimensions. | Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi |
| 1994 | ECAI | An Efficient Data Structure for Bidirectional Heuristic Search. | Jrgen Eckerle, Thomas Ottmann |
| 1991 | FOCS | Faster Uniquely Represented Dictionaries | Arne Andersson, Thomas Ottmann |
| 1987 | WG | Priority Search Trees in Secondary Memory (Extended Abstract). | Christian Icking, Rolf Klein, Thomas Ottmann |
| 1986 | GI | Verarbeitung und Verwaltung geometrischer Daten - Einfhrung in das Fachgesprch. | Thomas Ottmann |
| 1985 | STACS | New Algorithms for Special Cases of the Hidden Line Elimination Problem. | Ralf Hartmut Gting, Thomas Ottmann |
| 1984 | GI | Geometrische Probleme beim VLSI-Design. | Thomas Ottmann |
| 1984 | ICALP | The Complexity and Decidability of Separation. | Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood |
| 1984 | MFCS | Solving Visibility Problems by Using Skeleton Structures. | Thomas Ottmann, Peter Widmayer |
| 1981 | MFCS | The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. | Jon Louis Bentley, Thomas Ottmann |
| 1981 | WG | A Realistic Cost Measure for Binary Search Trees. | Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood |
| 1981 | WG | 1-Pass Top-Down Update Schemes for Balanced Search Trees. | Thomas Ottmann, Michael Schrapp |
| 1980 | WG | The Power of a One-Dimensional Vector of Processors. | Jon Louis Bentley, Thomas Ottmann |
| 1980 | WG | The Analysis of Search Trees: A Survey. | Thomas Ottmann, Hans-Werner Six, Derick Wood |
| 1979 | MFCS | A Uniform Approach to Balanced Binary and Multiway Trees. | Thomas Ottmann, Derick Wood |
| 1977 | ICALP | Left-Fitting Translations. | Hans-Peter Kriegel, Thomas Ottmann |
| 1977 | MFCS | Tree-Structures for Set Manipulation Problems. | Hermann A. Maurer, Thomas Ottmann |