research
∙
03/28/2022
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems
Motivated by a real-world vehicle routing application, we consider the m...
share
research
∙
08/10/2021
Algorithm Engineering for Cut Problems
Graphs are a natural representation of data from various contexts, such ...
research
∙
08/10/2021
Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice?
Fully dynamic graph algorithms that achieve polylogarithmic or better ti...
research
∙
05/26/2021
New instances for maximum weight independent set from a vehicle routing application
We present a set of new instances of the maximum weight independent set ...
research
∙
01/13/2021
Practical Fully Dynamic Minimum Cut Algorithms
We present a practically efficient algorithm for maintaining a global mi...
research
∙
12/23/2020
Recent Advances in Practical Data Reduction
Over the last two decades, significant advances have been made in the de...
research
∙
04/24/2020
Faster Parallel Multiterminal Cuts
We give an improved branch-and-bound solver for the multiterminal cut pr...
research
∙
02/17/2020
Finding All Global Minimum Cuts In Practice
We present a practically efficient algorithm that finds all global minim...
research
∙
08/12/2019
Shared-Memory Branch-and-Reduce for Multiterminal Cuts
We introduce the fastest known exact algorithm for the multiterminal cut...
research
∙
08/16/2018
Shared-memory Exact Minimum Cuts
The minimum cut problem for an undirected edge-weighted graph asks us to...
research
∙
02/20/2018
