Eshwar Srinivasan

activity

20222026

most citedMinimum length word-representants of graph products

2 citations · 3 across the 6 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Structural and computational aspects of majority coloring games

Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan +1

A majority coloring of a graph $G = (V, E)$ is a coloring of $V (G)$ such that, for each vertex $v$ , the number of neighbors of $v$ with the same color as $v$ is at most $d e g (v) /2$ .…

cs.DS2026

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs

Eshwar Srinivasan, Ramesh Hariharasubramanian

In this work, we investigate the algorithmic aspects of two natural extensions of hereditary classes: the edge-apex class and the edge-add class, recently introduced by Singh and S…