3 citations · 11 across the 12 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018★ 1 cited
Integrality Gaps for Colorful Matchings
Steven Kelk, Georgios Stamoulis
We study the integrality gap of the natural linear programming relaxation for the \textit{Bounded Color Matching} (BCM) problem. We provide several families of instances and establ…
cs.DM2017★ 1 cited
Treewidth distance on phylogenetic trees
Steven Kelk, Georgios Stamoulis, Taoyang Wu
In this article we study the treewidth of the \emph{display graph}, an auxiliary graph structure obtained from the fusion of phylogenetic (i.e., evolutionary) trees at their leaves…