1 citations · 1 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
Narmina Baghirova, Esther Galby, Martin Milanič
In this paper, we present new efficiently solvable cases of the Minimum Uncovering Branching problem, an optimization problem with applications in cancer genomics introduced by Huj…
cs.DM2022
Locally checkable problems parameterized by clique-width
Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries +1
We continue the study initiated by Bonomo-Braberman and Gonzalez in 2020 on -locally checkable problems. We propose a dynamic programming algorithm that takes as input a graph w…