Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://drops.dagstuhl.de/opus/volltexte/2017/7439/ (Verlagsversion)
http://drops.dagstuhl.de/doku/urheberrecht1.html (Verlagsvertrag)
Bringmann, K., Dueholm Hansen, T., & Krinninger, S. (2017). Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. In I. Chatzigiannakis, P. Indyk, F. Kuhn, & A. Muscholl (Eds.), 44th International Colloquium on Automata, Languages, and Programming (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2017.124.