Research interests
My research interest is primarily on structural graph theory. However, I have also worked a bit on algorithmic graph theory. Among different topics inside graph theory, I have worked on homomorphisms of different types of graphs, such as, oriented graphs, signed graphs, colored mixed graphs, etc. This is my main research area. Apart from that, I have also worked on a variety of graph theoretic models of the Channel Assignment Problem (CAP). My work in this topic revolves around variants of the radio labeling or the L(2,1)-labeling problems. I have also worked on geometric graphs, Cops and robber game, graph burning, graph modification problems, etc. Overall, I am open to working on any graph related topic that interests me, provided I am up to it.
Journal publications
[j19] Sandip Das, Harmender Gahlawat, Uma kant Sahoo, Sagnik Sen:
Cops and robber on some families of oriented graphs. Theoretical Computer Science (2021)
[j18] Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen:
On rectangle intersection graphs with stab number at most two. Discrete Applied Mathematics 289: 354-365 (2021)
[j17] Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena:
Pushable chromatic number of graphs with degree constraints. Discrete Mathematics 344(1): 112151 (2021)
[j16] Sandip Das, Prantar Ghosh, Shamik Ghosh, Sagnik Sen:
Oriented bipartite graphs and the Goldbach graph. Discrete Mathematics 344(9): 112497 (2021)
[j15] Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen:
Enumeration of edge-critical underlying absolute planar cliques for signed graphs. Australasian Journal of Combinatorics 77: 117-135 (2020)
[j14] Reza Naserasr, Sagnik Sen, Eric Sopena:
The homomorphism order of signed graphs. Journal of combinatorial mathematics and combinatorial computing (2020)
[j13] Sandip Das, Prantar Ghosh, Swathy Prabhu, Sagnik Sen:
Relative clique number of planar signed graphs. Discrete Applied Mathematics 280: 86-92 (2020)
[j12] Sandip Das, Swathy Prabhu, Sagnik Sen:
A study on oriented relative clique number. Discrete Mathematics 341(7): 2049-2057 (2018)
[j11] Julien Bensmail, Soumen Nandi, Sagnik Sen:
On oriented cliques with respect to push operation. Discrete Applied Mathematics 232: 50-63 (2017)
[j10] Sandip Das, Sasthi C. Ghosh, Soumen Nandi, Sagnik Sen:
A lower bound technique for radio k-coloring. Discrete Mathematics 340(5): 855-861 (2017)
[j9] Sagnik Sen:
On homomorphisms of oriented graphs with respect to the push operation. Discrete Mathematics 340(8): 1986-1995 (2017)
[j8] Julien Bensmail, Christopher Duffy, Sagnik Sen:
Analogues of Cliques for (m, n)-Colored Mixed Graphs. Graphs and Combinatorics 33(4): 735-750 (2017)
[j7] Pascal Ochem, Alexandre Pinlou, Sagnik Sen:
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. Journal of Graph Theory 85(1): 258-277 (2017)
[j6] Reza Naserasr, Sagnik Sen, Qiang Sun:
Walk-Powers and Homomorphism Bounds of Planar Signed Graphs. Graphs and Combinatorics 32(4): 1505-1519 (2016)
[j5] Ayan Nandy, Sagnik Sen, Éric Sopena:
Outerplanar and Planar Oriented Cliques. Journal of Graph Theory 82(2): 165-193 (2016)
[j4] Soumen Nandi, Sagnik Sen, Sasthi C. Ghosh, Sandip Das:
On L(k, k-1, ..., 1) labeling of triangular lattice. Electronic Notes in Discrete Mathematics 48: 281-288 (2015)
[j3] Sandip Das, Swathyprabhu Mj, Sagnik Sen:
On oriented relative clique number. Electronic Notes Discrete Mathematics 50: 95-101 (2015)
[j2] Sagnik Sen:
L(2, 1)-labelings of some famillies of oriented planar graphs. Discussiones Mathematicae Graph Theory 34(1): 31-48 (2014)
2011
[j1] Sagnik Sen:
2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs. Electronic Notes in Discrete Mathematics 38: 771-776 (2011)
Conference publications
[c11] Soura Sena Das, Soumen Nandi, Sagnik Sen:
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. CALDAM 2020: 260-266
[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
[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
2017
[c5] Sandip Das, Soumen Nandi, Sagnik Sen:
On Chromatic Number of Colored Mixed Graphs. CALDAM 2017: 130-140
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
[c2] Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On a Special Class of Boxicity 2 Graphs. CALDAM 2015: 157-168
[c1] Sagnik Sen:
Maximum Order of a Planar Oclique Is 15. IWOCA 2012: 130-142
Submitted articles
[s5] Susobhan Bandopadhyay, Soumen Nandi, Sagnik Sen, S Taruni:
Proving the conjecture on $(n,m)$-absolute clique number of planar graphs.
submitted version
[s4] Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, and
D K Supraja:
A linear algorithm for radio k-coloring powers of
paths having small diameter.
submitted version
[s3] Sagnik Sen, Eric Sopena, S Taruni:
Homomorphisms of $(n,m)$-graphs with respect to generalized switch.
submitted version
[s2] Soura Sen Das, Zin Mar Myint, Soumen Nandi, Sagnik Sen, Eric Sopena:
A generalization of Brussels sprouts.
submitted version
[s1] Tapas Das, Tuomo Lehtila, Soumen Nandi,
Sagnik Sen, D K Supraja, Sagnik Sen:
On radio k-coloring of the power of an infinite path.
submitted version