| Outerplanar and planar oriented cliques A Nandy, S Sen, É Sopena Journal of Graph Theory 82 (2), 165-193, 2016 | 24 | 2016 |
| Linear Time Algorithm for 1-Center in Under Convex Polyhedral Distance Function S Das, A Nandy, S Sarvottamananda International Workshop on Frontiers in Algorithmics, 41-52, 2016 | 5 | 2016 |
| Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions S Das, A Nandy, S Sarvottamananda Conference on Algorithms and Discrete Applied Mathematics, 283-300, 2018 | 3 | 2018 |
| Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints S Das, A Nandy, S Sarvottamananda Discrete Applied Mathematics 280, 71-85, 2020 | 2 | 2020 |
| Oriented Total-Coloring of Oriented Graphs J Bensmail, S Das, S Nandi, A Nandy, T Pierron, S Prabhu, S Sen Université côte d'azur; Université lyon 1, 2022 | | 2022 |
| Optimizing movement in convex and non-convex path-networks to establish connectivity S Das, A Nandy Discrete Applied Mathematics 286, 62-77, 2020 | | 2020 |
| On some variants of the center location problem A Nandy Indian Statistical Institute, 2018 | | 2018 |
| A Facility Coloring Problem in 1-D S Das, A Maheshwari, A Nandy, M Smid International Conference on Algorithmic Applications in Management, 88-99, 2014 | | 2014 |
| A facility coloring problem in 1-D A Maheshwari, A Nandy, M Smid, S Das Springer International Publishing, 2014 | | 2014 |
| Modification of bos & coster's heuristics in search of a shorter addition chain for faster exponentiation A Nandy PQDT-Global, 2011 | | 2011 |
Sandip DasProfessor, Indian Statistical Institute在 isical.ac.in 的电子邮件经过验证
