Subrahmanyam Kalyanasundaram

Statistics

Publications

Citations

H-Index

Active since

2012

Affiliations

Indian Institute of Technology Hyderabad(Current)

Tel Aviv University

Subrahmanyam Kalyanasundaram is an author at Indian Institute of Technology Hyderabad specializing in discrete mathematics, combinatorial optimization, and graph theory.

ORCID

Top concepts

Discrete MathematicsCombinatorial OptimizationGraph TheoryEngineeringComputational ComplexityBusinessEducationGame TheoryNetwork ScienceSpectral Theory

Publications per year

2012–2021

Publications

Algorithms and hardness results for happy coloring problems

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare et al. · arXiv (Cornell University) · 2017 · 15 citations · Full text

Mathematical Programming, Vertex-colored Graph, Engineering +17

A Note on Even Cycles and Quasirandom Tournaments

Subrahmanyam Kalyanasundaram, A. Shapira · Journal of Graph Theory · 2012 · 13 citations

Tournament T, Geometric Graph Theory, Graph Theory +11

A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma

Domingos Dellamonica, Subrahmanyam Kalyanasundaram, Daniel M. Martin et al. · SIAM Journal on Discrete Mathematics · 2012 · 12 citations

Spectral Theory, Computational Complexity Theory, Engineering +18

A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew · Journal of Graph Theory · 2021 · 12 citations · Full text

An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions

Domingos Dellamonica, Subrahmanyam Kalyanasundaram, Daniel M. Martin et al. · Combinatorics Probability Computing · 2014 · 11 citations

Geometric Algorithm, Graph Theory, Algebraic Graph Theory +11

1–5 of 5