معرفی
Inge Li Gørtz is a Professor in the Department of Applied Mathematics and Computer Science at the Technical University of Denmark (DTU), where she leads research in algorithms and data structures. She is affiliated with the Algorithms, Logic and Graphs section and has been a principal investigator on externally funded research projects. She also serves as chairman of the Danish Society for Computer Science since 2009.
Research Interests: Her work centers on the design and analysis of algorithms, with a focus on approximation algorithms, pattern matching, graph algorithms, and compressed data representations. She investigates efficient query processing, string indexing, and algorithmic challenges in highly repetitive data, including applications in bioinformatics and data streams.
The recent publications highlight a strong trend in theoretical and practical algorithm design, particularly in string indexing, compressed automata, and dynamic data structures. These works span venues like SOFSEM and STACS, emphasizing innovations in sublinear query time, sliding window models, and memory-efficient representations.
- Postdoc stipend from Carlsberg Foundation (2006–2008) for 'Approximation of Transportation on Demand Problems', kr 865,183
Advising and Grants: She actively supervises multiple PhD students on projects such as biomedical image segmentation using graph cuts, hierarchical compression of DNA data, and dynamic graph algorithms. She has served as main or co-supervisor in several funded PhD projects. She has been principal investigator on a Carlsberg Foundation grant and has participated in multiple Danish Council for Independent Research projects.
Labs and Teams: She is a core member of the Algorithms, Logic and Graphs (ALG) section at DTU, contributing to a vibrant research environment focused on theoretical computer science and algorithmic problem solving.
