Kathrin Hanauer
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
16
Venues
7
Active years
2012–2026
Best venue rank
A*
Where they publish
Papers
16 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ALENEX | New Heuristic and Multivalued Decision Diagram-based Exact Algorithms for Repetition-Free Longest Common Subsequence Problems. | Georg Braun, Kathrin Hanauer, Maximilian Vtsch |
| 2026 | ICS | DistroMatch: Distributed Disjoint Weighted Matchings in Demand-Aware Reconfigurable Optical Datacenters. | Kathrin Hanauer, Sophia Heck, Stefan Schmid |
| 2024 | ALENEX | Covering Rectilinear Polygons with Area-Weighted Rectangles. | Kathrin Hanauer, Martin P. Seybold, Julian Unterweger |
| 2024 | KDD | Expander Hierarchies for Normalized Cuts on Graphs. | Kathrin Hanauer, Monika Henzinger, Robin Mnk, Harald Rcke, Maximilian Vtsch |
| 2023 | INFOCOM | Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. | Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid |
| 2023 | JURIX | Assisted Normative Reasoning with Aristotelian Diagrams. | Kathrin Hanauer, Tereza Novotn, Matteo Pascucci |
| 2022 | INFOCOM | Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. | Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer |
| 2020 | ALENEX | Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. | Kathrin Hanauer, Monika Henzinger, Christian Schulz |
| 2013 | GD | Recognizing Outer 1-Planar Graphs in Linear Time. | Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleiner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber |
| 2013 | GD | Characterizing Planarity by the Splittable Deque. | Christopher Auer, Franz J. Brandenburg, Andreas Gleiner, Kathrin Hanauer |
| 2013 | WG | Rolling Upward Planarity Testing of Strongly Connected Graphs. | Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer |
| 2013 | WG | Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. | Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer |
| 2012 | GD | On Sparse Maximal 2-Planar Graphs. | Christopher Auer, Franz-Josef Brandenburg, Andreas Gleiner, Kathrin Hanauer |
| 2012 | GD | Testing Planarity by Switching Trains. | Christopher Auer, Andreas Gleiner, Kathrin Hanauer, Sebastian Vetter |
| 2012 | GD | On the Density of Maximal 1-Planar Graphs. | Franz-Josef Brandenburg, David Eppstein, Andreas Gleiner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber |
| 2012 | WG | The Duals of Upward Planar Graphs on Cylinders. | Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleiner, Kathrin Hanauer |