Afshani, P., Fagerberg, R., Hammer, D., Jacob, R., Kostitsyna, I., Meyer, U., Penschuck, M.
& Sitchinava, N. (2019).
Fragile complexity of comparison-based algorithms. I M. A. Bender, O. Svensson & G. Herman (red.),
27th Annual European Symposium on Algorithms, ESA 2019 Artikel 2 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.ESA.2019.2
Afshani, P., de Berg, M., Buchin, K., Gao, J., Loffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Wang, H.-T. (2021).
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. I S. M. LaValle, M. Lin, T. Ojala, D. Shell & J. Yu (red.),
Algorithmic Foundations of Robotics XIV-Part A: Proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics Springer.
https://arxiv.org/abs/2005.02530
Afshani, P., de Berg, M., Buchin, K., Gao, J., Löffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Yang, H. T. (2022).
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. I X. Goaoc & M. Kerber (red.),
38th International Symposium on Computational Geometry, SoCG 2022 Artikel 2 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.SoCG.2022.2
Afshani, P., Cheng, P., Basu Roy, A. & Wei, Z. (2023).
On Range Summary Queries. I K. Etessami, U. Feige & G. Puppis (red.),
50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (s. 7:1-7:17). Artikel 7 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH.
https://doi.org/10.4230/LIPIcs.ICALP.2023.7