Schülerinnen und Schüler an der Universität. - Katharina Morik; Georgi Ostrowski; Tobias Pröger (Inform. Spektrum, 2005)

An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings. - Beate Bollig; Tobias Pröger (LATA, 2012)

Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. - Katerina Böhmová; Matús Mihalák; Tobias Pröger; Rastislav Srámek; Peter Widmayer (ATMOS, 2013)

On efficient implicit OBDD-based algorithms for maximal matchings. - Beate Bollig; Tobias Pröger (Inf. Comput., 2014)

Implicit computation of maximum bipartite matchings by sublinear functional operations. - Beate Bollig; Marc Gillé; Tobias Pröger (Theor. Comput. Sci., 2014)

Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. - Katerina Böhmová; Matús Mihalák; Peggy Neubert; Tobias Pröger; Peter Widmayer (ATMOS, 2015)

Computing and Listing st-Paths in Public Transportation Networks. - Katerina Böhmová; Matús Mihalák; Tobias Pröger; Gustavo Sacomoto; Marie-France Sagot (CSR, 2016)

Robust optimization in the presence of uncertainty: A generic approach. - Joachim M. Buhmann; Alexey Gronskiy; Matús Mihalák; Tobias Pröger; Rastislav Srámek; Peter Widmayer (J. Comput. Syst. Sci., 2018)

Computing and Listing st-Paths in Public Transportation Networks. - Katerina Böhmová; Luca Häfliger; Matús Mihalák; Tobias Pröger; Gustavo Sacomoto; Marie-France Sagot (Theory Comput. Syst., 2018)