Follow
Kathrin Hanauer
Title
Cited by
Cited by
Year
On the density of maximal 1-planar graphs
FJ Brandenburg, D Eppstein, A Gleißner, MT Goodrich, K Hanauer, ...
International Symposium on Graph Drawing, 327-338, 2012
822012
Outer 1-planar graphs
C Auer, C Bachmaier, FJ Brandenburg, A Gleißner, K Hanauer, ...
Algorithmica 74, 1293-1320, 2016
602016
NIC-planar graphs
C Bachmaier, FJ Brandenburg, K Hanauer, D Neuwirth, J Reislhuber
Discrete Applied Mathematics 232, 23-40, 2017
362017
Recent advances in fully dynamic graph algorithms–a quick reference guide
K Hanauer, M Henzinger, C Schulz
ACM Journal of Experimental Algorithmics 27, 1-45, 2022
292022
Recognizing outer 1-planar graphs in linear time
C Auer, C Bachmaier, FJ Brandenburg, A Gleißner, K Hanauer, ...
International Symposium on Graph Drawing, 107-118, 2013
262013
On sparse maximal 2-planar graphs
C Auer, FJ Brandenburg, A Gleißner, K Hanauer
Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013
242013
Recent advances in fully dynamic graph algorithms
K Hanauer, M Henzinger, C Schulz
arXiv preprint arXiv:2102.11169, 2021
202021
Sorting heuristics for the feedback arc set problem
FJ Brandenburg, K Hanauer
Technical report, Technical Report MIP-1104, 2011
162011
Faster Fully Dynamic Transitive Closure in Practice
K Hanauer, M Henzinger, C Schulz
arXiv preprint arXiv:2002.00813, 2020
152020
Fully Dynamic Four-Vertex Subgraph Counting
K Hanauer, M Henzinger, QC Hua
arXiv preprint arXiv:2106.15524, 2021
112021
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
K Hanauer, M Henzinger, C Schulz
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and …, 2020
112020
Fast and heavy disjoint weighted matchings for demand-aware datacenter topologies
K Hanauer, M Henzinger, S Schmid, J Trummer
IEEE INFOCOM 2022-IEEE Conference on Computer Communications, 1649-1658, 2022
92022
The duals of upward planar graphs on cylinders
C Auer, C Bachmaier, FJ Brandenburg, A Gleißner, K Hanauer
International Workshop on Graph-Theoretic Concepts in Computer Science, 103-113, 2012
72012
O’Reach: Even Faster Reachability in Large Graphs
K Hanauer, C Schulz, J Trummer
ACM Journal of Experimental Algorithmics 27, 1-27, 2022
52022
Dynamic demand-aware link scheduling for reconfigurable datacenters
K Hanauer, M Henzinger, L Ost, S Schmid
IEEE INFOCOM 2023-IEEE Conference on Computer Communications, 1-10, 2023
32023
Linear orderings of sparse graphs
K Hanauer
Universität Passau, 2018
32018
Upward planar graphs and their duals
C Auer, C Bachmaier, FJ Brandenburg, A Gleißner, K Hanauer
Theoretical Computer Science 571, 36-49, 2015
32015
Rolling upward planarity testing of strongly connected graphs
C Auer, C Bachmaier, FJ Brandenburg, K Hanauer
International Workshop on Graph-Theoretic Concepts in Computer Science, 38-49, 2013
32013
Testing planarity by switching trains
C Auer, A Gleißner, K Hanauer, S Vetter
Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013
32013
Characterizing planarity by the splittable deque
C Auer, FJ Brandenburg, A Gleißner, K Hanauer
International Symposium on Graph Drawing, 25-36, 2013
22013
The system can't perform the operation now. Try again later.
Articles 1–20