4 papers
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…
Block Elimination Distance
Öznur Yaşar Diner, Archontia C. Giannopoulou, Giannos Stamoulis +1
We introduce the block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class , the class ${\cal B}({\cal…
k-apices of minor-closed graph classes. II. Parameterized algorithms
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Let be a minor-closed graph class. We say that a graph is a -apex of if contains a set of at most vertices such that belongs…
Minor-Obstructions for Apex Sub-unicyclic Graphs
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +3
A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph is -apex sub-unicyclic if it can become sub-unicyclic by removing of its vertices. We…