4 citations · 4 across the 6 of their papers we have counts for
4 papers · 1 filter
Some Results on Superpatterns for Preferential Arrangements
Yonah Biers-Ariel, Yiguang Zhang, Anant Godbole
A {\it superpattern} is a string of characters of length that contains as a subsequence, and in a sense that depends on the context, all the smaller strings of length in a…
Best and worst case permutations for random online domination of the path
Christopher Coscia, Jonathan DeWitt, Fan Yang +1
We study a randomized algorithm for graph domination, by which, according to a uniformly chosen permutation, vertices are revealed and added to the dominating set if not already do…
The Total Acquisition Number of the Randomly Weighted Path
Anant Godbole, Elizabeth Kelley, Emily Kurtz +2
There exists a significant body of work on determining the acquisition number of various graphs when the vertices of those graphs are each initially assigned a unit weight…
The Number of Seymour Vertices in Random Tournaments and Digraphs
Zachary Cohn, Anant Godbole, Elizabeth Wright Harkness +1
Seymour's distance two conjecture states that in any digraph there exists a vertex (a "Seymour vertex") that has at least as many neighbors at distance two as it does at distance o…