Search Results for author: Monika Henzinger

Found 12 papers, 5 papers with code

Constant matters: Fine-grained Complexity of Differentially Private Continual Observation

no code implementations23 Feb 2022 Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay

Our main insight is that the factorization mechanism when using lower-triangular matrices, can be used in the continual observation model.

Recent Advances in Fully Dynamic Graph Algorithms

no code implementations22 Feb 2021 Kathrin Hanauer, Monika Henzinger, Christian Schulz

In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms.

Data Structures and Algorithms

Practical Fully Dynamic Minimum Cut Algorithms

1 code implementation13 Jan 2021 Monika Henzinger, Alexander Noe, Christian Schulz

We present a practically efficient algorithm for maintaining a global minimum cut in large dynamic graphs under both edge insertions and deletions.

Data Structures and Algorithms

Faster Parallel Multiterminal Cuts

1 code implementation24 Apr 2020 Monika Henzinger, Alexander Noe, Christian Schulz

We give an improved branch-and-bound solver for the multiterminal cut problem, based on the recent work of Henzinger et al.. We contribute new, highly effective data reduction rules to transform the graph into a smaller equivalent instance.

Data Structures and Algorithms Combinatorics

Finding All Global Minimum Cuts In Practice

2 code implementations17 Feb 2020 Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash

We present a practically efficient algorithm that finds all global minimum cuts in huge undirected graphs.

Data Structures and Algorithms

Shared-Memory Branch-and-Reduce for Multiterminal Cuts

no code implementations12 Aug 2019 Monika Henzinger, Alexander Noe, Christian Schulz

We introduce the fastest known exact algorithm~for~the multiterminal cut problem with k terminals.

Data Structures and Algorithms Distributed, Parallel, and Cluster Computing

Shared-memory Exact Minimum Cuts

2 code implementations16 Aug 2018 Monika Henzinger, Alexander Noe, Christian Schulz

State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph.

Data Structures and Algorithms

Algorithms and Conditional Lower Bounds for Planning Problems

no code implementations19 Apr 2018 Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, Alexander Svozil

For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs.

Memetic Graph Clustering

no code implementations20 Feb 2018 Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster

It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches.

Graph Clustering

Practical Minimum Cut Algorithms

2 code implementations21 Aug 2017 Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash

The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges.

Data Structures and Algorithms Distributed, Parallel, and Cluster Computing

Capacity Releasing Diffusion for Speed and Locality

no code implementations19 Jun 2017 Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao

Thus, our CRD Process is the first local graph clustering algorithm that is not subject to the well-known quadratic Cheeger barrier.

Graph Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.