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)

Interval Selection with Machine-Dependent Intervals. - Katerina Böhmová; Yann Disser; Matús Mihalák; Peter Widmayer (WADS, 2013)

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)

The Diameter of Cyclic Kautz Digraphs. - Katerina Böhmová; Cristina Dalfó; Clemens Huemer (Electron. Notes Discret. Math., 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)

Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores. - Katerina Böhmová; Enrico Kravina; Matús Mihalák (ISCO, 2016)

Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. - Katerina Böhmová; Yann Disser; Matús Mihalák; Rastislav Srámek (LATIN, 2016)

Sequence Hypergraphs. - Katerina Böhmová; Jérémie Chalopin; Matús Mihalák; Guido Proietti; Peter Widmayer (WG, 2016)

Sequence Hypergraphs: Paths, Flows, and Cuts. - Katerina Böhmová; Jérémie Chalopin; Matús Mihalák; Guido Proietti; Peter Widmayer (Adventures Between Lower Bounds and Higher Altitudes, 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)