Assistant Professor · Graph Theory · TCS

Dr. Eshwar
Srinivasan

Department of CSE · Amrita Vishwa Vidyapeetham, Coimbatore

I study the structure and representation of graphs — particularly word-representable graphs, semi-transitive orientations, and forbidden induced subgraph characterizations. My research sits at the intersection of combinatorics and theoretical computer science.

View Publications
Dr. Eshwar Srinivasan

Current Focus

Research Areas

Word-Representable Graphs

Characterizing graph classes via word representations, minimum-length word-representants, and extending hereditary graph properties to broader families.

Core Focus

Forbidden Induced Subgraphs

Developing minimal forbidden induced subgraph characterizations within specific classes — split, co-bipartite, and circle graphs — including open problems.

Combinatorics

Complexity & Algorithms

Weighted Clique and Independent Set problems in edge-distant hereditary graphs; NP-hardness reductions via semi-transitive orientation frameworks.

TCS

Peer-Reviewed Work

Publications

Discrete Applied Mathematics · 2024

Minimum Length Word-Representants of Word-Representable Graphs

Eshwar Srinivasan & Ramesh Hariharasubramanian Vol. 343, pp. 149–158

→ doi.org/10.1016/j.dam.2023.10.021

Discrete Applied Mathematics · 2024

Minimum Length Word-Representants of Graph Products

Eshwar Srinivasan & Ramesh Hariharasubramanian Vol. 358, pp. 91–104

→ doi.org/10.1016/j.dam.2024.07.002

Discrete Applied Mathematics · 2025

On Semi-Transitive Orientability of Circulant Graphs

Eshwar Srinivasan & Ramesh Hariharasubramanian Vol. 377, pp. 498–509

→ doi.org/10.1016/j.dam.2025.08.025

Preprint · 2025

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs

Eshwar Srinivasan & Ramesh Hariharasubramanian Communicated · 22 pp.

Preprint · 2025

Forbidden Induced Subgraph Characterization of Word-Representable Co-Bipartite Graphs

Eshwar Srinivasan & Ramesh Hariharasubramanian Communicated · 24 pp.

Preprint · 2026

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs

Eshwar Srinivasan & Ramesh Hariharasubramanian Communicated · 9 pp.

Academic Path

Education

2022 – 2026

Doctor of Philosophy — Mathematics

Indian Institute of Technology Guwahati, Assam

Thesis: Characterizations and Properties of Word-Representable Graph Classes

2020 – 2022

Master of Science — Mathematics

National Institute of Technology Calicut, Kerala

2014 – 2018

Bachelor of Technology — Mechanical Engineering

SASTRA Deemed University, Thanjavur, Tamil Nadu

Profile

Skills & Achievements

Programming & Tools

C C++ Python SageMath MATLAB LaTeX

Get In Touch

Contact

Department of Computer Science and Engineering
Amrita Vishwa Vidyapeetham, Amritanagar, Coimbatore – 641112, Tamil Nadu