Soumen Nandi

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