Jana Cslovjecsek

16 papers A* 3A 2Journal 10

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Parameterized algorithms for block-structured integer programs with large entries. TheoretiCS Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2024	A*	`conf`	A polynomial-time OPT SODA Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2024	A	`conf`	Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. ESA Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2024	A*	`conf`	Parameterized algorithms for block-structured integer programs with large entries. SODA Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2023	J	`jnl`	A polynomial-time OPT CoRR Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2023	J	`jnl`	On the independence number of intersection graphs of axis-parallel segments. J. Comput. Geom. Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2023	J	`jnl`	Parameterized algorithms for block-structured integer programs with large entries. CoRR Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2023	—	`—`	Results on Sparse Integer Programming and Geometric Independent Sets. Jana Cslovjecsek
2022	J	`jnl`	Computing the Covering Radius of a Polytope with an Application to Lonely Runners. Comb. Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura
2022	J	`jnl`	Independence number of intersection graphs of axis-parallel segments. CoRR Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2022	J	`jnl`	Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. CoRR Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2021	A*	`conf`	Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. SODA Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel
2021	A	`conf`	Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ESA Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel
2020	J	`jnl`	Computing the covering radius of a polytope with an application to lonely runners. CoRR Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura
2020	J	`jnl`	Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. CoRR Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel
2020	J	`jnl`	N-fold integer programming via LP rounding. CoRR Jana Cslovjecsek, Friedrich Eisenbrand, Robert Weismantel