In this paper, we broaden the understanding of the recently introduced
c...
We introduce two new classes of covering codes in graphs for every posit...
We give essentially tight bounds for, ν(d,k), the maximum number of
dist...
In the paper, the Levenshtein's sequence reconstruction problem is consi...
We introduce the Red-Blue Separation problem on graphs, where we are giv...