Sagnik Sen

According to our database, Sagnik Sen authored at least 70 papers between 2011 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Algorithms and complexity for monitoring edge-geodetic sets in graphs.

Florent Foucaud, Clara Marcille, R. B. Sandeep, Sagnik Sen, S. Taruni

Inf. Comput., 2026

On $(1,\le l)$-Locating-Dominating Codes in Infinite Triangular Grid.

Soura Sena Das, Tuomo Lehtilä, Sagnik Sen

Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

An Update on Pushable Homomorphisms.

Tapas Das, Pavan P. D, Sagnik Sen, S. Taruni

Proceedings of the Algorithms and Discrete Applied Mathematics, 2026

2025

On arc-density of pushably 3-critical oriented graphs.

Tapas Das, Pavan P. D, Sagnik Sen, S. Taruni

CoRR, September, 2025

Monitoring arc-geodetic sets of oriented graphs.

Tapas Das, Florent Foucaud, Clara Marcille, Pavan P. D, Sagnik Sen

Theor. Comput. Sci., 2025

A linear algorithm for radio k-coloring of powers of paths having small diameters.

Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja

J. Comput. Syst. Sci., 2025

Homomorphisms of (n,m)-graphs with respect to generalised switch.

Sagnik Sen, Éric Sopena, S. Taruni

Discret. Math. Theor. Comput. Sci., 2025

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs.

Florent Foucaud, Clara Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni

Discret. Appl. Math., 2025

Counting the minimum number of arcs in an oriented graph having weak diameter 2.

Sandip Das, Koushik Kumar Dey, Pavan P. D, Sagnik Sen

Discret. Appl. Math., 2025

2024

On Coloring Parameters of Triangle-Free Planar (n, m)-Graphs.

Soumen Nandi, Sagnik Sen, S. Taruni

Graphs Comb., December, 2024

Density of 3-critical signed graphs.

Laurent Beaudou, Penny Haxell, Kathryn Nurse, Sagnik Sen, Zhouningxin Wang

J. Graph Theory, 2024

Oriented total-coloring of oriented graphs.

Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen

Discret. Math., 2024

On (n,m)-chromatic numbers of graphs with bounded sparsity parameters.

Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni

Discret. Appl. Math., 2024

On locating and neighbor-locating colorings of sparse graphs.

Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja

Discret. Appl. Math., 2024

A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs.

Susobhan Bandopadhyay, Sagnik Sen, S. Taruni

CoRR, 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, S. Taruni

CoRR, 2024

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity.

Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

On deeply critical oriented cliques.

Christopher Duffy, Pavan P. D, Sandeep R. B., Sagnik Sen

J. Graph Theory, September, 2023

On radio <i>k</i>-labeling of the power of the infinite path.

Tapas Das, Tuomo Lehtilä, Soumen Nandi, Sagnik Sen, D. K. Supraja

Inf. Process. Lett., August, 2023

Pushable chromatic number of graphs with maximum average degree at most 145.

Tapas Das, Sagnik Sen

Discret. Appl. Math., July, 2023

Triangle-free projective-planar graphs with diameter two: Domination and characterization.

Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen

Discret. Appl. Math., May, 2023

On the pushable chromatic number of various types of grids.

Julien Bensmail, Tapas Das, Dimitri Lajou, Soumen Nandi, Sagnik Sen

Discret. Appl. Math., April, 2023

On clique numbers of colored mixed graphs.

Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen

Discret. Appl. Math., 2023

Cops and robber on variants of retracts and subdivisions of oriented graphs.

Harmender Gahlawat, Zin Mar Myint, Sagnik Sen

CoRR, 2023

An update on (n, m)-chromatic numbers.

Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni

CoRR, 2023

On relative clique number of triangle-free planar (n, m)-graphs.

Soumen Nandi, Sagnik Sen, S. Taruni

CoRR, 2023

A Homomorphic Polynomial for Oriented Graphs.

Sandip Das, Sumitava Ghosh, Swathy Prabhu, Sagnik Sen

Electron. J. Comb., 2023

Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement).

Harmender Gahlawat, Zin Mar Myint, Sagnik Sen

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter.

Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Cops and Robber on Oriented Graphs with Respect to Push Operation.

Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

New Bounds and Constructions for Neighbor-Locating Colorings of Graphs.

Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

On the signed chromatic number of some classes of graphs.

Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena

