Raimund Seidel is a Professor in the Department of Computer Science at Universität des Saarlandes, leading the Chair of Theoretical Computer Science. He is actively involved in research and teaching, focusing on foundational aspects of algorithms and data structures, particularly in computational geometry. His primary research interests include theoretical computer science , design and analysis of efficient algorithms , geometric data structures , randomized algorithms , and combinatorial geometry . His work addresses fundamental problems such as planar point location, convex hull computation, and efficient encoding of triangulations. He also investigates geometric algorithms under the transdichotomous model, leveraging word-level parallelism. The selected publications reflect a long-standing contribution to computational geometry and data structure theory , with a focus on randomized methods and exact complexity analysis. His research combines theoretical rigor with practical implications for algorithm design. Award or honor not found in the provided text. Prof. Seidel has advised several students, including Alexander Malkis , Ralf Osbild , Udo Adamy , Christian Sohler , and others, many of whom have gone on to academic and research careers. No explicit information about grants or funding is available in the text. He leads a research group within the Department of Computer Science at Universität des Saarlandes, mentoring current staff such as László Kozma , Giorgi Nadiradze , and Lavinia Dinu . The group maintains active research in theoretical computer science and computational geometry.
