25 citations · 109 across the 80 of their papers we have counts for
9 papers · 1 filter
(Re)packing Equal Disks into Rectangle
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a rectangle without ov…
Shortest Cycles With Monotone Submodular Costs
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen +2
We introduce the following submodular generalization of the Shortest Cycle problem. For a nonnegative monotone submodular cost function defined on the edges (or the vertices) o…
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (FOL) with the extra atomic predicate expressing the existence of in…
Exact Exponential Algorithms for Clustering Problems
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
In this paper we initiate a systematic study of exact algorithms for well-known clustering problems, namely -Median and -Means. In -Median, the input consists of a set …
Fixed-Parameter Tractability of Maximum Colored Path and Beyond
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen +2
We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the…
Combing a Linkage in an Annulus
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
A linkage in a graph of size is a subgraph of whose connected components are paths. The pattern of a linkage of size is the set of pairs formed by the e…