2 citations · 2 across the 3 of their papers we have counts for
7 papers
Parameterized algorithms for block-structured integer programs with large entries
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota +2
We study two classic variants of block-structured integer programming. Two-stage stochastic programs are integer programs of the form $\{A_i \mathbf{x} + D_i \mathbf{y}_i = \mathbf…
A polynomial-time -approximation algorithm for maximum independent set of connected subgraphs in a planar graph
Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
In the Maximum Independent Set of Objects problem, we are given an -vertex planar graph and a family of objects, where each object is a connected subgraph…
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments
Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
In the Maximum Weight Independent Set of Rectangles problem (MWISR) we are given a weighted set of axis-parallel rectangles in the plane. The task is to find a subset of pairwi…
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 axis-parallel segments in the plane, the independence number of this graph is at least . W…
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity
Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk +2
We consider the problem of solving integer programs of the form , where is a multistage stochastic matrix in the following sens…
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…