Discret. Math., 2022

On fractional version of oriented coloring.

Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen

Discret. Appl. Math., 2022

The oriented relative clique number of triangle-free planar graphs is 10.

Soura Sena Das, Soumen Nandi, Sagnik Sen

CoRR, 2022

On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs.

Soumen Nandi, Sagnik Sen, S. Taruni

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

Oriented bipartite graphs and the Goldbach graph.

Sandip Das, Prantar Ghosh, Shamik Ghosh, Sagnik Sen

Discret. Math., 2021

Pushable chromatic number of graphs with degree constraints.

Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena

Discret. Math., 2021

On Subgraph Complementation to H-free Graphs.

Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020

Relative clique number of planar signed graphs.

Sandip Das, Prantar Ghosh, Swathy Prabhu, Sagnik Sen

Discret. Appl. Math., 2020

Enumeration of edge-critical underlying absolute planar cliques for signed graphs.

Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen

Australas. J Comb., 2020

The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10.

Soura Sena Das, Soumen Nandi, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63].

Julien Bensmail, Soumen Nandi, Sagnik Sen

Discret. Appl. Math., 2019

Cops and Robber on Some Families of Oriented Graphs.

Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

On Rectangle Intersection Graphs with Stab Number at Most Two.

Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

The Relative Signed Clique Number of Planar Graphs is 8.

Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

A study on oriented relative clique number.

Sandip Das, Swathy Prabhu, Sagnik Sen

Discret. Math., 2018

Erratum for "On oriented cliques with respect to push operation".

Julien Bensmail, Soumen Nandi, Sagnik Sen

CoRR, 2018

On relative clique number of colored mixed graphs.

Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen

CoRR, 2018

On Oriented L(p, 1)-labeling.

Sandip Das, Soumen Nandi, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

Burning Spiders.

Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs.

Pascal Ochem, Alexandre Pinlou, Sagnik Sen

J. Graph Theory, 2017

Analogues of Cliques for (m, n)-Colored Mixed Graphs.

Julien Bensmail, Christopher Duffy, Sagnik Sen

Graphs Comb., 2017

On homomorphisms of oriented graphs with respect to the push operation.

Sagnik Sen

Discret. Math., 2017

A lower bound technique for radio k-coloring.

Sandip Das, Sasthi C. Ghosh, Soumen Nandi, Sagnik Sen

Discret. Math., 2017

On oriented cliques with respect to push operation.

Julien Bensmail, Soumen Nandi, Sagnik Sen

Discret. Appl. Math., 2017

On Chromatic Number of Colored Mixed Graphs.

Sandip Das, Soumen Nandi, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Outerplanar and Planar Oriented Cliques.

Ayan Nandy, Sagnik Sen, Éric Sopena

J. Graph Theory, 2016

Walk-Powers and Homomorphism Bounds of Planar Signed Graphs.

Reza Naserasr, Sagnik Sen, Qiang Sun

Graphs Comb., 2016

On Local Structures of Cubicity 2 Graphs.

Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen

Proceedings of the Combinatorial Optimization and Applications, 2016

Relative Clique Number of Planar Signed Graphs.

Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

On L(k, k-1, ..., 1) labeling of triangular lattice.

Soumen Nandi, Sagnik Sen, Sasthi C. Ghosh, Sandip Das

Electron. Notes Discret. Math., 2015

On oriented relative clique number.

Sandip Das, Swathyprabhu Mj, Sagnik Sen

Electron. Notes Discret. Math., 2015

On homomorphism of oriented graphs with respect to push operation.

Sagnik Sen

CoRR, 2015

Walk-powers and homomorphism bound of planar graphs.

Reza Naserasr, Sagnik Sen, Qiang Sun

CoRR, 2015

On a Special Class of Boxicity 2 Graphs.

Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

<i>L</i>(2, 1)-labelings of some famillies of oriented planar graphs.

Sagnik Sen

Discuss. Math. Graph Theory, 2014

Homomorphisms of signed planar graphs.

Pascal Ochem, Alexandre Pinlou, Sagnik Sen

CoRR, 2014

On cliques of signed and switchable signed graphs.

Julien Bensmail, Christopher Duffy, Sagnik Sen

CoRR, 2014

2012

Maximum Order of a Planar Oclique Is 15.

Sagnik Sen

Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2011

2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs.

Sagnik Sen

Electron. Notes Discret. Math., 2011