Efficient channel assignment for cellular networks modeled as honeycomb grid. - Soumen Nandi; Nitish Panigrahy; Mohit Agrawal; Sasthi Charan Ghosh; Sandip Das 001 (ICTCS, 2014)

Approximation algorithms for the two-center problem of convex polygon. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Anil Maheshwari; Subhas C. Nandy (CoRR, 2015)

On L(k, k-1, ..., 1) labeling of triangular lattice. - Soumen Nandi; Sagnik Sen 001; Sasthi C. Ghosh 001; Sandip Das 001 (Electron. Notes Discret. Math., 2015)

On Chromatic Number of Colored Mixed Graphs. - Sandip Das 001; Soumen Nandi; Sagnik Sen 001 (CALDAM, 2017)

Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Subhas C. Nandy; Suchismita Roy (ICCSA (2), 2017)

On oriented cliques with respect to push operation. - Julien Bensmail; Soumen Nandi; Sagnik Sen 001 (Discret. Appl. Math., 2017)

Optimal L(3, 2, 1)-labeling of triangular lattice. - Sandip Das 001; Sasthi C. Ghosh 001; Soumen Nandi (Discret. Appl. Math., 2017)

A lower bound technique for radio k-coloring. - Sandip Das 001; Sasthi C. Ghosh 001; Soumen Nandi; Sagnik Sen 001 (Discret. Math., 2017)

On Oriented L(p, 1)-labeling. - Sandip Das 001; Soumen Nandi; Sagnik Sen 001 (CALDAM, 2018)

On relative clique number of colored mixed graphs. - Sandip Das 001; Soumen Nandi; Debdeep Roy; Sagnik Sen 001 (CoRR, 2018)

Erratum for "On oriented cliques with respect to push operation". - Julien Bensmail; Soumen Nandi; Sagnik Sen 001 (CoRR, 2018)

The Relative Signed Clique Number of Planar Graphs is 8. - Sandip Das 001; Soumen Nandi; Sagnik Sen 001; Ritesh Seth (CALDAM, 2019)

Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63]. - Julien Bensmail; Soumen Nandi; Sagnik Sen 001 (Discret. Appl. Math., 2019)

Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Anil Maheshwari; Subhas C. Nandy (Fundam. Informaticae, 2019)

The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. - Soura Sena Das; Soumen Nandi; Sagnik Sen 001 (CALDAM, 2020)

Enumeration of edge-critical underlying absolute planar cliques for signed graphs. - Julien Bensmail; Soumen Nandi; Mithun Roy; Sagnik Sen 001 (Australas. J Comb., 2020)

Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Subhas C. Nandy; Suchismita Roy (Int. J. Found. Comput. Sci., 2020)

Pushable chromatic number of graphs with degree constraints. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Soumyajit Paul; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2021)

On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. - Soumen Nandi; Sagnik Sen 001; S. Taruni (IWOCA, 2022)

The oriented relative clique number of triangle-free planar graphs is 10. - Soura Sena Das; Soumen Nandi; Sagnik Sen 001 (CoRR, 2022)

On the signed chromatic number of some classes of graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2022)

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 relative clique number of triangle-free planar (n, m)-graphs. - Soumen Nandi; Sagnik Sen 001; S. Taruni (CoRR, 2023)

An update on (n, m)-chromatic numbers. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (CoRR, 2023)

On clique numbers of colored mixed graphs. - Dipayan Chakraborty; Sandip Das 001; Soumen Nandi; Debdeep Roy; Sagnik Sen 001 (Discret. Appl. Math., 2023)

On the pushable chromatic number of various types of grids. - Julien Bensmail; Tapas Das; Dimitri Lajou; Soumen Nandi; Sagnik Sen 001 (Discret. Appl. Math., 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)

On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (Discret. Appl. Math., 2024)

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)

On Coloring Parameters of Triangle-Free Planar (n, m)-Graphs. - Soumen Nandi; Sagnik Sen 001; S. Taruni (Graphs Comb., 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)