| On the complexity of the metric tsp under stability considerations M Mihalák, M Schöngens, R ©rámek, P Widmayer SOFSEM 2011: Theory and Practice of Computer Science: 37th Conference on …, 2011 | 41 | 2011 |
| On-line viterbi algorithm and its relationship to random walks R ©rámek, B Brejová, T Vinař arXiv preprint arXiv:0704.0062, 2007 | 39* | 2007 |
| Rendezvous of mobile agents when tokens fail anytime S Das, M Mihalák, R ©rámek, E Vicari, P Widmayer Principles of Distributed Systems: 12th International Conference, OPODIS …, 2008 | 36 | 2008 |
| Robust optimization in the presence of uncertainty JM Buhmann, M Mihalak, R Sramek, P Widmayer Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013 | 23 | 2013 |
| Robust routing in urban public transportation: How to find reliable journeys based on past observations K Böhmová, M Mihalák, T Pröger, R ©rámek, P Widmayer 13th Workshop on Algorithmic Approaches for Transportation Modelling …, 2013 | 23 | 2013 |
| Approximately counting approximately-shortest paths in directed acyclic graphs M Mihalák, R ©rámek, P Widmayer Theory of Computing Systems 58, 45-59, 2016 | 22 | 2016 |
| Scheduling transfers of resources over time: Towards car-sharing with flexible drop-offs K Böhmová, Y Disser, M Mihalák, R ©rámek LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016 | 21 | 2016 |
| Robust optimization in the presence of uncertainty: A generic approach JM Buhmann, AY Gronskiy, M Mihalák, T Pröger, R ©rámek, P Widmayer Journal of Computer and System Sciences 94, 135-166, 2018 | 14 | 2018 |
| The on-line Viterbi algorithm R ©rámek KAI FMFI UK, Bratislava, máj, 2007 | 8 | 2007 |
| Counting approximately-shortest paths in directed acyclic graphs M Mihalák, R ©rámek, P Widmayer Approximation and Online Algorithms: 11th International Workshop, WAOA 2013 …, 2014 | 7 | 2014 |
| Optimization in the presence of uncertainty JM Buhmann, M Mihalák, R ©rámek, P Widmayer Technical report 755, 2012 | 4 | 2012 |
| Finding robust minimum cuts B Geissmann, R ©rámek Algorithmic Aspects in Information and Management: 10th International …, 2014 | 2 | 2014 |
| Uncertain optimization using approximation sets: An algorithimc perspective R ©rámek ETH Zurich, 2013 | 2 | 2013 |
| Optimal transitions for targeted protein quantification: Best conditioned submatrix selection R ©rámek, B Fischer, E Vicari, P Widmayer Computing and Combinatorics: 15th Annual International Conference, COCOON …, 2009 | 2 | 2009 |
| Counting small cuts in a graph B Geissmann, R ©rámek arXiv preprint arXiv:1304.7632, 2013 | 1 | 2013 |
| To be uncertain is uncomfortable, but to be certain is ridiculous: Robust Optimization in the Presence of Uncertainty JM Buhmann, M Mihalák, R ©rámek, P Widmayer | | |
| Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs R ©rámek LATIN 2016: Theoretical Informatics LNCS 9644, 220, 0 | | |
Matúą MihalákAssistant Professor, Department of Data Science and Knowledge Engineering, Maastricht UniversityE-mail megerősítve itt: maastrichtuniversity.nl
