43 citations · 68 across the 7 of their papers we have counts for
7 papers
Self-Approaching Graphs
Soroush Alamdari, Timothy M. Chan, Elyot Grant +2
In this paper we introduce self-approaching graph drawings. A straight-line drawing of a graph is self-approaching if, for any origin vertex s and any destination vertex t, there i…
A Geometric Approach to Combinatorial Fixed-Point Theorems
Elyot Grant, Will Ma
We develop a geometric framework that unifies several different combinatorial fixed-point theorems related to Tucker's lemma and Sperner's lemma, showing them to be different geome…
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…
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…
Closures in Formal Languages: Concatenation, Separation, and Algorithms
J. Brzozowski, E. Grant, J. Shallit
We continue our study of open and closed languages. We investigate how the properties of being open and closed are preserved under concatenation. We investigate analogues, in forma…
Closures in Formal Languages and Kuratowski's Theorem
J. Brzozowski, E. Grant, J. Shallit
A famous theorem of Kuratowski states that in a topological space, at most 14 distinct sets can be produced by repeatedly applying the operations of closure and complement to a giv…