A. Markovic

activity

20172020

collaborators

5 papers

cs.CG2020

The Online Broadcast Range-Assignment Problem

Mark de Berg, Aleksandar Markovic, Seeun William Umboh

Let $P = {p_{0}, \dots, p_{n - 1}}$ be a set of points in $R^{d}$ , modeling devices in a wireless network. A range assignment assigns a range $r (p_{i})$ to each point $p_{i} \in P$ , t…

cs.DM2018

Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces

Boris Aronov, Mark de Berg, Aleksandar Markovic +1

It is well known that any set of n intervals in $R^{1}$ admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate ge…

cs.CG2017

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain

Elena Arseneva, Man-Kwun Chiu, Matias Korman +5

We study the computation of the diameter and radius under the rectilinear link distance within a rectilinear polygonal domain of $n$ vertices and $h$ holes. We introduce a \emph{gr…

cs.CG2017

Dynamic Conflict-Free Colorings in the Plane

Mark de Berg, Aleksandar Markovic

We study dynamic conflict-free colorings in the plane, where the goal is to maintain a conflict-free coloring (CF-coloring for short) under insertions and deletions. - First we con…

cs.CG2017

Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points

Mark de Berg, Tim Leijsen, André van Renssen +3

We introduce the fully-dynamic conflict-free coloring problem for a set $S$ of intervals in $R^{1}$ with respect to points, where the goal is to maintain a conflict-free col…