default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSagnik Sen 0001
Person information
- affiliation: Indian Institute of Technology Dharwad (IIT Dharwad), Dharwad, KA, India
Other persons with the same name
- Sagnik Sen 0002
![[0000-0002-3362-1677]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-3362-1677")
— New England Biolabs Inc., Ipswich, MA, USA (and 1 more) - Sagnik Sen 0003 — University College London, Institute of Ophthalmology, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j34]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
- [j33]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) - [j32]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) - [j31]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) - [j30]Soumen Nandi, Sagnik Sen, S. Taruni:
On Coloring Parameters of Triangle-Free Planar (n, m)-Graphs. Graphs Comb. 40(6): 117 (2024) - [c18]Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni:
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. CALDAM 2024: 29-43 - [i30]Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni:
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. CoRR abs/2403.09122 (2024) - [i29]Tapas Das, Florent Foucaud, Clara Marcille, Pavan P. D, Sagnik Sen:
Monitoring arc-geodetic sets of oriented graphs. CoRR abs/2409.00350 (2024) - [i28]Susobhan Bandopadhyay, Sagnik Sen, S. Taruni:
A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs. CoRR abs/2409.05678 (2024) - [i27]Florent Foucaud, Clara Marcille, R. B. Sandeep, Sagnik Sen, S. Taruni:
Algorithms and complexity for monitoring edge-geodetic sets in graphs. CoRR abs/2409.19067 (2024) - 2023
- [j29]Sandip Das, Sumitava Ghosh, Swathy Prabhu, Sagnik Sen:
A Homomorphic Polynomial for Oriented Graphs. Electron. J. Comb. 30(1) (2023) - [j28]Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. Discret. Appl. Math. 324: 29-40 (2023) - [j27]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) - [j26]Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen:
Triangle-free projective-planar graphs with diameter two: Domination and characterization. Discret. Appl. Math. 331: 11-24 (2023) - [j25]Tapas Das, Sagnik Sen:
Pushable chromatic number of graphs with maximum average degree at most 145. Discret. Appl. Math. 334: 163-171 (2023) - [j24]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) - [j23]Christopher Duffy, Pavan P. D, Sandeep R. B., Sagnik Sen:
On deeply critical oriented cliques. J. Graph Theory 104(1): 150-159 (2023) - [c17]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 - [c16]Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Oriented Graphs with Respect to Push Operation. CALDAM 2023: 309-320 - [c15]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 - [c14]Harmender Gahlawat, Zin Mar Myint, Sagnik Sen:
Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement). LAGOS 2023: 379-381 - [i26]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) - [i25]Sandip Das, Koushik Kumar Dey, Pavan P. D, Sagnik Sen:
Counting the minimum number of arcs in an oriented graph having weak diameter 2. CoRR abs/2304.00742 (2023) - [i24]Soumen Nandi, Sagnik Sen, S. Taruni:
On relative clique number of triangle-free planar (n, m)-graphs. CoRR abs/2306.08052 (2023) - [i23]Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni:
An update on (n, m)-chromatic numbers. CoRR abs/2306.08069 (2023) - [i22]Harmender Gahlawat, Zin Mar Myint, Sagnik Sen:
Cops and robber on variants of retracts and subdivisions of oriented graphs. CoRR abs/2307.00584 (2023) - 2022
- [j22]Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini:
On Subgraph Complementation to H-free Graphs. Algorithmica 84(10): 2842-2870 (2022) - [j21]Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen:
On fractional version of oriented coloring. Discret. Appl. Math. 316: 33-42 (2022) - [j20]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) - [c13]Soumen Nandi, Sagnik Sen, S. Taruni:
On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. IWOCA 2022: 439-450 - [i21]Sagnik Sen, Éric Sopena, S. Taruni:
Homomorphisms of (n, m)-graphs with respect to generalised switch. CoRR abs/2204.01258 (2022) - [i20]Soura Sena Das, Soumen Nandi, Sagnik Sen:
The oriented relative clique number of triangle-free planar graphs is 10. CoRR abs/2208.10188 (2022) - [i19]Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen:
Triangle-free projective-planar graphs with diameter two: domination and characterization. CoRR abs/2212.04253 (2022) - 2021
- [j19]Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen:
On rectangle intersection graphs with stab number at most two. Discret. Appl. Math. 289: 354-365 (2021) - [j18]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) - [j17]Sandip Das, Prantar Ghosh, Shamik Ghosh, Sagnik Sen:
Oriented bipartite graphs and the Goldbach graph. Discret. Math. 344(9): 112497 (2021) - [j16]Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on some families of oriented graphs. Theor. Comput. Sci. 888: 31-40 (2021) - [c12]Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini:
On Subgraph Complementation to H-free Graphs. WG 2021: 118-129 - [i18]Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini:
On subgraph complementation to H-free graphs. CoRR abs/2103.02936 (2021) - [i17]Christopher Duffy, Pavan P. D, Sandeep R. B., Sagnik Sen:
On Deeply Critical Oriented Cliques. CoRR abs/2103.17140 (2021) - [i16]Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. CoRR abs/2104.07416 (2021) - [i15]Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen:
On fractional version of oriented coloring. CoRR abs/2107.13443 (2021) - 2020
- [j15]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) - [j14]Sandip Das, Prantar Ghosh, Swathy Prabhu, Sagnik Sen:
Relative clique number of planar signed graphs. Discret. Appl. Math. 280: 86-92 (2020) - [c11]Soura Sena Das, Soumen Nandi, Sagnik Sen:
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. CALDAM 2020: 260-266 - [i14]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
- [j13]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) - [c10]Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen:
On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM 2019: 124-137 - [c9]Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth:
The Relative Signed Clique Number of Planar Graphs is 8. CALDAM 2019: 245-253 - [c8]Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Some Families of Oriented Graphs. IWOCA 2019: 188-200 - [i13]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
- [j12]Sandip Das, Swathy Prabhu, Sagnik Sen:
A study on oriented relative clique number. Discret. Math. 341(7): 2049-2057 (2018) - [c7]Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen:
Burning Spiders. CALDAM 2018: 155-163 - [c6]Sandip Das, Soumen Nandi, Sagnik Sen:
On Oriented L(p, 1)-labeling. CALDAM 2018: 274-282 - [i12]Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On relative clique number of colored mixed graphs. CoRR abs/1810.05503 (2018) - [i11]Julien Bensmail, Soumen Nandi, Sagnik Sen:
Erratum for "On oriented cliques with respect to push operation". CoRR abs/1810.08660 (2018) - 2017
- [j11]Julien Bensmail, Soumen Nandi, Sagnik Sen:
On oriented cliques with respect to push operation. Discret. Appl. Math. 232: 50-63 (2017) - [j10]Sandip Das, Sasthi C. Ghosh, Soumen Nandi, Sagnik Sen:
A lower bound technique for radio k-coloring. Discret. Math. 340(5): 855-861 (2017) - [j9]Sagnik Sen:
On homomorphisms of oriented graphs with respect to the push operation. Discret. Math. 340(8): 1986-1995 (2017) - [j8]Julien Bensmail, Christopher Duffy, Sagnik Sen:
Analogues of Cliques for (m, n)-Colored Mixed Graphs. Graphs Comb. 33(4): 735-750 (2017) - [j7]Pascal Ochem, Alexandre Pinlou, Sagnik Sen:
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. J. Graph Theory 85(1): 258-277 (2017) - [c5]Sandip Das, Soumen Nandi, Sagnik Sen:
On Chromatic Number of Colored Mixed Graphs. CALDAM 2017: 130-140 - 2016
- [j6]Reza Naserasr, Sagnik Sen, Qiang Sun:
Walk-Powers and Homomorphism Bounds of Planar Signed Graphs. Graphs Comb. 32(4): 1505-1519 (2016) - [j5]Ayan Nandy, Sagnik Sen, Éric Sopena:
Outerplanar and Planar Oriented Cliques. J. Graph Theory 82(2): 165-193 (2016) - [c4]Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen:
Relative Clique Number of Planar Signed Graphs. CALDAM 2016: 326-336 - [c3]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On Local Structures of Cubicity 2 Graphs. COCOA 2016: 254-269 - [i10]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On a special class of boxicity 2 graphs. CoRR abs/1603.09561 (2016) - [i9]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On local structures of cubicity 2 graphs. CoRR abs/1603.09570 (2016) - [i8]Sandip Das, Shamik Ghosh, Prantar Ghosh, Sagnik Sen:
Oriented Bipartite Graphs and the Goldbach Graph. CoRR abs/1611.10259 (2016) - 2015
- [j4]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) - [j3]Sandip Das, Swathyprabhu Mj, Sagnik Sen:
On oriented relative clique number. Electron. Notes Discret. Math. 50: 95-101 (2015) - [c2]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On a Special Class of Boxicity 2 Graphs. CALDAM 2015: 157-168 - [i7]Reza Naserasr, Sagnik Sen, Qiang Sun:
Walk-powers and homomorphism bound of planar graphs. CoRR abs/1501.05089 (2015) - [i6]Sagnik Sen:
On homomorphism of oriented graphs with respect to push operation. CoRR abs/1508.07217 (2015) - [i5]Sandip Das, Soumen Nandi, Sagnik Sen:
On chromatic number of colored mixed graphs. CoRR abs/1508.07222 (2015) - [i4]Julien Bensmail, Soumen Nandi, Sagnik Sen:
On oriented cliques with respect to push operation. CoRR abs/1511.08672 (2015) - 2014
- [j2]Sagnik Sen:
L(2, 1)-labelings of some famillies of oriented planar graphs. Discuss. Math. Graph Theory 34(1): 31-48 (2014) - [i3]Pascal Ochem, Alexandre Pinlou, Sagnik Sen:
Homomorphisms of signed planar graphs. CoRR abs/1401.3308 (2014) - [i2]Ayan Nandy, Sagnik Sen, Éric Sopena:
Outerplanar and planar oriented cliques. CoRR abs/1411.7192 (2014) - [i1]Julien Bensmail, Christopher Duffy, Sagnik Sen:
On cliques of signed and switchable signed graphs. CoRR abs/1411.7376 (2014) - 2012
- [c1]Sagnik Sen:
Maximum Order of a Planar Oclique Is 15. IWOCA 2012: 130-142 - 2011
- [j1]Sagnik Sen:
2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs. Electron. Notes Discret. Math. 38: 771-776 (2011)
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-12-01 01:10 CET 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:
