43 citations · 68 across the 7 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.CO2010
On Avoiding Sufficiently Long Abelian Squares
Elyot Grant
A finite word is an abelian square if with a permutation of . In 1972, Entringer, Jackson, and Schatz proved that every binary word of length $k^2…
cs.DS2010★ 43 cited
On Column-restricted and Priority Covering Integer Programs
Deeparnab Chakrabarty, Elyot Grant, Jochen Koenemann
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov…