Embedded Files
Ashwin Ganesan
Mumbai, Maharashtra, India
Phone: +91 - 98694 55961
Email: ashwin.ganesan@gmail.com
Affiliations
BITS Pilani WILP (Work Integrated Learning Programmes), Mumbai, India.
Adjunct Faculty, Department of Computer Science and Information Systems, March 2025 - Present.Indian Institute of Information Technology, Surat, Gujarat, India.
Professor of Practice, October 2024 - Present.Indian Institute of Technology, Madras, India.
Project Consultant, Centre for Cybersecurity, Trust and Reliability (CyStar), Department of Computer Science and Engineering, December 2024 - Present.
I am an educator and researcher in computer science and engineering, with a research specialization in applied combinatorics.
Research Contributions
Research Contributions
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.
Teaching
Teaching
BITS Pilani WILP (May - September 2025)
Algorithm Design
Data Structures and Algorithm Design
Mathematical Foundations for Machine Learning
IIIT, Surat, Gujarat, India (January - April 2025)
Design and Analysis of Algorithms
Research and Publications
Research and Publications
Research Areas
Research Areas
Distributed algorithms
Graphs and algorithms in communication networks
Discrete mathematics and graph theory
Interconnection networks
Applied combinatorics
Some Recent Papers
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 3rd IEEE World Conference on Applied Intelligence and Computing (AIC 2024), pp. 54-59, 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, Article 113718, 16 pages, 20 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, 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 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 ]
Page updated
Google Sites
Report abuse