Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function
Sandip Das , Ayan Nandy , Swami Sarvottamananda
International Workshop on Frontiers in Algorithmics 41 -52
3
2016
Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions
Sandip Das , Ayan Nandy , Swami Sarvottamananda
Conference on Algorithms and Discrete Applied Mathematics 283 -300
2018
A Facility Coloring Problem in 1-D
Sandip Das , Anil Maheshwari , Ayan Nandy , Michiel Smid
Algorithmic Aspects in Information and Management 88 -99
2014
Optimizing movement in convex and non-convex path-networks to establish connectivity
Sandip Das , Ayan Nandy , Sarvottamananda
Discrete Applied Mathematics 286 62 -77
2020
Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints
Sandip Das , Ayan Nandy , Swami Sarvottamananda
Discrete Applied Mathematics 280 71 -85
2020
Outerplanar and Planar Oriented Cliques
Ayan Nandy , Sagnik Sen , Éric Sopena
Journal of Graph Theory 82 ( 2) 165 -193
11
2016
Oriented Total-Coloring of Oriented Graphs
Julien Bensmail , Sandip Das , Soumen Nandi , Ayan Nandy
Université côte d'azur; Université lyon 1
2022
On some variants of the center location problem
Ayan Nandy
Indian Statistical Institute
2018
Modification of bos & coster's heuristics in search of a shorter addition chain for faster exponentiation
Ayan Nandy
Indian Statistical Institute-Kolkata
2011