29 citations · 48 across the 20 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016★ 1 cited
Uniquely restricted matchings and edge colorings
Julien Baste, Dieter Rautenbach, Ignasi Sau
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. This notion was defined by Golumbic, Hirst, and Lewenstein and studied in…
math.CO2016
The number of labeled graphs of bounded treewidth
Julien Baste, Marc Noy, Ignasi Sau
We focus on counting the number of labeled graphs on vertices and treewidth at most (or equivalently, the number of labeled partial -trees), which we denote by …
cs.DS2016
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Julien Baste, Christophe Paul, Ignasi Sau +1
In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species ; these relationships are often depicted via a phylogenetic tree -- a tre…