Jana Cslovjecsek

activity

20202023

most citedParameterized algorithms for block-structured integer programs with large entries

2 citations · 5 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022

Independence number of intersection graphs of axis-parallel segments

Marco Caoduro, Jana Cslovjecsek, Michał Pilipczuk +1

We prove that for any triangle-free intersection graph of $n$ axis-parallel segments in the plane, the independence number $α$ of this graph is at least $α \geq n /4 + Ω (n)$ . W…

math.CO2020★ 2 cited

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…