Sagnik Sen

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 63

Top Topics

Introduce A General Framework

Subgraph Isomorphism

Top Venues

Discret. Appl. Math.

Publications

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 (2024)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
On locating and neighbor-locating colorings of sparse graphs. Discret. Appl. Math. 358 (2024)
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 (2024)
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)
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) (2024)
Harmender Gahlawat, Zin Mar Myint, Sagnik Sen
Cops and robber on variants of retracts and subdivisions of oriented graphs. CoRR (2023)
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 (2023)
Christopher Duffy, Pavan P. D, Sandeep R. B., Sagnik Sen
On deeply critical oriented cliques. J. Graph Theory 104 (1) (2023)
Harmender Gahlawat, Zin Mar Myint, Sagnik Sen
Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement). LAGOS (2023)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. CALDAM (2023)
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. IWOCA (2023)
Sandip Das, Sumitava Ghosh, Swathy Prabhu, Sagnik Sen
A Homomorphic Polynomial for Oriented Graphs. Electron. J. Comb. 30 (1) (2023)
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On clique numbers of colored mixed graphs. Discret. Appl. Math. 324 (2023)
Julien Bensmail, Tapas Das, Dimitri Lajou, Soumen Nandi, Sagnik Sen
On the pushable chromatic number of various types of grids. Discret. Appl. Math. 329 (2023)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
New bounds and constructions for neighbor-locating colorings of graphs. CoRR (2023)
Tapas Das, Tuomo Lehtilä, Soumen Nandi, Sagnik Sen, D. K. Supraja
-labeling of the power of the infinite path. Inf. Process. Lett. 182 (2023)
Tapas Das, Sagnik Sen
Pushable chromatic number of graphs with maximum average degree at most 145. Discret. Appl. Math. 334 (2023)
Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
An update on (n, m)-chromatic numbers. CoRR (2023)
Soumen Nandi, Sagnik Sen, S. Taruni
On relative clique number of triangle-free planar (n, m)-graphs. CoRR (2023)
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 (2023)
Sagnik Sen, Éric Sopena, S. Taruni
Homomorphisms of (n, m)-graphs with respect to generalised switch. CoRR (2022)
Soumen Nandi, Sagnik Sen, S. Taruni
On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. IWOCA (2022)
Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen
Triangle-free projective-planar graphs with diameter two: domination and characterization. CoRR (2022)
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
On Subgraph Complementation to H-free Graphs. Algorithmica 84 (10) (2022)
Soura Sena Das, Soumen Nandi, Sagnik Sen
The oriented relative clique number of triangle-free planar graphs is 10. CoRR (2022)
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) (2022)
Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen
On fractional version of oriented coloring. Discret. Appl. Math. 316 (2022)
Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen
Cops and Robber on some families of oriented graphs. Theor. Comput. Sci. 888 (2021)
Christopher Duffy, Pavan P. D, Sandeep R. B., Sagnik Sen
On Deeply Critical Oriented Cliques. CoRR (2021)
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
On Subgraph Complementation to H-free Graphs. WG (2021)
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) (2021)
Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen
On fractional version of oriented coloring. CoRR (2021)
Sandip Das, Prantar Ghosh, Shamik Ghosh, Sagnik Sen
Oriented bipartite graphs and the Goldbach graph. Discret. Math. 344 (9) (2021)
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On clique numbers of colored mixed graphs. CoRR (2021)
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
On subgraph complementation to H-free graphs. CoRR (2021)
Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
On rectangle intersection graphs with stab number at most two. Discret. Appl. Math. 289 (2021)
Sandip Das, Prantar Ghosh, Swathy Prabhu, Sagnik Sen
Relative clique number of planar signed graphs. Discret. Appl. Math. 280 (2020)
Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen
Enumeration of edge-critical underlying absolute planar cliques for signed graphs. Australas. J Comb. 77 (2020)
Soura Sena Das, Soumen Nandi, Sagnik Sen
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. CALDAM (2020)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
On the signed chromatic number of some classes of graphs. CoRR (2020)
Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM (2019)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena
Pushable chromatic number of graphs with degree constraints. CoRR (2019)
Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth
The Relative Signed Clique Number of Planar Graphs is 8. CALDAM (2019)
Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen
Cops and Robber on Some Families of Oriented Graphs. IWOCA (2019)
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 (2019)
Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen
Burning Spiders. CALDAM (2018)
Sandip Das, Swathy Prabhu, Sagnik Sen
A study on oriented relative clique number. Discret. Math. 341 (7) (2018)
Sandip Das, Soumen Nandi, Sagnik Sen
On Oriented L(p, 1)-labeling. CALDAM (2018)
Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On relative clique number of colored mixed graphs. CoRR (2018)
Julien Bensmail, Soumen Nandi, Sagnik Sen
Erratum for "On oriented cliques with respect to push operation". CoRR (2018)
Julien Bensmail, Soumen Nandi, Sagnik Sen
On oriented cliques with respect to push operation. Discret. Appl. Math. 232 (2017)
Sandip Das, Sasthi C. Ghosh, Soumen Nandi, Sagnik Sen
A lower bound technique for radio k-coloring. Discret. Math. 340 (5) (2017)
Sagnik Sen
On homomorphisms of oriented graphs with respect to the push operation. Discret. Math. 340 (8) (2017)
Julien Bensmail, Christopher Duffy, Sagnik Sen
Analogues of Cliques for (m, n)-Colored Mixed Graphs. Graphs Comb. 33 (4) (2017)
Pascal Ochem, Alexandre Pinlou, Sagnik Sen
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. J. Graph Theory 85 (1) (2017)
Sandip Das, Soumen Nandi, Sagnik Sen
On Chromatic Number of Colored Mixed Graphs. CALDAM (2017)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On Local Structures of Cubicity 2 Graphs. COCOA (2016)
Sandip Das, Shamik Ghosh, Prantar Ghosh, Sagnik Sen
Oriented Bipartite Graphs and the Goldbach Graph. CoRR (2016)
Ayan Nandy, Sagnik Sen, Éric Sopena
Outerplanar and Planar Oriented Cliques. J. Graph Theory 82 (2) (2016)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On a special class of boxicity 2 graphs. CoRR (2016)
Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen
Relative Clique Number of Planar Signed Graphs. CALDAM (2016)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On local structures of cubicity 2 graphs. CoRR (2016)
Reza Naserasr, Sagnik Sen, Qiang Sun
Walk-Powers and Homomorphism Bounds of Planar Signed Graphs. Graphs Comb. 32 (4) (2016)
Sagnik Sen
On homomorphism of oriented graphs with respect to push operation. CoRR (2015)
Sandip Das, Soumen Nandi, Sagnik Sen
On chromatic number of colored mixed graphs. CoRR (2015)
Sandip Das, Swathyprabhu Mj, Sagnik Sen
On oriented relative clique number. Electron. Notes Discret. Math. 50 (2015)
Julien Bensmail, Soumen Nandi, Sagnik Sen
On oriented cliques with respect to push operation. CoRR (2015)
Reza Naserasr, Sagnik Sen, Qiang Sun
Walk-powers and homomorphism bound of planar graphs. CoRR (2015)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On a Special Class of Boxicity 2 Graphs. CALDAM (2015)
Soumen Nandi, Sagnik Sen, Sasthi C. Ghosh, Sandip Das
On L(k, k-1, ..., 1) labeling of triangular lattice. Electron. Notes Discret. Math. 48 (2015)
Julien Bensmail, Christopher Duffy, Sagnik Sen
On cliques of signed and switchable signed graphs. CoRR (2014)
Pascal Ochem, Alexandre Pinlou, Sagnik Sen
Homomorphisms of signed planar graphs. CoRR (2014)
Ayan Nandy, Sagnik Sen, Éric Sopena
Outerplanar and planar oriented cliques. CoRR (2014)
Sagnik Sen
(2, 1)-labelings of some famillies of oriented planar graphs. Discuss. Math. Graph Theory 34 (1) (2014)
Sagnik Sen
Maximum Order of a Planar Oclique Is 15. IWOCA (2012)
Sagnik Sen
2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs. Electron. Notes Discret. Math. 38 (2011)