Soumen Nandi

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 36

Top Topics

Maximal Clique Enumeration

Manual Labeling

Top Venues

Discret. Appl. Math.

Publications

Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
On locating and neighbor-locating colorings of sparse graphs. Discret. Appl. Math. 358 (2024)
Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. Discret. Appl. Math. 358 (2024)
Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen
Oriented total-coloring of oriented graphs. Discret. Math. 347 (12) (2024)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. CALDAM (2023)
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. IWOCA (2023)
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On clique numbers of colored mixed graphs. Discret. Appl. Math. 324 (2023)
Julien Bensmail, Tapas Das, Dimitri Lajou, Soumen Nandi, Sagnik Sen
On the pushable chromatic number of various types of grids. Discret. Appl. Math. 329 (2023)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
New bounds and constructions for neighbor-locating colorings of graphs. CoRR (2023)
Tapas Das, Tuomo Lehtilä, Soumen Nandi, Sagnik Sen, D. K. Supraja
-labeling of the power of the infinite path. Inf. Process. Lett. 182 (2023)
Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
An update on (n, m)-chromatic numbers. CoRR (2023)
Soumen Nandi, Sagnik Sen, S. Taruni
On relative clique number of triangle-free planar (n, m)-graphs. CoRR (2023)
Soumen Nandi, Sagnik Sen, S. Taruni
On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. IWOCA (2022)
Soura Sena Das, Soumen Nandi, Sagnik Sen
The oriented relative clique number of triangle-free planar graphs is 10. CoRR (2022)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
On the signed chromatic number of some classes of graphs. Discret. Math. 345 (2) (2022)
Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena
Pushable chromatic number of graphs with degree constraints. Discret. Math. 344 (1) (2021)
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On clique numbers of colored mixed graphs. CoRR (2021)
Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen
Enumeration of edge-critical underlying absolute planar cliques for signed graphs. Australas. J Comb. 77 (2020)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy
Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. Int. J. Found. Comput. Sci. 31 (4) (2020)
Soura Sena Das, Soumen Nandi, Sagnik Sen
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. CALDAM (2020)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
On the signed chromatic number of some classes of graphs. CoRR (2020)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. Fundam. Informaticae 164 (1) (2019)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena
Pushable chromatic number of graphs with degree constraints. CoRR (2019)
Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth
The Relative Signed Clique Number of Planar Graphs is 8. CALDAM (2019)
Julien Bensmail, Soumen Nandi, Sagnik Sen
Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63]. Discret. Appl. Math. 258 (2019)
Sandip Das, Soumen Nandi, Sagnik Sen
On Oriented L(p, 1)-labeling. CALDAM (2018)
Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On relative clique number of colored mixed graphs. CoRR (2018)
Julien Bensmail, Soumen Nandi, Sagnik Sen
Erratum for "On oriented cliques with respect to push operation". CoRR (2018)
Julien Bensmail, Soumen Nandi, Sagnik Sen
On oriented cliques with respect to push operation. Discret. Appl. Math. 232 (2017)
Sandip Das, Sasthi C. Ghosh, Soumen Nandi, Sagnik Sen
A lower bound technique for radio k-coloring. Discret. Math. 340 (5) (2017)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy
Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. ICCSA (2) (2017)
Sandip Das, Soumen Nandi, Sagnik Sen
On Chromatic Number of Colored Mixed Graphs. CALDAM (2017)
Sandip Das, Sasthi C. Ghosh, Soumen Nandi
Optimal L(3, 2, 1)-labeling of triangular lattice. Discret. Appl. Math. 228 (2017)
Sandip Das, Soumen Nandi, Sagnik Sen
On chromatic number of colored mixed graphs. CoRR (2015)
Julien Bensmail, Soumen Nandi, Sagnik Sen
On oriented cliques with respect to push operation. CoRR (2015)
Soumen Nandi, Sagnik Sen, Sasthi C. Ghosh, Sandip Das
On L(k, k-1, ..., 1) labeling of triangular lattice. Electron. Notes Discret. Math. 48 (2015)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
Approximation algorithms for the two-center problem of convex polygon. CoRR (2015)
Soumen Nandi, Nitish Panigrahy, Mohit Agrawal, Sasthi Charan Ghosh, Sandip Das
Efficient channel assignment for cellular networks modeled as honeycomb grid. ICTCS (2014)