Jana Cslovjecsek

From MaRDI portal
Person:2095111

Available identifiers

zbMath Open cslovjecsek.janaMaRDI QIDQ2095111

List of research outcomes





PublicationDate of PublicationType
A polynomial-time \(\mathrm{OPT}^\varepsilon\)-approximation algorithm for maximum independent set of connected subgraphs in a planar graph2024-11-28Paper
Parameterized algorithms for block-structured integer programs with large entries2024-11-28Paper
https://portal.mardi4nfdi.de/entity/Q61473562024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60575402023-10-05Paper
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity2023-09-20Paper
Computing the covering radius of a polytope with an application to lonely runners2022-11-09Paper
Computing the covering radius of a polytope with an application to lonely runners2020-09-25Paper

Research outcomes over time

This page was built for person: Jana Cslovjecsek

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2095111&oldid=6571502"
Powered by MediaWiki