Dynamic Shortest Path Algorithms for Hypergraphs J Gao, W Ren, Q Zhao, A Swami, R Ram, B Amotz Networking, IEEE/ACM Transactions on, 1, 2014 | 73 | 2014 |
Dynamic shortest path algorithms for hypergraphs J Gao, Q Zhao, W Ren, A Swami, R Ramanathan, A Bar-Noy IEEE/ACM Transactions on networking 23 (6), 1805-1817, 2014 | 73 | 2014 |
Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes W Ren, Q Zhao, R Ramanathan, J Gao, A Swami, A Bar-Noy, MP Johnson, ... Wireless networks 19, 1121-1133, 2013 | 44 | 2013 |
Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes R Wei, Z Qing, R Ram, G Jianhang, S Ananthram, BN Amotz, J Matthew P., ... IEEE International Conference on Mobile Ad hoc and Sensor Systems, 660-665, 2011 | 44 | 2011 |
The thinnest path problem for secure communications: A directed hypergraph approach J Gao, Q Zhao, A Swami 2012 50th Annual Allerton Conference on Communication, Control, and …, 2012 | 7 | 2012 |
The Thinnest Path Problem J Gao, Q Zhao, A Swami Networking, IEEE/ACM Transactions on, 1, 2013 | 5 | 2013 |
The minimum information dominating set for opinion sampling in social networks J Gao, Q Zhao, A Swami IEEE Transactions on Network Science and Engineering 3 (4), 299-311, 2016 | 2 | 2016 |
Minimum information dominating set for opinion sampling J Gao, Q Zhao, A Swami arXiv preprint arXiv:1405.5572, 2014 | 1 | 2014 |
Minimum information dominating set for critical sampling over graphs G Jianhang, Z Qing, S Ananthram International Conference on Acoustics, Speech and Signal Processing (ICASSP …, 2015 | | 2015 |