New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. - Dipayan Chakraborty; Florent Foucaud; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (CALDAM, 2023)

A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. - Dipayan Chakraborty; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (IWOCA, 2023)

On radio k-labeling of the power of the infinite path. - Tapas Das; Tuomo Lehtilä; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (Inf. Process. Lett., 2023)

On locating and neighbor-locating colorings of sparse graphs. - Dipayan Chakraborty; Florent Foucaud; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (Discret. Appl. Math., 2024)

A linear algorithm for radio k-coloring of powers of paths having small diameters. - Dipayan Chakraborty; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (J. Comput. Syst. Sci., 2025)