Get started
Author

Soumen Nandi

A lower bound technique for radio k -coloring
2017 · Sandip Das, Sasthi C. Ghosh, et al. · Discrete Mathematics · 29
PDF
On Chromatic Number of Colored Mixed Graphs
2017 · Sandip Das, Soumen Nandi, et al. · Lecture notes in computer science · 13
PDF
Retailers optimal pricing and economic order quantity in stock and price sensitive demand environment
2012 · Shibaji Panda, Subrata Saha, et al. · International Journal of Operational Research · 10
Pushable chromatic number of graphs with degree constraints
2020 · Julien Bensmail, Sandip Das, et al. · Discrete Mathematics · 8
On oriented cliques with respect to push operation
2017 · Julien Bensmail, Soumen Nandi, et al. · Discrete Applied Mathematics · 8
On the signed chromatic number of some classes of graphs
2021 · Julien Bensmail, Sandip Das, et al. · Discrete Mathematics · 6
On the pushable chromatic number of various types of grids
2023 · Julien Bensmail, Tapas Das, et al. · Discrete Applied Mathematics · 5
PDF
On Chromatic Number of (n, m)-graphs
2021 · Abhiruk Lahiri, Soumen Nandi, et al. · Trends in mathematics · 5
On radio k-labeling of the power of the infinite path
2023 · Tapas Das, Tuomo Lehtilä, et al. · Information Processing Letters · 4
Enumeration of edge-critical underlying absolute planar cliques for signed graphs.
2020 · Julien Bensmail, Soumen Nandi, et al. · HAL · 4
Chromatic number of signed graphs with bounded maximum degree
2016 · Das, Sandip, Nandi, Soumen, et al. · arXiv (Cornell University) · 4
PDF
A linear algorithm for radio k-coloring of powers of paths having small diameters
2024 · Dipayan Chakraborty, Soumen Nandi, et al. · Journal of Computer and System Sciences · 3
PDF
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10
2020 · Soura Sena Das, Soumen Nandi, et al. · Lecture notes in computer science · 3
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model
2019 · Sanjib Sadhu, Sasanka Roy, et al. · Fundamenta Informaticae · 3
On L(k,k−1,…,1) labeling of triangular lattice
2015 · Soumen Nandi, Sagnik Sen, et al. · Electronic Notes in Discrete Mathematics · 3
On clique numbers of colored mixed graphs
2022 · Dipayan Chakraborty, Sandip Das, et al. · Discrete Applied Mathematics · 2
PDF
The Relative Signed Clique Number of Planar Graphs is 8
2019 · Sandip Das, Soumen Nandi, et al. · Lecture notes in computer science · 2
Optimal L(3,2,1) -labeling of triangular lattice
2017 · Sandip Das, Sasthi C. Ghosh, et al. · Discrete Applied Mathematics · 2
PDF
On locating and neighbor-locating colorings of sparse graphs
2024 · Dipayan Chakraborty, Florent Foucaud, et al. · Discrete Applied Mathematics · 1
PDF
Oriented total-coloring of oriented graphs
2024 · Julien Bensmail, Sandip Das, et al. · Discrete Mathematics · 1
PDF
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs
2023 · Dipayan Chakraborty, Florent Foucaud, et al. · Lecture notes in computer science · 1
PDF
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter
2023 · Dipayan Chakraborty, Soumen Nandi, et al. · Lecture notes in computer science · 1
PDF
On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs
2022 · Soumen Nandi, Sagnik Sen, et al. · Lecture notes in computer science · 1
On relative clique number of colored mixed graphs
2018 · Das, Sandip, Nandi, Soumen, et al. · arXiv (Cornell University) · 1
PDF
Approximation algorithms for the two-center problem of convex polygon
2015 · Sadhu, Sanjib, Roy, Sasanka, et al. · arXiv (Cornell University) · 1
PDF
Works count: 39
Citation count: 121
H-index: 6
I10-index: 3
Year
Topic
Type