On Sparse Maximal 2-Planar Graphs. - Christopher Auer; Franz-Josef Brandenburg; Andreas Gleißner; Kathrin Hanauer (GD, 2012)

Testing Planarity by Switching Trains. - Christopher Auer; Andreas Gleißner; Kathrin Hanauer; Sebastian Vetter (GD, 2012)

On the Density of Maximal 1-Planar Graphs. - Franz-Josef Brandenburg; David Eppstein; Andreas Gleißner; Michael T. Goodrich; Kathrin Hanauer; Josef Reislhuber (GD, 2012)

The Duals of Upward Planar Graphs on Cylinders. - Christopher Auer; Christian Bachmaier; Franz-Josef Brandenburg; Andreas Gleißner; Kathrin Hanauer (WG, 2012)

Recognizing Outer 1-Planar Graphs in Linear Time. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (GD, 2013)

Characterizing Planarity by the Splittable Deque. - Christopher Auer; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer (GD, 2013)

Rolling Upward Planarity Testing of Strongly Connected Graphs. - Christopher Auer; Christian Bachmaier; Franz-Josef Brandenburg; Kathrin Hanauer (WG, 2013)

Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. - Kathrin Hanauer; Franz-Josef Brandenburg; Christopher Auer (WG, 2013)

Upward planar graphs and their duals. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer (Theor. Comput. Sci., 2015)

Outer 1-Planar Graphs. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Algorithmica, 2016)

A Note on IC-Planar Graphs. - Christian Bachmaier; Franz J. Brandenburg; Kathrin Hanauer (CoRR, 2017)

NIC-planar graphs. - Christian Bachmaier; Franz J. Brandenburg; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Discret. Appl. Math., 2017)

Linear Orderings of Sparse Graphs - Kathrin Hanauer (2018)

Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (ALENEX, 2020)

Faster Fully Dynamic Transitive Closure in Practice. - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (SEA, 2020)

Faster Reachability in Static Graphs. - Kathrin Hanauer; Christian Schulz 003; Jonathan Trummer (CoRR, 2020)

O'Reach: Even Faster Reachability in Large Graphs. - Kathrin Hanauer; Christian Schulz 003; Jonathan Trummer (SEA, 2021)

Correction to: Outer 1-Planar Graphs. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Algorithmica, 2021)

Recent Advances in Fully Dynamic Graph Algorithms. - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (CoRR, 2021)

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. - Kathrin Hanauer; Monika Henzinger; Stefan Schmid 001; Jonathan Trummer (INFOCOM, 2022)

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (SAND, 2022)

Fully Dynamic Four-Vertex Subgraph Counting. - Kathrin Hanauer; Monika Henzinger; Qi Cheng Hua (SAND, 2022)

Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (ACM J. Exp. Algorithmics, 2022)

DJ-Match/DJ-Match: Version 1.0.0. - Kathrin Hanauer; Monika Henzinger; Stefan Schmid 001; Jonathan Trummer (Zenodo, 2022)

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. - Kathrin Hanauer; Monika Henzinger; Lara Ost; Stefan Schmid 001 (INFOCOM, 2023)

Assisted Normative Reasoning with Aristotelian Diagrams. - Kathrin Hanauer; Tereza Novotná; Matteo Pascucci (JURIX, 2023)

Improved Exact and Heuristic Algorithms for Maximum Weight Clique. - Roman Erhardt; Kathrin Hanauer; Nils M. Kriege; Christian Schulz 003; Darren Strash (CoRR, 2023)

Covering Rectilinear Polygons with Area-Weighted Rectangles. - Kathrin Hanauer; Martin P. Seybold; Julian Unterweger (ALENEX, 2024)

Expander Hierarchies for Normalized Cuts on Graphs. - Kathrin Hanauer; Monika Henzinger; Robin Münk; Harald Räcke; Maximilian Vötsch (KDD, 2024)

Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201). - Kathrin Hanauer; Uwe Naumann; Alex Pothen; Robert Schreiber (Dagstuhl Reports, 2024)

XCut/XCut v1.0.0. - Kathrin Hanauer; Monika Henzinger; Robin Münk; Harald Räcke; Maximilian Vötsch (Zenodo, 2024)

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. - Antoine El-Hayek; Kathrin Hanauer; Monika Henzinger (SAND, 2025)