default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoumen Nandi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j17]Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja
:
A linear algorithm for radio k-coloring of powers of paths having small diameters. J. Comput. Syst. Sci. 147: 103577 (2025)- 2024
- [j16]Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
On locating and neighbor-locating colorings of sparse graphs. Discret. Appl. Math. 358: 366-381 (2024) - [j15]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: 417-428 (2024) - [j14]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): 114174 (2024) - 2023
- [j13]Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. Discret. Appl. Math. 324: 29-40 (2023) - [j12]Julien Bensmail, Tapas Das, Dimitri Lajou, Soumen Nandi, Sagnik Sen:
On the pushable chromatic number of various types of grids. Discret. Appl. Math. 329: 140-154 (2023) - [j11]Tapas Das, Tuomo Lehtilä, Soumen Nandi, Sagnik Sen, D. K. Supraja:
On radio k-labeling of the power of the infinite path. Inf. Process. Lett. 182: 106386 (2023) - [c9]Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. CALDAM 2023: 121-133 - [c8]Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja:
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. IWOCA 2023: 148-159 - [i12]Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
New bounds and constructions for neighbor-locating colorings of graphs. CoRR abs/2301.13557 (2023) - [i11]Soumen Nandi, Sagnik Sen, S. Taruni:
On relative clique number of triangle-free planar (n, m)-graphs. CoRR abs/2306.08052 (2023) - [i10]Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni:
An update on (n, m)-chromatic numbers. CoRR abs/2306.08069 (2023) - 2022
- [j10]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): 112664 (2022) - [c7]Soumen Nandi, Sagnik Sen, S. Taruni:
On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. IWOCA 2022: 439-450 - [i9]Soura Sena Das, Soumen Nandi, Sagnik Sen:
The oriented relative clique number of triangle-free planar graphs is 10. CoRR abs/2208.10188 (2022) - 2021
- [j9]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): 112151 (2021) - [i8]Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. CoRR abs/2104.07416 (2021) - 2020
- [j8]Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen:
Enumeration of edge-critical underlying absolute planar cliques for signed graphs. Australas. J Comb. 77: 117-135 (2020) - [j7]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): 421-443 (2020) - [c6]Soura Sena Das, Soumen Nandi, Sagnik Sen:
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. CALDAM 2020: 260-266 - [i7]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena:
On the signed chromatic number of some classes of graphs. CoRR abs/2009.12059 (2020)
2010 – 2019
- 2019
- [j6]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: 276-278 (2019) - [j5]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): 119-138 (2019) - [c5]Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth:
The Relative Signed Clique Number of Planar Graphs is 8. CALDAM 2019: 245-253 - [i6]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena:
Pushable chromatic number of graphs with degree constraints. CoRR abs/1911.09909 (2019) - 2018
- [c4]Sandip Das, Soumen Nandi, Sagnik Sen:
On Oriented L(p, 1)-labeling. CALDAM 2018: 274-282 - [i5]Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On relative clique number of colored mixed graphs. CoRR abs/1810.05503 (2018) - [i4]Julien Bensmail, Soumen Nandi, Sagnik Sen:
Erratum for "On oriented cliques with respect to push operation". CoRR abs/1810.08660 (2018) - 2017
- [j4]Sandip Das, Sasthi C. Ghosh, Soumen Nandi:
Optimal L(3, 2, 1)-labeling of triangular lattice. Discret. Appl. Math. 228: 32-40 (2017) - [j3]Julien Bensmail, Soumen Nandi, Sagnik Sen:
On oriented cliques with respect to push operation. Discret. Appl. Math. 232: 50-63 (2017) - [j2]Sandip Das, Sasthi C. Ghosh, Soumen Nandi, Sagnik Sen:
A lower bound technique for radio k-coloring. Discret. Math. 340(5): 855-861 (2017) - [c3]Sandip Das, Soumen Nandi, Sagnik Sen:
On Chromatic Number of Colored Mixed Graphs. CALDAM 2017: 130-140 - [c2]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: 509-524 - 2015
- [j1]Soumen Nandi, Sagnik Sen, Sasthi C. Ghosh, Sandip Das:
On L(k, k-1, ..., 1) labeling of triangular lattice. Electron. Notes Discret. Math. 48: 281-288 (2015) - [i3]Sandip Das, Soumen Nandi, Sagnik Sen:
On chromatic number of colored mixed graphs. CoRR abs/1508.07222 (2015) - [i2]Julien Bensmail, Soumen Nandi, Sagnik Sen:
On oriented cliques with respect to push operation. CoRR abs/1511.08672 (2015) - [i1]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy:
Approximation algorithms for the two-center problem of convex polygon. CoRR abs/1512.02356 (2015) - 2014
- [c1]Soumen Nandi, Nitish Panigrahy, Mohit Agrawal, Sasthi Charan Ghosh, Sandip Das:
Efficient channel assignment for cellular networks modeled as honeycomb grid. ICTCS 2014: 183-295
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
