34 citations · 149 across the 17 of their papers we have counts for
3 papers · 1 filter
Linearly-exponential checking is enough for the Lonely Runner Conjecture and some of its variants
Romanos Diogenes Malikiosis, Francisco Santos, Matthias Schymura
Tao (2018) showed that in order to prove the Lonely Runner Conjecture (LRC) up to runners it suffices to consider positive integer velocities in the order of . Us…
Computing the covering radius of a polytope with an application to lonely runners
Jana Cslovjecsek, Romanos Diogenes Malikiosis, Márton Naszódi +1
We are concerned with the computational problem of determining the covering radius of a rational polytope. This parameter is defined as the minimal dilation factor that is needed f…
A note on the pyjama problem
R. D. Malikiosis, M. Matolcsi, I. Z. Ruzsa
This note concerns the so-called pyjama problem, whether it is possible to cover the plane by finitely many rotations of vertical strips of half-width . We first prove…