| Automorphism group of the complete transposition graph A Ganesan Journal of Algebraic Combinatorics 42, 793-801, 2015 | 31 | 2015 |
| On the existence of universally decodable matrices A Ganesan, PO Vontobel IEEE transactions on information theory 53 (7), 2572-2575, 2007 | 31 | 2007 |
| Automorphism groups of Cayley graphs generated by connected transposition sets A Ganesan Discrete Mathematics 313 (21), 2482-2485, 2013 | 23 | 2013 |
| An efficient algorithm for the diameter of Cayley graphs generated by transposition trees A Ganesan arXiv preprint arXiv:1202.5888, 2012 | 16 | 2012 |
| Cayley graphs and symmetric interconnection networks A Ganesan arXiv preprint arXiv:1703.08109, 2017 | 14 | 2017 |
| A virtual input-output framework for transceiver analysis and design for multipath fading channels A Ganesan, AM Sayeed IEEE transactions on communications 51 (7), 1149-1161, 2003 | 14 | 2003 |
| The performance of an upper bound on the fractional chromatic number of weighted graphs A Ganesan Applied Mathematics Letters 23 (5), 597-599, 2010 | 13 | 2010 |
| On some sufficient conditions for distributed Quality-of-Service support in wireless networks A Ganesan Networks and Communications, 2009. NETCOM'09. First International Conference …, 2009 | 13 | 2009 |
| On some sufficient conditions for distributed QoS support in wireless networks A Ganesan Technical Report, available from author, 19, 2008 | 12 | 2008 |
| Performance guarantees of distributed algorithms for QoS in wireless ad hoc networks A Ganesan IEEE/ACM Transactions on Networking 28 (1), 182-195, 2020 | 11 | 2020 |
| Performance of sufficient conditions for distributed quality-of-service support in wireless networks A Ganesan Wireless networks 20, 1321-1334, 2014 | 11 | 2014 |
| Bandwidth-efficient exploitation of the degrees of freedom in a multipath fading channel A Ganesan, AM Sayeed 2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060 …, 2000 | 10 | 2000 |
| On some distributed scheduling algorithms for wireless networks with hypergraph interference models A Ganesan IEEE Transactions on Information Theory 67 (5), 2952-2957, 2021 | 9 | 2021 |
| On the automorphism group of a Johnson graph A Ganesan arXiv preprint arXiv:1412.5055, 2014 | 9 | 2014 |
| On universally decodable matrices for space–time coding PO Vontobel, A Ganesan Designs, Codes and Cryptography 41, 325-342, 2006 | 9 | 2006 |
| An extreme point result for convexity, concavity and monotonicity of parameterized linear equation solutions A Ganesan, SR Ross, BR Barmish Linear algebra and its applications 390, 61-73, 2004 | 8 | 2004 |
| Detour distance pattern of a graph K Abhishek, A Ganesan International Journal of Pure and Applied Mathematics 87 (5), 719-728, 2013 | 7 | 2013 |
| Distributed algorithms for QoS in wireless ad hoc networks under the primary interference model A Ganesan 2020 International Conference on Wireless Communications Signal Processing …, 2020 | 6 | 2020 |
| Edge-transitivity of Cayley graphs generated by transpositions A Ganesan Discussiones Mathematicae Graph Theory 36 (4), 1035-1042, 2016 | 6 | 2016 |
| On the automorphism group of Cayley graphs generated by transpositions. A Ganesan Australasian J. Combinatorics 64, 432-436, 2016 | 6 | 2016 |
