Waiting for Trains: Complexity Results. - Bjoern Tauer; Dennis Fischer 001; Janosch Fuchs; Laura Vargas Koch; Stephan Zieger (CALDAM, 2020)

A faster algorithm for the continuous bilevel knapsack problem. - Dennis Fischer 001; Gerhard J. Woeginger (Oper. Res. Lett., 2020)

An Investigation of the Recoverable Robust Assignment Problem. - Dennis Fischer 001; Tim A. Hartmann; Stefan Lendl; Gerhard J. Woeginger (IPEC, 2021)

A note on the complexity of the bilevel bottleneck assignment problem. - Dennis Fischer 001; Komal Muluk; Gerhard J. Woeginger (4OR, 2022)