1. Bruce, R., Hoffmann, M., Krizanc, D., Raman, R.: Efficient update strategies for geometric computing with uncertainty. Theory Comput. Syst. 38(4), 411–423 (2005). https://doi.org/10.1007/s00224-004-1180-4
2. Busto, D., Evans, W., Kirkpatrick, D.: Minimizing interference potential among moving entities. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 2400–2418 (2019). http://dl.acm.org/citation.cfm?id=3310435.3310582
3. Dürr, C., Erlebach, T., Megow, N., Meißner, J.: Scheduling with explorable uncertainty. In: Proceedings of the 9th Innovations in Theoretical Computer Science Conference, ITCS, LIPIcs, vol. 94, pp. 30:1–30:14 (2018). https://doi.org/10.4230/LIPIcs.ITCS.2018.30
4. Erlebach, T., Hoffmann, M.: Query-competitive algorithms for computing with uncertainty. Bull. EATCS 116, 22–39 (2015). http://bulletin.eatcs.org/index.php/beatcs/article/view/335
5. Erlebach, T., Hoffmann, M., Krizanc, D., Mihal’ák, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: STACS, pp. 277–288 (2008). https://doi.org/10.4230/LIPIcs.STACS.2008.1358