Minimum cuts and shortest homologous cycles EW Chambers, J Erickson, A Nayyeri Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009 | 93 | 2009 |
Homology flows, cohomology cuts EW Chambers, J Erickson, A Nayyeri Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 76 | 2009 |
Understanding oversquashing in gnns through the lens of effective resistance M Black, Z Wan, A Nayyeri, Y Wang International Conference on Machine Learning, 2528-2547, 2023 | 64 | 2023 |
Minimum cuts and shortest non-separating cycles via homology covers J Erickson, A Nayyeri Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 64 | 2011 |
Energy-efficient topology control in wireless ad hoc networks with selfish nodes S Zarifzadeh, N Yazdani, A Nayyeri Computer Networks 56 (2), 902-914, 2012 | 63 | 2012 |
All-pairs minimum cuts in near-linear time for surface-embedded graphs G Borradaile, D Eppstein, A Nayyeri, C Wulff-Nilsen arXiv preprint arXiv:1411.7055, 2014 | 41 | 2014 |
Shortest non-crossing walks in the plane J Erickson, A Nayyeri Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 36 | 2011 |
Tracing compressed curves in triangulated surfaces J Erickson, A Nayyeri Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012 | 31 | 2012 |
Energy conserving movement-assisted deployment of ad hoc sensor networks H Mousavi, A Nayyeri, N Yazdani, C Lucas IEEE Communications Letters 10 (4), 269-271, 2006 | 31 | 2006 |
Minimum cycle and homology bases of surface embedded graphs G Borradaile, EW Chambers, K Fox, A Nayyeri arXiv preprint arXiv:1607.05112, 2016 | 29 | 2016 |
Efficient construction of network topology to conserve energy in wireless ad hoc networks S Zarifzadeh, A Nayyeri, N Yazdani Computer Communications 31 (1), 160-173, 2008 | 29 | 2008 |
Testing surface area P Kothari, A Nayyeri, R O'Donnell, C Wu Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 28 | 2014 |
Global minimum cuts in surface embedded graphs J Erickson, K Fox, A Nayyeri Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 28 | 2012 |
How to walk your dog in the mountains with no magic leash S Har-Peled, A Nayyeri, M Salavatipour, A Sidiropoulos Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012 | 24 | 2012 |
Fufair: a fuzzy farsi information retrieval system A Nayyeri, F Oroumchian | 24 | 2006 |
Solving 1-laplacians in nearly linear time: Collapsing and expanding a topological ball MB Cohen, BT Fasy, GL Miller, A Nayyeri, R Peng, N Walkington Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 21 | 2014 |
A simplicial complex-based approach to unmixing tumor progression data T Roman, A Nayyeri, BT Fasy, R Schwartz BMC bioinformatics 16, 1-17, 2015 | 20 | 2015 |
Reality distortion: Exact and approximate algorithms for embedding into the line A Nayyeri, B Raichel 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 729-747, 2015 | 19 | 2015 |
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes G Borradaile, W Maxwell, A Nayyeri arXiv preprint arXiv:2003.02801, 2020 | 17 | 2020 |
Computing replacement paths in surface embedded graphs J Erickson, A Nayyeri Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 16 | 2011 |