S. Taruni

According to our database, S. Taruni authored at least 16 papers between 2022 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

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

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

Separating edges by linearly many subdivisions.

George Kontogeorgiou, Matías Pavez-Signé, Maya Stein, S. Taruni, Ana Trujillo-Negrete

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

Rainbow separating path systems.

Alexander Clifton, George Kontogeorgiou, S. Taruni, Ana Trujillo-Negrete

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

2024

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

Soumen Nandi, Sagnik Sen, S. Taruni

Graphs Comb., December, 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

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

Winding number and circular 4-coloring of signed graphs.

Anna Gujgiczer, Reza Naserasr, Rohini S, S. Taruni

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

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