Jana Cslovjecsek
According to our database1,
Jana Cslovjecsek
authored at least 9 papers
between 2020 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
A polynomial-time OPT<sup>ɛ</sup>-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
2023
A polynomial-time OPT<sup>ε</sup>-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.
CoRR, 2023
2022
Comb., 2022
2021
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020