| Token swapping on trees A Biniaz, K Jain, A Lubiw, Z Masárová, T Miltzow, D Mondal, AM Naredla, ... Discrete Mathematics & Theoretical Computer Science 24 (Discrete Algorithms), 2023 | 20 | 2023 |
| Efficient homology computations on multicore and manycore systems NA Murty, V Natarajan, S Vadhiyar 20th Annual International Conference on High Performance Computing, 333-342, 2013 | 11 | 2013 |
| Dispersion for Intervals: A Geometric Approach∗ T Biedl, A Lubiw, A Murty Naredla, P Dominik Ralbovsky, G Stroud Symposium on Simplicity in Algorithms (SOSA), 37-44, 2021 | 8 | 2021 |
| Finding increasingly large extremal graphs with alphazero and tabu search A Mehrabian, A Anand, H Kim, N Sonnerat, M Balog, G Comanici, ... arXiv preprint arXiv:2311.03583, 2023 | 5 | 2023 |
| Distant representatives for rectangles in the plane T Biedl, A Lubiw, AM Naredla, PD Ralbovsky, G Stroud arXiv preprint arXiv:2108.07751, 2021 | 5 | 2021 |
| Shortest beer path queries in interval graphs R Das, M He, E Kondratovsky, JI Munro, AM Naredla, K Wu arXiv preprint arXiv:2209.14401, 2022 | 4 | 2022 |
| The visibility center of a simple polygon A Lubiw, AM Naredla arXiv preprint arXiv:2108.07366, 2021 | 3 | 2021 |
| Algorithms for Geometric Facility Location: Centers in a Polygon and Dispersion on a Line AM Naredla University of Waterloo, 2023 | 1 | 2023 |
| The geodesic edge center of a simple polygon A Lubiw, AM Naredla arXiv preprint arXiv:2303.09702, 2023 | | 2023 |
| Reconstructing a Polyhedron between Polygons in Parallel Slices T Biedl, P Bulatovic, V Irvine, A Lubiw, O Merkel, AM Naredla arXiv preprint arXiv:2004.05946, 2020 | | 2020 |
| Integral Unit Bar-Visibility Graphs. T Biedl, A Biniaz, V Irvine, P Kindermann, AM Naredla, A Turcotte CCCG, 230-246, 2018 | | 2018 |
