Faculty of Computer Science

Ass.-Prof. Dr. Kathrin Hanauer, B.Sc. M.SC.

Kathrin Hanauer
Research Group Theory and Applications of Algorithms
Deputy Head
Währinger Straße 29
1090 Wien
Room : 6.31
T: +43-1-4277-78350
kathrin.hanauer(at)univie.ac.at
Personal homepage
u:cris portal

Courses

Publications

New Heuristic and Multivalued Decision Diagram-based Exact Algorithms for Repetition-Free Longest Common Subsequence Problems. / Braun, Georg; Hanauer, Kathrin; Vötsch, Maximilian.
2026 Proceedings of the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX). SIAM, 2026. p. 233-245.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.1137/1.9781611978957.18

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. / El-Hayek, Antoine; Hanauer, Kathrin; Henzinger, Monika.
The 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND). 2025.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Discrete Algorithms on Modern and Emerging Compute Infrastructure. / Hanauer, Kathrin; Naumann, Uwe; Pothen, Alex et al.
Dagstuhl Seminar 24201. 2024.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.4230/DagRep.14.5.12

Expander Hierarchies for Normalized Cuts on Graphs. / Hanauer, Kathrin; Henzinger, Monika; Münk, Robin et al.
KDD '24: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. New York: Association for Computing Machinery (ACM), 2024. p. 1016-1027 (Proceedings of the Conference on Knowledge Discovery and Data Mining).

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.1145/3637528.3671978

Covering Rectilinear Polygons with Area-Weighted Rectangles. / Hanauer, Kathrin; Seybold, Martin; Unterweger, Julian.
SIAM Symposium on Algorithm Engineering and Experiments (ALENEX24). 2024.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.1137/1.9781611977929.12

Assisted Normative Reasoning with Aristotelian Diagrams. / Hanauer, Kathrin; Novotná, Tereza; Pascucci, Matteo.
Legal Knowledge and Information Systems - JURIX 2023: 36th Annual Conference, Maastricht, the Netherlands, 18–20 December 2023. ed. / Giovanni Sileno; Jerry Spanakis; Gijs van Dijck. 2023. p. 89-94 (Frontiers in Artificial Intelligence and Applications, Vol. 379).

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.3233/FAIA230949

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. / Hanauer, Kathrin; Henzinger, Monika; Ost, Lara et al.
IEEE International Conference on Computer Communications (INFOCOM 2023). 2023.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.48550/arXiv.2301.05751

Recent Advances in Fully Dynamic Graph Algorithms: A Quick Reference Guide. / Hanauer, Kathrin; Henzinger, Monika; Schulz, Christian.
In: Journal of Experimental Algorithmics, Vol. 27, No. 11, 1.11, 13.12.2022, p. 1-45.

Publications: Contribution to journal › Article › Peer Reviewed

doi.org/10.1145/3555806

O'Reach: Even Faster Reachability in Large Graphs. / Hanauer, Kathrin; Schulz, Christian; Trummer, Jonathan.
In: Journal of Experimental Algorithmics, Vol. 27, No. 5, 4.2, 21.10.2022, p. 1-27.

Publications: Contribution to journal › Article › Peer Reviewed

doi.org/10.1145/3556540

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). / Hanauer, Kathrin; Henzinger, Monika; Schulz, Christian.
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). ed. / James Aspnes; Othon Michail. 2022. 1.

Publications: Contribution to book › Contribution to proceedings

doi.org/10.4230/LIPIcs.SAND.2022.1
1 - 10 out of 15

Talks

Engineering Dynamic Graph Algorithms for Large-Scale Applications

Kathrin Hanauer
The Third Workshop on Serverless, Extreme-Scale, and Sustainable Graph Processing Systems
Seminar/Workshop, Talk or oral contribution
25.8.2025

On Dynamic Graph Algorithms, Algorithm Engineering, and Reconfigurable Data Centers

Kathrin Hanauer
Dagstuhl-Seminar 25171, Holistic Graph-Processing Systems: Enabling Real-World Scale and Societal Impact
Seminar/Workshop, Talk or oral contribution
21.4.2025 - 25.4.2025

Practically Efficient Dynamic Algorithms for Data Centers

Kathrin Hanauer
Our dsUniVie Talk
Conference, Talk or oral contribution
7.10.2024

Dynamic Graph Algorithms in Theory and Practice

Kathrin Hanauer
Dagstuhl Seminar 24201
Seminar/Workshop, Talk or oral contribution
16.5.2024

Engineering Dynamic Graph Algorithms

Kathrin Hanauer
NetworKit Day 2024
Other, Talk or oral contribution
9.4.2024

Mining Small Patterns in Dynamic Graphs

Kathrin Hanauer
Dagstuhl Seminar on Scalable Graph Mining and Learning
Seminar/Workshop, Talk or oral contribution
7.12.2023

On Engineering Dynamic Graph Algorithms

Kathrin Hanauer
Dynamic Graphs and Algorithm Design, Data Structures and Optimization for Fast Algorithms Program
Seminar/Workshop, Talk or oral contribution
21.9.2023

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters

Kathrin Hanauer
SIAM Conference on Computational Science and Engineering (CSE23)
Conference, Talk or oral contribution
17.5.2023

Optimal Link Scheduling via Subgraph Coloring

Kathrin Hanauer
SIAM Conference on Computational Science and Engineering (CSE23)
Conference, Talk or oral contribution
1.3.2023

Fully Dynamic Graph Algorithms in Practice: (Some) Lessons Learned

Kathrin Hanauer
Dagstuhl Seminar "Dynamic Graph Algorithms"
Seminar/Workshop, Talk or oral contribution
15.11.2022

Disjoint weighted matchings for reconfigurable optical datacenter technologies

Kathrin Hanauer
1st ACDA Workshop in Aussois
Seminar/Workshop, Talk or oral contribution
8.9.2022

Recent Advances in Fully Dynamic Graph Algorithms: A Practitioner’s View

Kathrin Hanauer
DFG Priority Programme "Algorithms for Big Data"
Other, Talk or oral contribution
10.6.2022

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies

Kathrin Hanauer
IEEE International Conference on Computer Communications
Conference, Talk or oral contribution
2.5.2022 - 5.5.2022

Fully Dynamic Four-Vertex Subgraph Counting

Kathrin Hanauer
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)
Conference, Talk or oral contribution
30.3.2022

Even Faster Reachability in Large Graphs

Kathrin Hanauer
19th Symposium on Experimental Algorithms (SEA 2021)
Conference, Talk or oral contribution
9.6.2021

Faster Fully Dynamic Transitive Closure in Practice

Kathrin Hanauer
18th Symposium on Experimental Algorithms
Conference, Talk or oral contribution
17.6.2020

Fully Dynamic Single-Source Reachability in Practice: An Experimental Study

Kathrin Hanauer
ALENEX 2020
Conference, Talk or oral contribution
5.1.2020