1 citations · 1 across the 2 of their papers we have counts for
3 papers
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.DS2023
Tree Containment Above Minimum Degree is FPT
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov +1
According to the classic Chv{á}tal's Lemma from 1977, a graph of minimum degree contains every tree on vertices. Our main result is the following algorithmic "exten…
cs.DS2023★ 1 cited
Turán's Theorem Through Algorithmic Lens
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov +1
The fundamental theorem of Turán from Extremal Graph Theory determines the exact bound on the number of edges in an -vertex graph that does not contain a clique of size…