The burning number of a graph G is the smallest number b such that the
v...
We introduce stronger notions for approximate single-source shortest-pat...
A query game is a pair of a set Q of queries and a set ℱ of
functions, o...
Since the 60's Mastermind has been studied for the combinatorial and
inf...
Consider the following simple coloring algorithm for a graph on n vertic...
We consider a search problem on a 2-dimensional infinite grid with a sin...
One of the central goals of Recurrent Neural Networks (RNNs) is to learn...
A classical multi-agent fence patrolling problem asks: What is the maxim...
Hillclimbing is an essential part of any optimization algorithm. An impo...
In 2000 Allen Schwenk, using a well-known mathematical model of matchpla...
We study the entanglement game, which is a version of cops and robbers, ...