Multi-criteria shortest paths in time-dependent train networks Y Disser, M Müller–Hannemann, M Schnee Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008 | 164 | 2008 |
Fast collaborative graph exploration D Dereniowski, Y Disser, A Kosowski, D Pająk, P Uznański Information and Computation 243, 37-49, 2015 | 90 | 2015 |
Tight bounds for online TSP on the line A Bjelde, J Hackfeld, Y Disser, C Hansknecht, M Lipmann, J Meißner, ... ACM Transactions on Algorithms (TALG) 17 (1), 1-58, 2020 | 57 | 2020 |
The simplex algorithm is NP-mighty Y Disser, M Skutella ACM Transactions on Algorithms (TALG) 15 (1), 1-19, 2018 | 52 | 2018 |
Tight bounds for undirected graph exploration with pebbles and multiple agents Y Disser, J Hackfeld, M Klimm Journal of the ACM (JACM) 66 (6), 1-41, 2019 | 50* | 2019 |
Collaborative delivery with energy-constrained mobile robots A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ... Theoretical Computer Science 810, 2-14, 2020 | 30 | 2020 |
A general lower bound for collaborative tree exploration Y Disser, F Mousset, A Noever, N Škorić, A Steger International Colloquium on Structural Information and Communication …, 2017 | 28 | 2017 |
A polygon is determined by its angles Y Disser, M Mihalák, P Widmayer Computational Geometry 44 (8), 418-426, 2011 | 28* | 2011 |
Energy-efficient delivery by heterogeneous mobile agents A Bärtschi, J Chalopin, S Das, Y Disser, D Graf, J Hackfeld, P Penna Proceedings of the 34th International Symposium on Theoretical Aspects of …, 2017 | 27 | 2017 |
Packing a knapsack of unknown capacity Y Disser, M Klimm, N Megow, S Stiller SIAM Journal on Discrete Mathematics 31 (3), 1477-1497, 2017 | 26 | 2017 |
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles J Chen, W Czerwiński, Y Disser, AE Feldmann, D Hermelin, W Nadara, ... arXiv preprint arXiv:2006.00571, 2020 | 22 | 2020 |
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 | 22 | 2016 |
Improving the Hk-bound on the price of stability in undirected shapley network design games Y Disser, AE Feldmann, M Klimm, M Mihalák Theoretical Computer Science 562, 557-564, 2015 | 22 | 2015 |
Mapping simple polygons: How robots benefit from looking back J Chalopin, S Das, Y Disser, M Mihalák, P Widmayer Algorithmica 65, 43-59, 2013 | 21* | 2013 |
Reconstructing visibility graphs with simple robots D Bilò, Y Disser, M Mihalák, S Suri, E Vicari, P Widmayer Theoretical Computer Science 444, 52-59, 2012 | 21 | 2012 |
Local realism, detection efficiencies, and probability polytopes J Wilms, Y Disser, G Alber, IC Percival Physical Review A—Atomic, Molecular, and Optical Physics 78 (3), 032116, 2008 | 21 | 2008 |
Tight analysis of the smartstart algorithm for online dial-a-ride on the line A Birx, Y Disser SIAM Journal on Discrete Mathematics 34 (2), 1409-1443, 2020 | 19 | 2020 |
Distance-preserving graph contractions A Bernstein, K Däubel, Y Disser, M Klimm, T Mütze, F Smolny SIAM Journal on Discrete Mathematics 33 (3), 1607-1636, 2019 | 19* | 2019 |
Mapping simple polygons: The power of telling convex from reflex J Chalopin, S Das, Y Disser, M Mihalák, P Widmayer ACM Transactions on Algorithms (TALG) 11 (4), 1-16, 2015 | 19* | 2015 |
The complexity of computing a robust flow Y Disser, J Matuschke Operations Research Letters 48 (1), 18-23, 2020 | 18 | 2020 |