Kathrin Hanauer

According to our database, Kathrin Hanauer authored at least 31 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201).

Kathrin Hanauer, Uwe Naumann, Alex Pothen, Robert Schreiber

Dagstuhl Reports, 2024

Expander Hierarchies for Normalized Cuts on Graphs.

Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Covering Rectilinear Polygons with Area-Weighted Rectangles.

Kathrin Hanauer, Martin P. Seybold, Julian Unterweger

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.

Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger

CoRR, 2023

Improved Exact and Heuristic Algorithms for Maximum Weight Clique.

Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz, Darren Strash

CoRR, 2023

Assisted Normative Reasoning with Aristotelian Diagrams.

Kathrin Hanauer, Tereza Novotná, Matteo Pascucci

Proceedings of the Legal Knowledge and Information Systems, 2023

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters.

Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid

Proceedings of the IEEE INFOCOM 2023, 2023

2022

DJ-Match/DJ-Match: Version 1.0.0.

Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer

Dataset, January, 2022

O'Reach: Even Faster Reachability in Large Graphs.

Kathrin Hanauer, Christian Schulz, Jonathan Trummer

ACM J. Exp. Algorithmics, 2022

Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide.

Kathrin Hanauer, Monika Henzinger, Christian Schulz

ACM J. Exp. Algorithmics, 2022

Fully Dynamic Four-Vertex Subgraph Counting.

Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk).

Kathrin Hanauer, Monika Henzinger, Christian Schulz

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies.

Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer

Proceedings of the IEEE INFOCOM 2022, 2022

2021

Recent Advances in Fully Dynamic Graph Algorithms.

Kathrin Hanauer, Monika Henzinger, Christian Schulz

CoRR, 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

2020

Faster Reachability in Static Graphs.

Kathrin Hanauer, Christian Schulz, Jonathan Trummer

CoRR, 2020

Faster Fully Dynamic Transitive Closure in Practice.

Kathrin Hanauer, Monika Henzinger, Christian Schulz

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.

Kathrin Hanauer, Monika Henzinger, Christian Schulz

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2018

Linear Orderings of Sparse Graphs

Kathrin Hanauer

PhD thesis, 2018

2017

NIC-planar graphs.

Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Discret. Appl. Math., 2017

A Note on IC-Planar Graphs.

Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer

CoRR, 2017

2016

Outer 1-Planar Graphs.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Algorithmica, 2016

2015

Upward planar graphs and their duals.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer

Theor. Comput. Sci., 2015

2013

Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs.

Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Rolling Upward Planarity Testing of Strongly Connected Graphs.

Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Characterizing Planarity by the Splittable Deque.

Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Recognizing Outer 1-Planar Graphs in Linear Time.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

The Duals of Upward Planar Graphs on Cylinders.

Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

On the Density of Maximal 1-Planar Graphs.

Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Testing Planarity by Switching Trains.

Christopher Auer, Andreas Gleißner, Kathrin Hanauer, Sebastian Vetter

Proceedings of the Graph Drawing - 20th International Symposium, 2012

On Sparse Maximal 2-Planar Graphs.

Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer

Proceedings of the Graph Drawing - 20th International Symposium, 2012