research
∙
08/29/2022
Finding Near-Optimal Weight Independent Sets at Scale
Computing maximum weight independent sets in graphs is an important NP-h...
share
research
∙
02/02/2021
Targeted Branching for the Maximum Independent Set Problem
Finding a maximum independent set is a fundamental NP-hard problem that ...
research
∙
12/23/2020
Recent Advances in Practical Data Reduction
Over the last two decades, significant advances have been made in the de...
research
∙
08/12/2020
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
Given a vertex-weighted graph, the maximum weight independent set proble...
research
∙
03/02/2020
Recent Advances in Scalable Network Generation
Random graph models are frequently used as a controllable and versatile ...
research
∙
08/19/2019
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track
We present the winning solver of the PACE 2019 Implementation Challenge,...
research
∙
05/26/2019
Engineering Kernelization for Maximum Cut
Kernelization is a general theoretical framework for preprocessing insta...
research
∙
10/25/2018
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
One powerful technique to solve NP-hard optimization problems in practic...
research
∙
10/20/2017
Communication-free Massively Distributed Graph Generation
Analyzing massive complex networks yields promising insights about our e...
research
∙
10/17/2016
Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online
We consider the problem of sampling n numbers from the range {1,...,N} w...
research
∙
09/02/2015
Finding Near-Optimal Independent Sets at Scale
The independent set problem is NP-hard and particularly difficult to sol...
research
∙
02/05/2015
