معرفی
Kathrin Hanauer is an Assistant Professor at the University of Vienna, where she is affiliated with the Research Group Theory and Applications of Algorithms and the Research Network Data Science. She conducts research in the design, analysis, and experimental evaluation of fast algorithms, with a focus on Algorithm Engineering connecting theoretical foundations with practical implementations.
Her research interests include:
- Algorithm Engineering for practical algorithm implementation
- Dynamic algorithms for efficiently handling changing data
- Graph algorithms and network analysis
- Reachability problems on directed graphs
- Ranking problems, particularly the NP-hard Feedback Arc Set problem
- Network analysis, motif search, and subgraph counting
Dr. Hanauer's recent publications demonstrate a strong focus on dynamic graph algorithms, with significant contributions to reachability queries, subgraph counting, and datacenter network optimization. Her work spans both theoretical algorithm design and practical implementation, often with C++ software projects. Notable contributions include the O'Reach algorithm for faster reachability queries in large graphs and several dynamic algorithms for subgraph counting and network analysis.
Her scientific contributions:
- O'Reach: A novel approach to reachability queries in large graphs that outperforms previous methods
- Dynamic algorithms for four-vertex subgraph counting with efficient update operations
- Work on demand-aware link scheduling for reconfigurable datacenters
- Interdisciplinary research on normative reasoning with Aristotelian diagrams
Dr. Hanauer actively supervises student research, with numerous completed theses focusing on dynamic graph algorithms, geometric algorithms, and reachability problems. Her lab maintains several software projects related to graph algorithms, including a modular algorithms library for dynamic graphs written in C++ and specialized implementations for reachability queries and subgraph counting.
