1 citations · 2 across the 20 of their papers we have counts for
22 papers · 1 filter
Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm
Fedor V. Fomin, Petr A. Golovach, Yash Hiren More
In the Ultrametric Violation Distance problem, we are given a set of distances between points, and the goal is to modify the minimum number of distances so that the resulting s…
An FPT Algorithm for Diverse Minimum s-t Cuts
Krishnan Dehaleesan, Pål Grønås Drange, Fedor V. Fomin +2
We study the problem of finding a family of diverse minimum edge s-t cuts in a directed weighted graph G. Given integers k and d, the task is to decide whether G contains k minimum…
Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
Tian Bai, Fedor V. Fomin, Petr A. Golovach +2
Rank aggregation seeks a representative permutation for a collection of rankings and plays a central role in areas such as social choice, information retrieval, and computational b…
A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
Many problems are known to be solvable in subexponential parameterized time when the input graph is planar. The bidimensionality framework of Demaine, Fomin, Hajiaghay, and Thiliko…
Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan +1
In the d-Euclidean Distance Matrix Completion (d-EDMC) problem, one aims to determine whether a given partial matrix of pairwise distances can be extended to a full Euclidean dista…
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…