13 citations · 36 across the 16 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015★ 13 cited
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
L. Alcón, F. Bonomo, G. Durán +4
Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate…
q-bio.PE2015
Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples
Ademir Hujdurović, Urša Kačar, Martin Milanič +2
Recently, Hajirasouliha and Raphael (WABI 2014) proposed a model for deconvoluting mixed tumor samples measured from a collection of high-throughput sequencing reads. This is relat…
cs.DM2015
Dominating induced matchings in graphs containing no long claw
Alain Hertz, Vadim Lozin, Bernard Ries +2
An induced matching in a graph is dominating if every edge not in shares exactly one vertex with an edge in . The dominating induced matching problem (also known as…