Jana Cslovjecsek

According to our database, Jana Cslovjecsek authored at least 9 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A polynomial-time OPT^ɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.

Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Parameterized algorithms for block-structured integer programs with large entries.

Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

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

2022

Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments.

Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki

CoRR, 2022

Independence number of intersection graphs of axis-parallel segments.

Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki

CoRR, 2022

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

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

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity.

Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

N-fold integer programming via LP rounding.

Jana Cslovjecsek, Friedrich Eisenbrand, Robert Weismantel

CoRR, 2020