Ass.-Prof. Dr. Kathrin Hanauer, B.Sc. M.SC.
1090 Wien
Room : 6.31
Courses
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
Summer term 2025
-
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
-
500500 SE Doctoral Research Seminar - Algorithms and Computing
Publications
New Heuristic and Multivalued Decision Diagram-based Exact Algorithms for Repetition-Free Longest Common Subsequence Problems. / Braun, Georg; Hanauer, Kathrin; Vötsch, Maximilian.
SIAM Symposium on Algorithm Engineering and Experiments (ALENEX26). 2026.
Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
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
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
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
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
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
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
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
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
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