Search Results for author: Kathrin Hanauer

Found 2 papers, 0 papers with code

Improved Exact and Heuristic Algorithms for Maximum Weight Clique

no code implementations1 Feb 2023 Roman Erhardt, Kathrin Hanauer, Nils Kriege, Christian Schulz, Darren Strash

We propose improved exact and heuristic algorithms for solving the maximum weight clique problem, a well-known problem in graph theory with many applications.

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

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