Solving the recoverable robust shortest path problem in DAGs. - Marcel Jackiewicz; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2023)

Recoverable robust shortest path problem under interval uncertainty representations. - Marcel Jackiewicz; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2024)

Computational complexity of the recoverable robust shortest path problem with discrete recourse. - Marcel Jackiewicz; Adam Kasperski; Pawel Zielinski 001 (Discret. Appl. Math., 2025)

Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations. - Marcel Jackiewicz; Adam Kasperski; Pawel Zielinski 001 (Networks, 2025)