1 citations · 2 across the 11 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Discounted Cuts: A Stackelberg Approach to Network Disruption
Pål Grønås Drange, Fedor V. Fomin, Petr Golovach +1
We study a Stackelberg variant of the classical Most Vital Links problem, modeled as a one-round adversarial game between an attacker and a defender. The attacker strategically rem…
cs.DS2025
Edge Clique Partition and Cover Beyond Independence
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov +1
Covering and partitioning the edges of a graph into cliques are classical problems at the intersection of combinatorial optimization and graph theory, having been studied through a…