The robust recoverable spanning tree problem with interval costs is polynomially solvable. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2016)

Risk Averse Scheduling with Scenarios. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (OR, 2017)

Recoverable robust spanning tree problem under interval uncertainty representations. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (J. Comb. Optim., 2017)

The recoverable robust spanning tree problem with interval costs is polynomially solvable. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (Optim. Lett., 2017)

Robust recoverable 0-1 optimization problems under polyhedral uncertainty. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2019)