معرفی
Eva Rotenberg is an Associate Professor in the Department of Applied Mathematics and Computer Science at the Technical University of Denmark (DTU), affiliated with the Algorithms, Logic and Graphs section. Her research is centered on theoretical computer science, particularly algorithms, data structures, and graph theory.
Research Interests: Her work focuses on graph algorithms, especially in planar and dynamic graphs, data structures for efficient computation, and combinatorial optimization. Key topics include approximation algorithms, worst-case analysis, edge connectivity, and local density estimation in distributed settings. She investigates algorithmic solutions with strong theoretical guarantees.
The recent publications (2024–2025) reveal a consistent focus on graph-theoretic problems in discrete algorithms, with applications in dynamic and distributed systems. Trends include adaptive data structures, sorting via partial orders, and connectivity augmentation in geometric graphs.
Scientific Awards:
- No specific awards listed in the provided text.
Advising and Grants: She is the main supervisor for multiple active PhD projects at DTU, including Dynamic Graph Algorithms, Combinatorial Algorithms on Graphs and Geometry, and Hierarchical Compression of Highly-Repetitive Data. These projects indicate successful grant acquisition and leadership of a vibrant research group. Her supervision spans theoretical algorithms and their applications in data compression and network analysis.
Labs and Teams: She is a core member of the Algorithms, Logic and Graphs group at DTU, which conducts fundamental research in discrete mathematics and theoretical computer science. This team actively publishes in top venues and collaborates on national and international projects.
