N-fold integer programming via LP rounding. - Jana Cslovjecsek; Friedrich Eisenbrand; Robert Weismantel (CoRR, 2020)

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. - Jana Cslovjecsek; Friedrich Eisenbrand; Michal Pilipczuk; Moritz Venzin; Robert Weismantel (ESA, 2021)

Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. - Jana Cslovjecsek; Friedrich Eisenbrand; Christoph Hunkenschröder; Lars Rohwedder; Robert Weismantel (SODA, 2021)

Computing the Covering Radius of a Polytope with an Application to Lonely Runners. - Jana Cslovjecsek; Romanos-Diogenes Malikiosis; Márton Naszódi; Matthias Schymura (Comb., 2022)

A polynomial-time OPTε-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. - Jana Cslovjecsek; Michal Pilipczuk; Karol Wegrzycki (CoRR, 2023)

On the independence number of intersection graphs of axis-parallel segments. - Marco Caoduro; Jana Cslovjecsek; Michal Pilipczuk; Karol Wegrzycki (J. Comput. Geom., 2023)

Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. - Jana Cslovjecsek; Michal Pilipczuk; Karol Wegrzycki (ESA, 2024)

A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. - Jana Cslovjecsek; Michal Pilipczuk; Karol Wegrzycki (SODA, 2024)

Parameterized algorithms for block-structured integer programs with large entries. - Jana Cslovjecsek; Martin Koutecký; Alexandra Lassota; Michal Pilipczuk; Adam Polak 001 (TheoretiCS, 2025)