Kathrin Hanauer

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Covering rectilinear polygons with area-weighted rectangles	2024-05-29	Paper
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide ACM Journal of Experimental Algorithmics	2024-04-14	Paper
O’Reach: Even Faster Reachability in Large Graphs ACM Journal of Experimental Algorithmics	2024-04-14	Paper
O'Reach: Even Faster Reachability in Large Graphs (available as arXiv preprint)	2023-06-23	Paper
Faster fully dynamic transitive closure in practice	2023-02-07	Paper
Correction to: ``Outer 1-planar graphs Algorithmica	2021-11-19	Paper
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX)	2021-01-27	Paper
\(\mathsf{NIC}\)-planar graphs Discrete Applied Mathematics	2017-10-17	Paper
Outer 1-planar graphs Algorithmica	2016-05-31	Paper
Upward planar graphs and their duals Theoretical Computer Science	2015-01-30	Paper
Recognizing outer 1-planar graphs in linear time Graph Drawing	2013-12-20	Paper
Characterizing planarity by the splittable deque Graph Drawing	2013-12-20	Paper
Tight upper bounds for minimum feedback arc sets of regular graphs Graph-Theoretic Concepts in Computer Science	2013-12-06	Paper
Rolling upward planarity testing of strongly connected graphs Graph-Theoretic Concepts in Computer Science	2013-12-06	Paper
On the density of maximal 1-planar graphs Graph Drawing	2013-04-03	Paper
The Duals of Upward Planar Graphs on Cylinders Graph-Theoretic Concepts in Computer Science	2012-11-06	Paper

Research outcomes over time

This page was built for person: Kathrin Hanauer