Ass.-Prof. Dr. Kathrin Hanauer, B.Sc. M.SC.
1090 Wien
Room : 6.31
Courses
Winter term 2026
-
052100 VU Algorithms and Data Structures 2
-
052111 VU Advanced Algorithms
-
053021 LP Practical Course: Computer Science 1
-
053031 LP Practical Course: Computer Science 2
-
053049 SE Master Seminar
-
500500 SE Doctoral Research Seminar - Algorithms and Computing
Summer term 2026
-
052100 VU Algorithms and Data Structures 2
-
053021 LP Practical Course: Computer Science 1
-
053031 LP Practical Course: Computer Science 2
-
053049 SE Master Seminar
-
053631 LP Data Analysis Project
-
500500 SE Doctoral Research Seminar - Algorithms and Computing
Winter term 2025
-
052100 VU Algorithms and Data Structures 2
-
052111 VU Advanced Algorithms
-
053021 LP Practical Course: Computer Science 1
-
053031 LP Practical Course: Computer Science 2
-
053049 SE Master Seminar
-
500500 SE Doctoral Research Seminar - Algorithms and Computing
Publications
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. / Hanauer, Kathrin; Henzinger, Monika; Schmid, Stefan et al.
IEEE Conference on Computer Communications (INFOCOM), Virtual Conference, May 2022. 2022.
Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Fully Dynamic Four-Vertex Subgraph Counting. / Hanauer, Kathrin; Henzinger, Monika; Hua, Qi Cheng.
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). ed. / James Aspnes; Othon Michail. 2022. 18.
Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
O'Reach: Even faster reachability in large graphs. / Hanauer, Kathrin; Schulz, Christian; Trummer, Jonathan.
19th International Symposium on Experimental Algorithms, SEA 2021. ed. / David Coudert; Emanuele Natale. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2021. p. 13:1--13:24 13 (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 190).
Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Faster Fully Dynamic Transitive Closure in Practice. / Hanauer, Kathrin; Henzinger, Monika; Schulz, Christian.
18th Symposium on Experimental Algorithms (SEA 2020). 2020.
Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. / Hanauer, Kathrin; Henzinger, Monika; Schulz, Christian.
2020 Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020. ed. / Guy Blelloch; Irene Finocchi. 2020. p. 106-119.
Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Talks
Engineering Dynamic Graph Algorithms for Large-Scale Applications
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
On Dynamic Graph Algorithms, Algorithm Engineering, and Reconfigurable Data Centers
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Practically Efficient Dynamic Algorithms for Data Centers
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Dynamic Graph Algorithms in Theory and Practice
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Engineering Dynamic Graph Algorithms
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Mining Small Patterns in Dynamic Graphs
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
On Engineering Dynamic Graph Algorithms
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Optimal Link Scheduling via Subgraph Coloring
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Fully Dynamic Graph Algorithms in Practice: (Some) Lessons Learned
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Disjoint weighted matchings for reconfigurable optical datacenter technologies
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Recent Advances in Fully Dynamic Graph Algorithms: A Practitioner’s View
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Fully Dynamic Four-Vertex Subgraph Counting
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Even Faster Reachability in Large Graphs
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Faster Fully Dynamic Transitive Closure in Practice
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
Hanauer, K. (Speaker)
Activity: Talks and presentations › Talk or oral contribution › Science to Science
More: Management & Team | Staff directory | Home