Shortest paths with ordinal weights. - Luca E. Schäfer; Tobias Dietz; Nicolas Fröhlich 002; Stefan Ruzika; José Rui Figueira (Eur. J. Oper. Res., 2020)

Covering edges in networks. - Nicolas Fröhlich 002; Andrea Maier; Horst W. Hamacher (Networks, 2020)

On the hardness of covering-interdiction problems. - Nicolas Fröhlich 002; Stefan Ruzika (Theor. Comput. Sci., 2021)