activity
20242026
most citedFaster Vertex Cover Algorithms on GPUs with Component-Aware Parallel Branching

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2026

Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery

Hanno von Bergen, Larissa Fastenau, Enna Gerhard +8

We study solution discovery, where the goal is to obtain a feasible solution to a problem from an initial configuration by a bounded sequence of local moves. In many applications,…