research
∙
05/09/2023
Random processes for generating task-dependency graphs
We investigate random processes for generating task-dependency graphs of...
share
research
∙
01/04/2023
Online Learning of Smooth Functions
In this paper, we study the online learning of real-valued functions whe...
research
∙
09/03/2022
Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning
We determine sharp bounds on the price of bandit feedback for several va...
research
∙
10/09/2021
Peripherality in networks: theory and applications
We investigate several related measures of peripherality and centrality ...
research
∙
05/30/2021
Sharper bounds for online learning of smooth functions of a single variable
We investigate the generalization of the mistake-bound model to continuo...
research
∙
01/18/2021
A note on the price of bandit feedback for mistake-bounded online learning
The standard model and the bandit model are two generalizations of the m...
research
∙
09/01/2020
Reconfiguration graphs of zero forcing sets
This paper begins the study of reconfiguration of zero forcing sets, and...
research
∙
08/31/2020
Extremal results for graphs of bounded metric dimension
Metric dimension is a graph parameter motivated by problems in robot nav...
research
∙
06/18/2020
The damage throttling number of a graph
The cop throttling number of a graph, introduced in 2018 by Breen et al....
research
∙
05/15/2020
Broadcast Dimension of Graphs
In this paper we initiate the study of broadcast dimension, a variant of...
research
∙
02/13/2020
A generalization of the Kővári-Sós-Turán theorem
We present a new proof of the Kővári-Sós-Turán theorem that ex(n, K_s,t)...
research
∙
12/10/2019
An algorithm for bounding extremal functions of forbidden sequences
Generalized Davenport-Schinzel sequences are sequences that avoid a forb...
research
∙
09/20/2019
Formations and generalized Davenport-Schinzel sequences
An (r, s)-formation is a concatenation of s permutations of r distinct l...
research
∙
06/17/2019
Throttling adversaries on trees
For the cop versus robber game, the throttling number th_c(G) of a graph...
research
∙
03/25/2019
Cop throttling number: Bounds, values, and variants
The cop throttling number th_c(G) of a graph G for the game of Cops and ...
research
∙
02/10/2019
Expected capture time and throttling number for cop versus gambler
We bound expected capture time and throttling number for the cop versus ...
research
∙
12/24/2018
Propagation time for probabilistic zero forcing
Zero forcing is a coloring game played on a graph that was introduced mo...
research
∙
10/16/2018
Constructing sparse Davenport-Schinzel sequences by hypergraph edge coloring
A sequence is called r-sparse if every contiguous subsequence of length ...
research
∙
07/22/2018
Metric dimension and pattern avoidance in graphs
In this paper, we prove a number of results about pattern avoidance in g...
research
∙
05/13/2018
Forbidden formations in 0-1 matrices
Keszegh (2009) proved that the extremal function ex(n, P) of any forbidd...
research
∙
04/01/2018
Fixed points of competitive threshold-linear networks
Threshold-linear networks (TLNs) are models of neural networks that cons...
research
∙
03/15/2018
Forbidden arithmetic progressions in permutations of subsets of the integers
Permutations of the positive integers avoiding arithmetic progressions o...
research
∙
10/31/2017
Variations of the cop and robber game on graphs
We prove new theoretical results about several variations of the cop and...
research
∙
08/21/2017
