Ashwin Ganesan's Homepage
Ashwin Ganesan
Mumbai, Maharashtra, India
Phone: +91 - 98694 55961
Email: ashwin.ganesan@gmail.com
Affiliations
Adjunct Faculty, Department of Computer Science and Information Systems, BITS Pilani WILP (Work Integrated Learning Programmes), March 2025 - Present.
Professor of Practice, IIIT Surat, Gujarat, India, October 2024 - Present.
Project Consultant, Centre for Cybersecurity, Trust and Reliability (CyStar), Department of Computer Science and Engineering, IIT Madras, December 2024 - Present.
About me
Theoretician and researcher in computer science and engineering:
Conducted 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.
Expertise in theoretical computer science, including problem-solving and programming, data structures, algorithms, discrete mathematics, graph theory, optimization, and graph algorithms, with applications in communication networks, distributed systems, interconnection networks, and machine learning.
Experienced in university teaching, engineering education, and academic leadership, with a strong record of mentoring students and professionals.
As an educator, I have taught a diverse range of courses in computer science and engineering, including introduction to computer science and programming using Python, discrete mathematics and graph theory, data structures, introduction to algorithms, computer networks, theory of computation and compiler design, information and network security, and mathematical foundations of computer science.
Selected publications
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.
Teaching
Delivered lectures for the following courses at IIIT Surat.
Spring 2025
Data Structures and Algorithms
Design and Analysis of Algorithms
Discrete Mathematics
Research and Publications
Research Areas
Distributed algorithms
Graphs and algorithms in communication networks
Discrete mathematics and graph theory
Interconnection networks
Applied combinatorics
Some Recent Papers
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. [ doi, preprint ]A. Ganesan and A. Narasimhamurthy,
"An Algorithm for the Multi-Depot, Multi-Vehicle Routing Problem with Capacity Constraints,"
Proceedings of the 2024 IEEE World Conference on Applied Intelligence and Computing (AIC 2024), Gwalior, India, July 2024. [ doi ]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,
"Structured Hypergraphs in Cellular Mobile Communication Systems,"
Proceedings of the 24th International Conference on Distributed Computing and Networking (ICDCN '23), pp. 188-196, Kharagpur, India, January 2023. [ doi, Technical Report version ]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 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,
"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 ]