
Targeted Branching for the Maximum Independent Set Problem
Finding a maximum independent set is a fundamental NPhard problem that ...
read it

Recent Advances in Practical Data Reduction
Over the last two decades, significant advances have been made in the de...
read it

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
Given a vertexweighted graph, the maximum weight independent set proble...
read it

Recent Advances in Scalable Network Generation
Random graph models are frequently used as a controllable and versatile ...
read it

WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track
We present the winning solver of the PACE 2019 Implementation Challenge,...
read it

Engineering Kernelization for Maximum Cut
Kernelization is a general theoretical framework for preprocessing insta...
read it

Exactly Solving the Maximum Weight Independent Set Problem on Large RealWorld Graphs
One powerful technique to solve NPhard optimization problems in practic...
read it

Communicationfree Massively Distributed Graph Generation
Analyzing massive complex networks yields promising insights about our e...
read it

Efficient Random Sampling  Parallel, Vectorized, CacheEfficient, and Online
We consider the problem of sampling n numbers from the range {1,...,N} w...
read it

Finding NearOptimal Independent Sets at Scale
The independent set problem is NPhard and particularly difficult to sol...
read it

Graph Partitioning for Independent Sets
Computing maximum independent sets in graphs is an important problem in ...
read it
Sebastian Lamm
is this you? claim profile