3 citations · 5 across the 3 of their papers we have counts for
4 papers
Relaxed Agreement Forests
Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk +3
There are multiple factors which can cause the phylogenetic inference process to produce two or more conflicting hypotheses of the evolutionary history of a set X of biological ent…
PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions
Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey +1
We consider the problem of allocating a set of indivisible resources (items) to a set of customers (players) competing for the resources. Each resource ha…
On unrooted and root-uncertain variants of several well-known phylogenetic network problems
Leo van Iersel, Steven Kelk, Georgios Stamoulis +2
The hybridization number problem requires us to embed a set of binary rooted phylogenetic trees into a binary rooted phylogenetic network such that the number of nodes with indegre…
A 0.821-ratio purely combinatorial algorithm for maximum -vertex cover in bipartite graphs
Edouard Bonnet, Bruno Escoffier, Vangelis Paschos +1
Our goal in this paper is to propose a \textit{combinatorial algorithm} that beats the only such algorithm known previously, the greedy one. We study the polynomial approximation o…