Dr Ayan Nandy
- Associate Professor
- Area: Computer Science and Engineering
Ayan Nandy joined NIIT University (NU) in 2017. Mr Nandy completed his PhD at the Indian Statistical Institute (ISI), working on variants of the Center Location Problem. After completing his fellowship at Indian Institute of Management (IIM) Calcutta, Mr Nandy was a lecturer at the Department of Industrial Engineering and Management, IIT Kharagpur, where he also completed his BTech (Industrial Engineering).
Qualification
- PhD (Computer Science), Indian Statistical Institute
- MTech (Computer Science)
- Fellow (Mathematics for Management), IIM Calcutta
- BTech (Honours, Industrial Engineering), IIT Kharagpur
Experience
Teaching – 8 years
Courses taught
PhD programme
- Advanced Cryptography
MTech programme
- Blockchain Security
- Cryptography
BTech programme
- Game Theory
- Theory of Computation
- Discrete Mathematics
- Design and Analysis of Algorithms
- Data Structures
- Numerical Methods for Data Science
- Blockchain Technology and Applications
Research area(s)
- Facility Location
- Computational Geometry
- Oriented Cliques
Publications
Research papers
- S. Das, A. Nandy and S. Sarvottamananda, “Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions,” Discret. Appl. Math., vol. 305, pp. 311-328, 2021, DOI: 10.1016/j.dam.2020.10.021.
- S. Das, A. Nandy and S. Sarvottamananda, “Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints,” Discret. Appl. Math., vol. 280, pp.71-85, 2020, DOI: 10.1016/j.dam.2019.09.009.
- S. Das, A. Nandy and S. Sarvottamananda, “Optimizing movement in convex and non-convex path-networks to establish connectivity,” Discret. Appl. Math., vol. 286,pp. 62-77, 2020, DOI: 10.1016/j.dam.2019.04.028.
- A. Nandy, S. Sen and É. Sopena, “Outerplanar and Planar Oriented Cliques. J,” Graph Theory, vol. 82, no. 2, pp.165-193, 2016, DOI: 10.1002/jgt.21893.
Awards and recognition
- Sunity Kumar Pal Gold Medal for Best Dissertation in MTech (Computer Science) at the 46th Convocation of ISI Kolkata. Dissertation: Modifications of Bos and Coster’s Heuristics in search of a shorter addition chain for faster exponentiation