Kathrin Hanauer

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 29

Top Topics

Transitive Closure

Approximate Inference

Recent Advances

Top Venues

ACM J. Exp. Algorithmics

Publications

Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
Expander Hierarchies for Normalized Cuts on Graphs. KDD (2024)
Kathrin Hanauer, Martin P. Seybold, Julian Unterweger
Covering Rectilinear Polygons with Area-Weighted Rectangles. ALENEX (2024)
Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
Expander Hierarchies for Normalized Cuts on Graphs. CoRR (2024)
Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz, Darren Strash
Improved Exact and Heuristic Algorithms for Maximum Weight Clique. CoRR (2023)
Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. CoRR (2023)
Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. INFOCOM (2023)
Kathrin Hanauer, Tereza Novotná, Matteo Pascucci
Assisted Normative Reasoning with Aristotelian Diagrams. JURIX (2023)
Kathrin Hanauer, Martin P. Seybold, Julian Unterweger
Covering Rectilinear Polygons with Area-Weighted Rectangles. CoRR (2023)
Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. CoRR (2023)
Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. INFOCOM (2022)
Kathrin Hanauer, Christian Schulz, Jonathan Trummer
O'Reach: Even Faster Reachability in Large Graphs. ACM J. Exp. Algorithmics 27 (2022)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). SAND (2022)
Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. CoRR (2022)
Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
Fully Dynamic Four-Vertex Subgraph Counting. SAND (2022)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. ACM J. Exp. Algorithmics 27 (2022)
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
Correction to: Outer 1-Planar Graphs. Algorithmica 83 (11) (2021)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Recent Advances in Fully Dynamic Graph Algorithms. CoRR (2021)
Kathrin Hanauer, Christian Schulz, Jonathan Trummer
O'Reach: Even Faster Reachability in Large Graphs. SEA (2021)
Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
Fully Dynamic Four-Vertex Subgraph Counting. CoRR (2021)
Kathrin Hanauer, Christian Schulz, Jonathan Trummer
Faster Reachability in Static Graphs. CoRR (2020)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. ALENEX (2020)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Faster Fully Dynamic Transitive Closure in Practice. CoRR (2020)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Faster Fully Dynamic Transitive Closure in Practice. SEA (2020)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. CoRR (2019)
Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
NIC-planar graphs. Discret. Appl. Math. 232 (2017)
Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
NIC-Planar Graphs. CoRR (2017)
Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer
A Note on IC-Planar Graphs. CoRR (2017)
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
Outer 1-Planar Graphs. Algorithmica 74 (4) (2016)
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer
Upward planar graphs and their duals. Theor. Comput. Sci. 571 (2015)
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer
Rolling Upward Planarity Testing of Strongly Connected Graphs. WG (2013)
Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer
Characterizing Planarity by the Splittable Deque. Graph Drawing (2013)
Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer
Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. WG (2013)
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
Recognizing Outer 1-Planar Graphs in Linear Time. Graph Drawing (2013)
Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber
On the Density of Maximal 1-Planar Graphs. Graph Drawing (2012)
Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer
On Sparse Maximal 2-Planar Graphs. Graph Drawing (2012)
Christopher Auer, Andreas Gleißner, Kathrin Hanauer, Sebastian Vetter
Testing Planarity by Switching Trains. Graph Drawing (2012)
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer
The Duals of Upward Planar Graphs on Cylinders. WG (2012)