9 citations · 15 across the 14 of their papers we have counts for
19 papers
On the Multi-Robber Damage Number
Miloš Stojaković, Lasse Wulf
We study a variant of the Cops and Robbers game on graphs in which the robbers damage the visited vertices, aiming to maximize the number of damaged vertices. For that game with on…
The Toucher-Isolator game
Chris Dowden, Mihyun Kang, Mirjana Mikalački +1
We introduce a new positional game called `Toucher-Isolator', which is a quantitative version of a Maker-Breaker type game. The playing board is the set of edges of a given graph G…
Semi-random graph process
Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg +3
We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on vertices. In every round of the process, one vert…
Structural Properties of Bichromatic Non-crossing Matchings
Marko Savić, Miloš Stojaković
Given a set of red and blue points in the plane, we are interested in matching red points with blue points by straight line segments so that the segments do not cross. We d…
Hamiltonian Maker-Breaker games on small graphs
Miloš Stojaković, Nikola Trkulja
We look at the unbiased Maker-Breaker Hamiltonicity game played on the edge set of a complete graph , where Maker's goal is to claim a Hamiltonian cycle. First, we prove that,…
Zero-Error Capacity of -ary Shift Channels and FIFO Queues
Mladen Kovačević, Miloš Stojaković, Vincent Y. F. Tan
The objects of study of this paper are communication channels in which the dominant type of noise are symbol shifts, the main motivating examples being timing and bit-shift channel…