We investigate random processes for generating task-dependency graphs of...
In this paper, we study the online learning of real-valued functions whe...
We determine sharp bounds on the price of bandit feedback for several
va...
We investigate several related measures of peripherality and centrality ...
We investigate the generalization of the mistake-bound model to continuo...
The standard model and the bandit model are two generalizations of the
m...
This paper begins the study of reconfiguration of zero forcing sets, and...
Metric dimension is a graph parameter motivated by problems in robot
nav...
The cop throttling number of a graph, introduced in 2018 by Breen et al....
In this paper we initiate the study of broadcast dimension, a variant of...
We present a new proof of the Kővári-Sós-Turán theorem that
ex(n, K_s,t)...
Generalized Davenport-Schinzel sequences are sequences that avoid a forb...
An (r, s)-formation is a concatenation of s permutations of r distinct
l...
For the cop versus robber game, the throttling number th_c(G) of a graph...
The cop throttling number th_c(G) of a graph G for the game of Cops and
...
We bound expected capture time and throttling number for the cop versus
...
Zero forcing is a coloring game played on a graph that was introduced mo...
A sequence is called r-sparse if every contiguous subsequence of length ...
In this paper, we prove a number of results about pattern avoidance in g...
Keszegh (2009) proved that the extremal function ex(n, P) of any forbidd...
Threshold-linear networks (TLNs) are models of neural networks that cons...
Permutations of the positive integers avoiding arithmetic progressions o...
We prove new theoretical results about several variations of the cop and...
In arXiv:1607.06679, Marcus proved that certain functions of multiple
ma...