Publications
Journal papers
A. Ganesan,
"Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model,"
Theoretical Computer Science, vol. 947, February 2023. [ doi ]A. Ganesan,
"On some distributed scheduling algorithms for wireless networks with hypergraph interference models,"
IEEE Transactions on Information Theory, vol. 67, no. 5, pp. 2952-2957, May 2021. [ preprint , doi ]A. Ganesan,
"Performance guarantees of distributed algorithms for QoS in wireless ad hoc networks,"
IEEE/ACM Transactions on Networking, vol. 28, pp. 182-195, February 2020. [ doi, PDF, preprint ]A. Ganesan,
"Fault tolerant supergraphs with automorphisms,"
Discrete Applied Mathematics, vol. 254, pp. 274-279, February 2019. [ doi, preprint ]A. Ganesan,
"On the automorphism group of a Johnson graph,"
Ars Combinatoria, vol. 136, pp. 391-396, January 2018. [ preprint ]A. Ganesan,
"Edge-transitivity of Cayley graphs generated by transpositions,"
Discussiones Mathematicae Graph Theory, vol. 36, pp. 1035-1042, October 2016. [ preprint, article online ]A. Ganesan,
"On the automorphism group of Cayley graphs generated by transpositions,"
Australasian Journal of Combinatorics, vol. 64, no. 3, pp. 432-436, February 2016. [ PDF ]A. Ganesan,
"Automorphism group of the complete transposition graph,"
Journal of Algebraic Combinatorics, vol. 42, No. 3, pp. 793-801, November 2015. [ preprint, doi ]A. Ganesan,
"Performance of sufficient conditions for distributed quality-of-service support in wireless networks,"
Wireless Networks, vol. 20, Issue 6, pp. 1321-1334, August 2014. [ doi, preprint ]A. Ganesan,
"Automorphism groups of Cayley graphs generated by connected transposition sets,"
Discrete Mathematics, vol. 313, no. 21, pp. 2482--2485, November 2013. [ doi, preprint ]A. Ganesan,
"On the sharpness of a bound on the diameter of Cayley graphs generated by transposition trees,"
Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 84, pp. 29-40, February 2013.A. Ganesan,
"An efficient algorithm for the diameter of Cayley graphs generated by transposition trees,"
IAENG International Journal of Applied Mathematics, vol. 42, Issue 4, pp. 214-223, November 2012.A. Ganesan and R. R. Iyer,
"The regular number of a graph,"
Journal of Discrete Mathematical Sciences and Cryptography, vol. 15, no 2-3, pp. 149-157, 2012.A. Ganesan,
“The performance of an upper bound on the fractional chromatic number of weighted graphs,”
Applied Mathematics Letters, vol. 23, pp. 597-599, May 2010. [ doi, preprint ]A. Ganesan and P. O. Vontobel,
“On the existence of universally decodable matrices,”
IEEE Transactions on Information Theory, vol. IT–53, pp. 2572--2575, July 2007. [ doi ]P. O. Vontobel and A. Ganesan,
“On universally decodable matrices for space-time coding,”
Designs, Codes, and Cryptography, vol. 41, pp. 325–342, December 2006. [ doi ]A. Ganesan, S. R. Ross, and B. R. Barmish,
"An extreme point result for convexity, concavity and monotonicity of parameterized linear equation solutions,"
Linear Algebra and its Applications, vol. 390, pp. 61-73, 2004. [ doi ]A. Ganesan and A. M. Sayeed,
"A virtual input-output framework for transceiver analysis and design for multipath fading channels,"
IEEE Transactions on Communications, pp. 1149-1161, June 2003. [ doi ]
Conference papers
A. Ganesan,
"Structured Hypergraphs in Cellular Mobile Communication Systems,"
Proceedings of the 24th International Conference on Distributed Computing and Networking (ICDCN '23), pp. 188-196, Kharagpur, January 2023. [ doi, Technical Report version ]A. Ganesan,
"Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model,"
Proceedings of the 22nd International Conference on Distributed Computing and Networking (ICDCN '21), pp. 96-105, Nara, Japan, ACM, January 2021. [ Technical Report, doi , TechRxiv ]A. Ganesan,
"Distributed algorithms for QoS in wireless ad hoc networks under the primary interference model,"
Proceedings of the International Conference on Wireless Communications, Signal Processing, and Networking (WiSPNET), pp. 63-66, Chennai, India, August 2020. [ Conference paper: doi ]A. Ganesan,
"On the strictness of a bound for the diameter of Cayley graphs generated by transposition trees,"
Proceedings of the International Conference on Mathematical Modeling and Scientific Computation, Communications in Computer and Information Science, vol. 283, pp. 54-61, Springer-Verlag, Gandhigram, India, March 2012. [ Conference paper: doi ]A. Ganesan,
"On some sufficient conditions for distributed quality-of-service support in wireless networks,"
International Workshop on Applications of Graph Theory in Wireless Adhoc Networks and Sensor Networks (GraphHoc), part of 2009 NetCoM Conference, Chennai, India, December 2009. [ Conference paper: IEEE Xplore,| Slides ]P. O. Vontobel and A. Ganesan,
“On universally decodable matrices for space-time coding,”
Proceedings of the Inaugural Workshop of the Center for Information Theory and its Applications, UCSD, La Jolla, CA, February 2006.A. Ganesan, S. R. Ross, and B. R. Barmish,
"An Extreme Point Result for Radius of Convexity of Linear Equation Solutions,"
Proceedings of the 15th Triennial IFAC World Congress, Barcelona, Spain, July 2002.A. Ganesan, S. R. Ross, and B. R. Barmish,
"A Uniform Convexity Property of Linear Equation Solutions for Distributional Robustness,"
Proceedings of the 39th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, October 2001.A. Ganesan and A. M. Sayeed,
"A virtual MIMO framework for multipath fading channels,"
Proceedings of the 34th Annual Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, November 2000.A. Ganesan and A. M. Sayeed,
"On bandwidth-efficient communication over frequency-selective fading channels,"
Proceedings of the 38th Allerton Conference on Communications, Control, and Computing, Monticello, IL, October 2000.A. Ganesan and A. M. Sayeed,
"Bandwidth-efficient exploitation of the degrees of freedom in a multipath fading channel,"
Proceedings of the IEEE International Symposium on Information Theory, Sorrento, Italy, June 2000. [ doi ]
Technical reports
A. Ganesan,
"Structured Hypergraphs in Cellular Mobile Communication Systems,"
Technical Report, 19 pages, July 2022. [ Technical Report ]A. Ganesan,
"Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model,"
Technical Report, 21 pages, July 2020. [ Technical Report, doi , TechRxiv ]A. Ganesan,
"On some distributed scheduling algorithms for wireless networks with hypergraph interference models,"
Technical Report, 10 pages, October 2019. [ Technical Report ]A. Ganesan,
"Performance of distributed algorithms for QoS in wireless ad hoc networks: arbitrary networks under the primary interference model, and line networks under the protocol interference model,"
Technical Report, 22 pages, October 2018. [ Technical Report ]A. Ganesan,
"Fault tolerant supergraphs with automorphisms,"
Technical Report, 3 pages, April 2016. [ Technical Report ]A. Ganesan,
"Edge-transitivity of Cayley graphs generated by transpositions,"
Technical Report, 7 pages, November 2015. [ Technical Report ]A. Ganesan,
"Structure of the automorphism group of the augmented cube graph,"
Technical Report, 15 pages, August 2015. [ Technical Report ]A. Ganesan,
"On the automorphism group of a Johnson graph,"
Technical Report, 5 pages, December 2014. [ Technical Report ]A. Ganesan,
"A direct product decomposition of the automorphism group of Cayley graphs generated by transposition sets,"
Technical Report, 3 pages, September 2014. [ Technical Report ]A. Ganesan,
"Automorphism group of the complete transposition graph,"
Technical Report, 10 pages, April 2014. [ Technical Report ]A. Ganesan,
"The automorphism group of Cayley graphs on symmetric groups generated by transposition sets and of the modified bubble-sort graph,"
Technical Report, 19 pages, May 2012. [ Technical Report ]A. Ganesan,
"Diameter of Cayley graphs of permutation groups generated by transposition trees,"
Technical Report, 21 pages, December 2011. [ Technical Report ]A. Ganesan,
"On some sufficient conditions for distributed QoS support in wireless networks,"
Technical Report, 19 pages, May 2008. [ Technical Report ]P. O. Vontobel and A. Ganesan,
"On universally decodable matrices for space-time coding,"
Technical Report ECE-06-3, UW-Madison, April 2006.A. Ganesan and P. O. Vontobel,
"On the existence of universally decodable matrices,"
Technical Report ECE-06-1, UW-Madison, January 2006.P. O. Vontobel and A. Ganesan,
“An explicit construction of universally decodable matrices,”
Technical Report, August 2005.