Kathrin Hanauer

42 papers A* 3A 9B 5C 1Journal 20Unranked 3
YearRankTypeTitle / Venue / Authors
2026 A conf
New Heuristic and Multivalued Decision Diagram-based Exact Algorithms for Repetition-Free Longest Common Subsequence Problems.
ALENEX
Georg Braun, Kathrin Hanauer, Maximilian Vötsch
2025 — conf
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.
SAND
Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger
2025 A ed.
Proceedings of the 27th Symposium on Algorithm Engineering and Experiments, ALENEX 2025, New Orleans, LA, USA, January 12-13, 2025
ALENEX
Rezaul Chowdhury, Jonathan W. Berry, Kathrin Hanauer, Bin Ren
2024 A conf
Covering Rectilinear Polygons with Area-Weighted Rectangles.
ALENEX
Kathrin Hanauer, Martin P. Seybold, Julian Unterweger
2024 J jnl
Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201).
Dagstuhl Reports
Kathrin Hanauer, Uwe Naumann, Alex Pothen, Robert Schreiber
2024 A* conf
Expander Hierarchies for Normalized Cuts on Graphs.
KDD
Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
2024 J jnl
Expander Hierarchies for Normalized Cuts on Graphs.
CoRR
Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
2023 C conf
Assisted Normative Reasoning with Aristotelian Diagrams.
JURIX
Kathrin Hanauer, Tereza Novotná, Matteo Pascucci
2023 J jnl
Covering Rectilinear Polygons with Area-Weighted Rectangles.
CoRR
Kathrin Hanauer, Martin P. Seybold, Julian Unterweger
2023 A* conf
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters.
INFOCOM
Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
2023 J jnl
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters.
CoRR
Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
2023 J jnl
Improved Exact and Heuristic Algorithms for Maximum Weight Clique.
CoRR
Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz, Darren Strash
2023 J jnl
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.
CoRR
Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger
2022 A* conf
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies.
INFOCOM
Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
2022 J jnl
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies.
CoRR
Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
2022 — conf
Fully Dynamic Four-Vertex Subgraph Counting.
SAND
Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
2022 J jnl
O'Reach: Even Faster Reachability in Large Graphs.
ACM J. Exp. Algorithmics
Kathrin Hanauer, Christian Schulz, Jonathan Trummer
2022 — conf
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk).
SAND
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2022 J jnl
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide.
ACM J. Exp. Algorithmics
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2021 J jnl
Correction to: Outer 1-Planar Graphs.
Algorithmica
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
2021 J jnl
Fully Dynamic Four-Vertex Subgraph Counting.
CoRR
Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
2021 B conf
O'Reach: Even Faster Reachability in Large Graphs.
SEA
Kathrin Hanauer, Christian Schulz, Jonathan Trummer
2021 J jnl
Recent Advances in Fully Dynamic Graph Algorithms.
CoRR
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2020 B conf
Faster Fully Dynamic Transitive Closure in Practice.
SEA
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2020 J jnl
Faster Fully Dynamic Transitive Closure in Practice.
CoRR
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2020 J jnl
Faster Reachability in Static Graphs.
CoRR
Kathrin Hanauer, Christian Schulz, Jonathan Trummer
2020 A conf
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.
ALENEX
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2019 J jnl
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.
CoRR
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2018 — —
Linear Orderings of Sparse Graphs
Kathrin Hanauer
2017 J jnl
A Note on IC-Planar Graphs.
CoRR
Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer
2017 J jnl
NIC-Planar Graphs.
CoRR
Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
2017 J jnl
NIC-planar graphs.
Discret. Appl. Math.
Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
2016 J jnl
Outer 1-Planar Graphs.
Algorithmica
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
2015 J jnl
Upward planar graphs and their duals.
Theor. Comput. Sci.
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer
2013 A conf
Characterizing Planarity by the Splittable Deque.
GD
Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer
2013 A conf
Recognizing Outer 1-Planar Graphs in Linear Time.
GD
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
2013 B conf
Rolling Upward Planarity Testing of Strongly Connected Graphs.
WG
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer
2013 B conf
Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs.
WG
Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer
2012 A conf
On Sparse Maximal 2-Planar Graphs.
GD
Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer
2012 A conf
On the Density of Maximal 1-Planar Graphs.
GD
Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber
2012 A conf
Testing Planarity by Switching Trains.
GD
Christopher Auer, Andreas Gleißner, Kathrin Hanauer, Sebastian Vetter
2012 B conf
The Duals of Upward Planar Graphs on Cylinders.
WG
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer