Skip to main content

The design and evaluation of modern fully dynamic data structures

Searching for OpenAIRE data...

Publications

Fully Dynamic Four-Vertex Subgraph Counting

Author(s): Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
Published in: 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022
Publisher: SAND 2022

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

Author(s): Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
Published in: IEEE International Conference on Computer Communications, 2022
Publisher: IEEE Communications Societz

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)

Author(s): Kathrin Hanauer, Monika Henzinger, and Christian Schulz
Published in: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022
Publisher: SAND 2022
DOI: 10.4230/lipics.sand.2022.1