A Facility Coloring Problem in 1-D. - Sandip Das 001; Anil Maheshwari; Ayan Nandy; Michiel H. M. Smid (AAIM, 2014)

Linear Time Algorithms for Euclidean 1-Center in mathfrak R^d with Non-linear Convex Constraints. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (CALDAM, 2016)

Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (FAW, 2016)

Outerplanar and Planar Oriented Cliques. - Ayan Nandy; Sagnik Sen 001; Éric Sopena (J. Graph Theory, 2016)

Optimizing movement in convex and non-convex path-networks to establish connectivity. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (Discret. Appl. Math., 2020)

Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (Discret. Appl. Math., 2020)

Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (Discret. Appl. Math., 2021)

Oriented total-coloring of oriented graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Ayan Nandy; Théo Pierron; Swathy Prabhu; Sagnik Sen 001 (Discret. Math., 2024)