13 citations · 25 across the 15 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2012★ 1 cited
Semi-Strong Coloring of Intersecting Hypergraphs
Eric Blais, Amit Weinstein, Yuichi Yoshida
For any c >= 2, a c-strong coloring of the hypergraph G is an assignment of colors to the vertices of G such that for every edge e of G, the vertices of e are colored by at least m…
math.CO2009★ 13 cited
Longest Common Subsequences in Sets of Permutations
Paul Beame, Eric Blais, Dang-Trinh Huynh-Ngoc
The sequence a_1,...,a_m is a common subsequence in the set of permutations S = {p_1,...,p_k} on [n] if it is a subsequence of p_i(1),...,p_i(n) and p_j(1),...,p_j(n) for some dist…