![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Kathrin Hanauer
Person information
- affiliation: University of Vienna, Austria
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Kathrin Hanauer, Martin P. Seybold
, Julian Unterweger:
Covering Rectilinear Polygons with Area-Weighted Rectangles. ALENEX 2024: 157-169 - [c17]Kathrin Hanauer
, Monika Henzinger
, Robin Münk
, Harald Räcke
, Maximilian Vötsch
:
Expander Hierarchies for Normalized Cuts on Graphs. KDD 2024: 1016-1027 - [i13]Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch:
Expander Hierarchies for Normalized Cuts on Graphs. CoRR abs/2406.14111 (2024) - 2023
- [c16]Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
:
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. INFOCOM 2023: 1-10 - [c15]Kathrin Hanauer
, Tereza Novotná
, Matteo Pascucci
:
Assisted Normative Reasoning with Aristotelian Diagrams. JURIX 2023: 89-94 - [i12]Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
:
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. CoRR abs/2301.05751 (2023) - [i11]Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz, Darren Strash:
Improved Exact and Heuristic Algorithms for Maximum Weight Clique. CoRR abs/2302.00458 (2023) - [i10]Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger:
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. CoRR abs/2310.01149 (2023) - [i9]Kathrin Hanauer, Martin P. Seybold, Julian Unterweger:
Covering Rectilinear Polygons with Area-Weighted Rectangles. CoRR abs/2312.08540 (2023) - 2022
- [j6]Kathrin Hanauer
, Monika Henzinger
, Christian Schulz
:
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. ACM J. Exp. Algorithmics 27: 1.11:1-1.11:45 (2022) - [j5]Kathrin Hanauer
, Christian Schulz
, Jonathan Trummer
:
O'Reach: Even Faster Reachability in Large Graphs. ACM J. Exp. Algorithmics 27: 4.2:1-4.2:27 (2022) - [c14]Kathrin Hanauer, Monika Henzinger, Stefan Schmid
, Jonathan Trummer:
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. INFOCOM 2022: 1649-1658 - [c13]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). SAND 2022: 1:1-1:47 - [c12]Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua:
Fully Dynamic Four-Vertex Subgraph Counting. SAND 2022: 18:1-18:17 - [d1]Kathrin Hanauer
, Monika Henzinger
, Stefan Schmid
, Jonathan Trummer
:
DJ-Match/DJ-Match: Version 1.0.0. Zenodo, 2022 - [i8]Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer:
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. CoRR abs/2201.06621 (2022) - 2021
- [j4]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Correction to: Outer 1-Planar Graphs. Algorithmica 83(11): 3534-3535 (2021) - [c11]Kathrin Hanauer, Christian Schulz, Jonathan Trummer:
O'Reach: Even Faster Reachability in Large Graphs. SEA 2021: 13:1-13:24 - [i7]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms. CoRR abs/2102.11169 (2021) - [i6]Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua:
Fully Dynamic Four-Vertex Subgraph Counting. CoRR abs/2106.15524 (2021) - 2020
- [c10]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. ALENEX 2020: 106-119 - [c9]Kathrin Hanauer
, Monika Henzinger
, Christian Schulz
:
Faster Fully Dynamic Transitive Closure in Practice. SEA 2020: 14:1-14:14 - [i5]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. CoRR abs/2002.00813 (2020) - [i4]Kathrin Hanauer, Christian Schulz, Jonathan Trummer
:
Faster Reachability in Static Graphs. CoRR abs/2008.10932 (2020)
2010 – 2019
- 2019
- [i3]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. CoRR abs/1905.01216 (2019) - 2018
- [b1]Kathrin Hanauer:
Linear Orderings of Sparse Graphs. Passau University, Germany, 2018 - 2017
- [j3]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-planar graphs. Discret. Appl. Math. 232: 23-40 (2017) - [i2]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-Planar Graphs. CoRR abs/1701.04375 (2017) - [i1]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer:
A Note on IC-Planar Graphs. CoRR abs/1707.08652 (2017) - 2016
- [j2]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner
, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Outer 1-Planar Graphs. Algorithmica 74(4): 1293-1320 (2016) - 2015
- [j1]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner
, Kathrin Hanauer:
Upward planar graphs and their duals. Theor. Comput. Sci. 571: 36-49 (2015) - 2013
- [c8]Christopher Auer, Franz J. Brandenburg, Andreas Gleißner
, Kathrin Hanauer:
Characterizing Planarity by the Splittable Deque. GD 2013: 25-36 - [c7]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner
, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Recognizing Outer 1-Planar Graphs in Linear Time. GD 2013: 107-118 - [c6]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer:
Rolling Upward Planarity Testing of Strongly Connected Graphs. WG 2013: 38-49 - [c5]Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer:
Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. WG 2013: 298-309 - 2012
- [c4]Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner
, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber:
On the Density of Maximal 1-Planar Graphs. GD 2012: 327-338 - [c3]Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner
, Kathrin Hanauer:
On Sparse Maximal 2-Planar Graphs. GD 2012: 555-556 - [c2]Christopher Auer, Andreas Gleißner
, Kathrin Hanauer, Sebastian Vetter:
Testing Planarity by Switching Trains. GD 2012: 557-558 - [c1]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner
, Kathrin Hanauer:
The Duals of Upward Planar Graphs on Cylinders. WG 2012: 103-113
Coauthor Index
aka: Franz J. Brandenburg
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint