Submitted:
On arc-density of pushably 3-critical oriented graphs. T. Das, P. D. Pavan, S. Sen, S. Taruni (submitted)
Journal publications:
A linear algorithm for radio k-coloring powers of paths having small diameter. D. Chakraborty, S. Nandi, S. Sen, D. K. Supraja. Journal of Computer and System Sciences (2024+)
Density of 3-critical signed graphs. L. Beaudou, P. Haxell, K. Nurse, S. Sen, Z. Wang. Journal of Graph Theory, (2024+)
Oriented Total-Coloring of Oriented Graphs. J. Bensmail, S. Das, S. Nandi, A. Nandy, T. Pierron, S. Prabhu, S. Sen. Discrete Mathematics, (2024+)
On locating and neighbor-locating colorings of sparse graphs. D. Chakraborty, F. Foucaud, S. Nandi, S. Sen, D. K. Supraja. Discrete Applied Mathematics, (accepted pending minor revision: 2024+)
On Deeply Critical Oriented Cliques. C. Duffy, P. PD, R.B. Sandeep, S. Sen. Journal of Graph Theory, (2023) 104(1): 150-159
A Homomorphic Polynomial for Oriented Graphs. S. Das, S. Ghosh, S. Prabhu, S. Sen. Electronic Journal of Combinatorics, (2023) 30(1)
On the pushable chromatic number of various types of grids. J. Bensmail, T. Das, D. Lajou, S. Nandi, S. Sen. Discrete Applied Mathematics, (2023) 329: 140-154
Triangle-free projective-planar graphs with diameter two: Domination and characterization. D. Chakraborty, S. Das, S. Mukherjee, U. Sahoo, S. Sen. Discrete Applied Mathematics, (2023) 331: 11-24
Pushable chromatic number of graphs with maximum average degree at most 14/5. T. Das, S. Sen. Discrete Applied Mathematics, (2023) 334: 163-171
On radio k-labeling of the power of the infinite path. T. Das, T. Lehtil ̈a, S. Nandi, S. Sen, D. K. Supraja. Information Processing Letters, (2023) 182: 106386
On clique numbers of colored mixed graphs. D. Chakraborty, S Das, S. Nandi, D. Roy, S. Sen. Discrete Applied Mathematics, (2023) 324: 29-40
On subgraph complementation to H-free graphs, D. Antony, J. Garchar, S. Pal, R. B. Sandeep, S. Sen, R. Subashini. Algorithmica, (2022) 84(10): 2842-2870
On the signed chromatic number of some classes of graphs. J. Bensmail, S. Das, S. Nandi, T. Pierron, S. Sen, E. Sopena. Discrete Mathematics, (2022) 345(2): 112664
On fractional version of oriented coloring. S. Das, S. Das, S. Prabhu, S. Sen. Discrete Applied Mathematics, (2022) 316: 33-42
Pushable chromatic number of graphs with degree constraints. J. Bensmail, S. Das, S. Nandi, S. Paul, T. Pierron, S. Sen, E. Sopena. Discrete Mathematics, (2021) 344(1): 112151
On rectangle intersection graphs with stab number at most two. D. Chakraborty, S. Das, M. C. Francis, S. Sen. Discrete Applied Mathematics, (2021) 289: 354-365
Oriented bipartite graphs and the Goldbach graph. S. Das, P. Ghosh, S. Ghosh, S. Sen. Discrete Mathematics, (2021) 344(9): 112497
Cops and robber on some families of oriented graphs. H. Gahlawat, S. Das, U. Sahoo, S. Sen. Theoretical Computer Science, (2021) 888(4): 31-40
Enumeration of edge-critical underlying absolute planar cliques for signed graphs. J. Bensmail, S. Nandi, M. Roy, S. Sen. Australasian Journal of Combinatorics, (2020) 77(1): 117-135
Relative clique number of planar signed graphs. S. Das, P. Ghosh, S. Prabhu, S. Sen. Discrete Applied Mathematics, (2020) 280: 86-92
The homomorphism order of signed graphs. R. Naserasr, S. Sen, E. Sopena. Journal of Combinatorial Mathematics and Combinatorial Computing, (2020) 77(1): 117-135
A study on oriented relative clique number. S. Das, S. Prabhu, S. Sen. Discrete Mathematics, (2018) 341(7): 2049-2057
A lower bound technique for radio k-coloring. S. Das, S. C. Ghosh, S. Nandi and S. Sen. Discrete Mathematics, (2017) 340(5): 855-861
Homomorphisms of 2-edge-colored triangle-free planar graphs. P. Ochem, A. Pinlou and S. Sen. Journal of Graph Theory, (2017) 85(1): 258-277
On homomorphism of oriented graphs with respect to push operation. S. Sen. Discrete Mathematics, (2017) 340(8): 1986-1995
Analogues of Cliques for (m, n)-Colored Mixed Graphs. J. Bensmail, C. Duffy, S. Sen. Graphs and Combinatorics, (2017) 33(4): 735-750
On oriented cliques with respect to push operation. J. Bensmail, S. Nandi, S. Sen. Discrete Applied Mathematics, (2017) 232: 50-63
Walk-powers and homomorphism bound of planar graphs. R. Naserasr, S. Sen and Q. Sun. Graphs and Combinatorics, (2015) 32(4): 1505-1519
Outerplanar and planar oriented cliques. A. Nandy, S. Sen and E. Sopena. Journal of Graph Theory, (2015) 82(2): 165-193
L(2,1)-labelings of some families of oriented planar graphs. S. Sen. Discussiones Mathematicae Graph Theory, (2014) 34(1): 31-48
Conference publications:
Monitoring edge-geodetic sets in graphs: extremal graphs. bounds, complexity, F. Foucaud, P. M. Marcille, Z. M. Myint, R. B. Sandeep, S. Sen, S. Taruni. CALDAM 2024
A linear algorithm for radio k-coloring powers of paths having small diameter. D. Chakraborty, S. Nandi, S. Sen, D. K. Supraja. IWOCA 2023
On relative clique number of triangle-free planar colored mixed graphs. S. Nandi, S. Sen, S. Taruni. IWOCA 2022
On Subgraph Complementation to H-free Graphs. D. Antony, J. Garchar, S. Pal, R. B. Sandeep, S. Sen, R. Subashini. WG 2021
On Deeply Critical Oriented Cliques. C. Duffy, P. PD, R. B. Sandeep, S. Sen. EuroComb 2021
On chromatic number of (n, m)-graphs. A. Lahiri, S. Nandi, S. Taruni, S. Sen. EuroComb 2021
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. S. S. Das, S. Nandi, S. Sen. CALDAM 2020
On Rectangle Intersection Graphs with Stab Number at Most Two. D. Chakraborty, S. Das, M. C. Francis, S. Sen. CALDAM 2019
The Relative Signed Clique Number of Planar Graphs is 8. S. Das, S. Nandi, S. Sen, R. Seth. CALDAM 2019
Cops and Robber on Some Families of Oriented Graphs. S. Das, H. Gahlawat, U. Sahoo, S. Sen. IWOCA 2019
Burning Spiders. S. Das, S. R. Dev, A. Sadhukhan, U. Sahoo, S. Sen. CALDAM 2018
On chromatic number of colored mixed graphs. S. Das, S. Nandi, S. Sen. CALDAM 2017
On local structures of cubicity 2 graphs. S. K. Bhore, D. Chakraborty, S. Das, S. Sen. COCOA 2016
Relative clique number of planar signed graphs. S. Das, P. Ghosh, S. Mj, S. Sen. CALDAM 2016
On oriented relative clique number. S. Das, S. Mj, S. Sen. LAGOS 2015
On a special class of boxicity 2 graphs. S. K. Bhore, D. Chakraborty, S. Das, S. Sen. CALDAM 2015
Maximum order of a planar oclique is 15. Sagnik Sen. IWOCA 2012
2-dipath and oriented L(2,1)-labelings of some families of oriented planar graphs. Sagnik Sen. EuroComb 2011
Codes linked in publications: