2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs. - Sagnik Sen 001 (Electron. Notes Discret. Math., 2011)

Maximum Order of a Planar Oclique Is 15. - Sagnik Sen 001 (IWOCA, 2012)

On cliques of signed and switchable signed graphs. - Julien Bensmail; Christopher Duffy 001; Sagnik Sen 001 (CoRR, 2014)

Homomorphisms of signed planar graphs. - Pascal Ochem; Alexandre Pinlou; Sagnik Sen 001 (CoRR, 2014)

L(2, 1)-labelings of some famillies of oriented planar graphs. - Sagnik Sen 001 (Discuss. Math. Graph Theory, 2014)

On a Special Class of Boxicity 2 Graphs. - Sujoy Kumar Bhore; Dibyayan Chakraborty; Sandip Das 001; Sagnik Sen 001 (CALDAM, 2015)

Walk-powers and homomorphism bound of planar graphs. - Reza Naserasr; Sagnik Sen 001; Qiang Sun (CoRR, 2015)

On homomorphism of oriented graphs with respect to push operation. - Sagnik Sen 001 (CoRR, 2015)

On oriented relative clique number. - Sandip Das 001; Swathyprabhu Mj; Sagnik Sen 001 (Electron. Notes Discret. Math., 2015)

On L(k, k-1, ..., 1) labeling of triangular lattice. - Soumen Nandi; Sagnik Sen 001; Sasthi C. Ghosh 001; Sandip Das 001 (Electron. Notes Discret. Math., 2015)

Relative Clique Number of Planar Signed Graphs. - Sandip Das 001; Prantar Ghosh; Swathyprabhu Mj; Sagnik Sen 001 (CALDAM, 2016)

On Local Structures of Cubicity 2 Graphs. - Sujoy Kumar Bhore; Dibyayan Chakraborty; Sandip Das 001; Sagnik Sen 001 (COCOA, 2016)

Walk-Powers and Homomorphism Bounds of Planar Signed Graphs. - Reza Naserasr; Sagnik Sen 001; Qiang Sun (Graphs Comb., 2016)

Outerplanar and Planar Oriented Cliques. - Ayan Nandy; Sagnik Sen 001; Éric Sopena (J. Graph Theory, 2016)

On Chromatic Number of Colored Mixed Graphs. - Sandip Das 001; Soumen Nandi; Sagnik Sen 001 (CALDAM, 2017)

On oriented cliques with respect to push operation. - Julien Bensmail; Soumen Nandi; Sagnik Sen 001 (Discret. Appl. Math., 2017)

A lower bound technique for radio k-coloring. - Sandip Das 001; Sasthi C. Ghosh 001; Soumen Nandi; Sagnik Sen 001 (Discret. Math., 2017)

On homomorphisms of oriented graphs with respect to the push operation. - Sagnik Sen 001 (Discret. Math., 2017)

Analogues of Cliques for (m, n)-Colored Mixed Graphs. - Julien Bensmail; Christopher Duffy 001; Sagnik Sen 001 (Graphs Comb., 2017)

Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. - Pascal Ochem; Alexandre Pinlou; Sagnik Sen 001 (J. Graph Theory, 2017)

Burning Spiders. - Sandip Das 001; Subhadeep Ranjan Dev; Arpan Sadhukhan; Uma Kant Sahoo; Sagnik Sen 001 (CALDAM, 2018)

On Oriented L(p, 1)-labeling. - Sandip Das 001; Soumen Nandi; Sagnik Sen 001 (CALDAM, 2018)

On relative clique number of colored mixed graphs. - Sandip Das 001; Soumen Nandi; Debdeep Roy; Sagnik Sen 001 (CoRR, 2018)

Erratum for "On oriented cliques with respect to push operation". - Julien Bensmail; Soumen Nandi; Sagnik Sen 001 (CoRR, 2018)

A study on oriented relative clique number. - Sandip Das 001; Swathy Prabhu; Sagnik Sen 001 (Discret. Math., 2018)

The Relative Signed Clique Number of Planar Graphs is 8. - Sandip Das 001; Soumen Nandi; Sagnik Sen 001; Ritesh Seth (CALDAM, 2019)

Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63]. - Julien Bensmail; Soumen Nandi; Sagnik Sen 001 (Discret. Appl. Math., 2019)

The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. - Soura Sena Das; Soumen Nandi; Sagnik Sen 001 (CALDAM, 2020)

Enumeration of edge-critical underlying absolute planar cliques for signed graphs. - Julien Bensmail; Soumen Nandi; Mithun Roy; Sagnik Sen 001 (Australas. J Comb., 2020)

Relative clique number of planar signed graphs. - Sandip Das 001; Prantar Ghosh; Swathy Prabhu; Sagnik Sen 001 (Discret. Appl. Math., 2020)

On rectangle intersection graphs with stab number at most two. - Dibyayan Chakraborty; Sandip Das 001; Mathew C. Francis; Sagnik Sen 001 (Discret. Appl. Math., 2021)

Pushable chromatic number of graphs with degree constraints. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Soumyajit Paul; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2021)

