Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T. M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S.
& Wilkinson, B. T. (2017).
How to Morph Planar Graph Drawings.
S I A M Journal on Computing,
46(2), 824-852.
https://doi.org/10.1137/16M1069171
Afshani, P., Agarwal, P. K.
, Arge, L., Larsen, K. G. & Phillips, J. (2013).
(Approximate) Uncertain Skylines.
Theory of Computing Systems,
52(3), 342-366.
https://doi.org/10.1007/s00224-012-9382-7
Afshani, P., Afrawal, M., Benjamin, D.
, Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012).
The Query Complexity of Finding a Hidden Permutation.
Electronic Colloquium on Computational Complexity, (TR12-087).
http://eccc.hpi-web.de/report/2012/087/
Afshani, P., Chan, T. M. & Tsakalidis, K. (2014).
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. In J. Esparza , P. Fraigniaud, T. Husfeldt & E. Koutsoupias (Eds.),
Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I (pp. 77-88 ). Springer VS.
https://doi.org/10.1007/978-3-662-43948-7_7
Afshani, P., Agrawal, M., Benjamin, D., Doerr, C.
, Larsen, K. G. & Mehlhorn, K. (2013).
The Query Complexity of Finding a Hidden Permutation. In A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (Eds.),
Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (pp. 1-11). Springer VS.
https://doi.org/10.1007/978-3-642-40273-9_1
Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C.
, Sitchinava, N. & Tsirogiannis, C. (2017).
An efficient algorithm for the 1D total visibility-index problem. In S. Fekete & V. Ramachandran (Eds.),
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Vol. PRAL17, pp. 218-231). Society for Industrial and Applied Mathematics.
https://doi.org/10.1137/1.9781611974768.18
Afshani, P., Bender, M. A., Farach-Colton, M., Fineman, J. T., Goswami, M. & Tsai, M. T. (2017).
Cross-Referenced dictionaries and the limits of write optimization. In P. N. Klein (Ed.),
28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (pp. 1523-1532). Association for Computing Machinery.
Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C.
, Sitchinava, N. & Tsirogiannis, C. (2018).
An efficient algorithm for the 1D total visibility-index problem and its parallelization.
ACM Journal of Experimental Algorithmics,
23, Article 2.3.
https://doi.org/10.1145/3209685
Afshani, P., Agrawal, M., Doerr, B., Doerr, C.
, Larsen, K. G. & Mehlhorn, K. (2019).
The query complexity of a permutation-based variant of Mastermind.
Discrete Applied Mathematics,
260, 28-50.
https://doi.org/10.1016/j.dam.2019.01.007
Afshani, P., Fagerberg, R., Hammer, D., Jacob, R., Kostitsyna, I., Meyer, U., Penschuck, M.
& Sitchinava, N. (2019).
Fragile complexity of comparison-based algorithms. In M. A. Bender, O. Svensson & G. Herman (Eds.),
27th Annual European Symposium on Algorithms, ESA 2019 Article 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. In S. M. LaValle, M. Lin, T. Ojala, D. Shell & J. Yu (Eds.),
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. In X. Goaoc & M. Kerber (Eds.),
38th International Symposium on Computational Geometry, SoCG 2022 Article 2 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.SoCG.2022.2