I am an educator and researcher in computer science and engineering, with a research specialization in applied combinatorics.
Conducted theoretical research on performance guarantees of distributed algorithms in wireless networks using graph and hypergraph interference models, with publications in top-tier journals such as IEEE/ACM Transactions on Networking and IEEE Transactions on Information Theory.
Obtained results in computational discrete mathematics and concrete mathematics, particularly on automorphism groups of Cayley graphs, with publications in the journals Discrete Mathematics and Journal of Algebraic Combinatorics.
Obtained results on fault tolerance of interconnection networks, published in the journal Discrete Applied Mathematics.
Addressed and resolved open problems in the literature.
My expertise spans theoretical computer science, including computational thinking and problem-solving, data structures, algorithms, discrete mathematics, graph theory, optimization, and their applications in computer networks, distributed systems, interconnection networks, and machine learning.
I bring significant experience in university teaching, engineering education, and academic leadership, with a strong record of mentoring students and professionals.
As an educator, I have taught a wide range of computer science and engineering courses, including computer networks, problem solving and programming, data structures, introduction to algorithms, introduction to computer science and programming using Python, discrete mathematics and graph theory, theory of computation and compiler design, information and network security, and mathematical foundations of computer science.
My courses combine theoretical foundations with hands-on programming experience.
Over the years, I've taught more than 3000 students, mostly undergraduates.
A. Ganesan, "The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems," IEEE Transactions on Mobile Computing, vol. 25, no. 1, pp. 150-164, January 2025.
A. Ganesan, "Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model," Theoretical Computer Science, Vol. 947, Article 113718, 16 pages, 20 February 2023.
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.
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.
A. Ganesan, “Fault tolerant supergraphs with automorphisms,” Discrete Applied Mathematics, vol. 254, pp. 274-279, February 2019.
A. Ganesan, “Automorphism group of the complete transposition graph,” Journal of Algebraic Combinatorics, vol. 42, No. 3, pp. 793-801, November 2015.
A. Ganesan, “Automorphism groups of Cayley graphs generated by connected transposition sets,” Discrete Mathematics, vol. 313, no. 21, pp. 2482-2485, November 2013.