Oriented bipartite graphs and the Goldbach graph. - Sandip Das 001; Prantar Ghosh; Shamik Ghosh; Sagnik Sen 001 (Discret. Math., 2021)

Cops and Robber on some families of oriented graphs. - Sandip Das 001; Harmender Gahlawat; Uma Kant Sahoo; Sagnik Sen 001 (Theor. Comput. Sci., 2021)

On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. - Soumen Nandi; Sagnik Sen 001; S. Taruni (IWOCA, 2022)

On Subgraph Complementation to H-free Graphs. - Dhanyamol Antony; Jay Garchar; Sagartanu Pal; R. B. Sandeep; Sagnik Sen 001; R. Subashini (Algorithmica, 2022)

Homomorphisms of (n, m)-graphs with respect to generalised switch. - Sagnik Sen 001; Éric Sopena; S. Taruni (CoRR, 2022)

The oriented relative clique number of triangle-free planar graphs is 10. - Soura Sena Das; Soumen Nandi; Sagnik Sen 001 (CoRR, 2022)

On fractional version of oriented coloring. - Sandip Das 001; Soham Das 004; Swathy Prabhu; Sagnik Sen 001 (Discret. Appl. Math., 2022)

On the signed chromatic number of some classes of graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2022)

New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. - Dipayan Chakraborty; Florent Foucaud; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (CALDAM, 2023)

Cops and Robber on Oriented Graphs with Respect to Push Operation. - Sandip Das 001; Harmender Gahlawat; Ashwin Ramgopal; Uma Kant Sahoo; Sagnik Sen 001 (CALDAM, 2023)

A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. - Dipayan Chakraborty; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (IWOCA, 2023)

Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement). - Harmender Gahlawat; Zin Mar Myint; Sagnik Sen 001 (LAGOS, 2023)

A Homomorphic Polynomial for Oriented Graphs. - Sandip Das 001; Sumitava Ghosh; Swathy Prabhu; Sagnik Sen 001 (Electron. J. Comb., 2023)

On relative clique number of triangle-free planar (n, m)-graphs. - Soumen Nandi; Sagnik Sen 001; S. Taruni (CoRR, 2023)

An update on (n, m)-chromatic numbers. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (CoRR, 2023)

Cops and robber on variants of retracts and subdivisions of oriented graphs. - Harmender Gahlawat; Zin Mar Myint; Sagnik Sen 001 (CoRR, 2023)

On clique numbers of colored mixed graphs. - Dipayan Chakraborty; Sandip Das 001; Soumen Nandi; Debdeep Roy; Sagnik Sen 001 (Discret. Appl. Math., 2023)

On the pushable chromatic number of various types of grids. - Julien Bensmail; Tapas Das; Dimitri Lajou; Soumen Nandi; Sagnik Sen 001 (Discret. Appl. Math., 2023)

Triangle-free projective-planar graphs with diameter two: Domination and characterization. - Dibyayan Chakraborty; Sandip Das 001; Srijit Mukherjee; Uma Kant Sahoo; Sagnik Sen 001 (Discret. Appl. Math., 2023)

Pushable chromatic number of graphs with maximum average degree at most 145. - Tapas Das; Sagnik Sen 001 (Discret. Appl. Math., 2023)

On radio k-labeling of the power of the infinite path. - Tapas Das; Tuomo Lehtilä; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (Inf. Process. Lett., 2023)

On deeply critical oriented cliques. - Christopher Duffy 001; Pavan P. D; Sandeep R. B.; Sagnik Sen 001 (J. Graph Theory, 2023)

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. - Florent Foucaud; Pierre-Marie Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CALDAM, 2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Pierre-Marie Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CoRR, 2024)

A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs. - Susobhan Bandopadhyay; Sagnik Sen 001; S. Taruni (CoRR, 2024)

Algorithms and complexity for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Clara Marcille; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CoRR, 2024)

On locating and neighbor-locating colorings of sparse graphs. - Dipayan Chakraborty; Florent Foucaud; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (Discret. Appl. Math., 2024)

On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (Discret. Appl. Math., 2024)

Oriented total-coloring of oriented graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Ayan Nandy; Théo Pierron; Swathy Prabhu; Sagnik Sen 001 (Discret. Math., 2024)

Density of 3-critical signed graphs. - Laurent Beaudou; Penny Haxell; Kathryn Nurse; Sagnik Sen 001; Zhouningxin Wang (J. Graph Theory, 2024)

On Coloring Parameters of Triangle-Free Planar (n, m)-Graphs. - Soumen Nandi; Sagnik Sen 001; S. Taruni (Graphs Comb., 2024)

Counting the minimum number of arcs in an oriented graph having weak diameter 2. - Sandip Das 001; Koushik Kumar Dey; Pavan P. D; Sagnik Sen 001 (Discret. Appl. Math., 2025)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Clara Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (Discret. Appl. Math., 2025)

A linear algorithm for radio k-coloring of powers of paths having small diameters. - Dipayan Chakraborty; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (J. Comput. Syst. Sci., 2025)

Monitoring arc-geodetic sets of oriented graphs. - Tapas Das; Florent Foucaud; Clara Marcille; Pavan P. D; Sagnik Sen 001 (Theor. Comput. Sci., 2025)