Subrahmanyam Kalyanasundaram

Professor

Department of Computer Science and Engineering

IIT Hyderabad

About Me

I am a faculty member at the CSE Department, IIT Hyderabad. I am part of the Theory group.

Research Interests

I am interested in all aspects of Theoretical Computer Science. I have worked on Complexity Theory, Combinatorics and Graph Algorithms.

Education

Ph.D. in Algorithms, Combinatorics & Optimization from College of Computing, Georgia Tech (2011). I was fortunate to have Dick Lipton and Asaf Shapira as my Ph.D. advisors.
M.S. in Mathematics from Georgia Tech (2009).
M.E. in Telecommunication Engineering from Indian Institute of Science (2003).
B.Tech. in Electronics and Communication Engineering, NIT Calicut (2001).

Recent Publications

Quickly discover relevant content by filtering publications.

Sriram Bhyravarapu, Shiwali Gupta, Subrahmanyam Kalyanasundaram, Rogers Mathew (2025). Extremal Results on Conflict-Free Coloring. Journal of Graph Theory.

PDF DOI Publisher Link arXiv

Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney (2025). The Complexity of Optimizing Atomic Congestion. Artificial Intelligence, Volume 338, 104241.

DOI Publisher Link arXiv

S. VenkataKeerthy, Soumya Banerjee, Sayan Dey, Yashas Andaluri, Raghul PS, Subrahmanyam Kalyanasundaram, Fernando Magno Quintão Pereira, Ramakrishna Upadrasta (2025). VEXIR2Vec: An Architecture-Neutral Embedding Framework for Binary Similarity. ACM Transactions on Software Engineering and Methodology.

DOI Publisher Link arXiv

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew (2025). Conflict-free coloring on subclasses of perfect graphs and bipartite graphs. Theoretical Computer Science, Volume 1031, 115080.

PDF DOI Publisher Link

Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy (2024). Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. Algorithmica, Volume 86, Issue 7, Pages 2250 - 2288.

PDF DOI arXiv Publisher Link

See all publications

Students

Ph.D. Students

Anjeneya Swami Kare. Jan 2014 - July 2018
(jointly supervised with N. R. Aravind)
Sriram Bhyravarapu. Aug 2016 - Sep 2021
Thamilselvam B. Aug 2017 - Oct 2023
(jointly supervised with M. V. Panduranga Rao)
Kunal Bag. Aug 2023 - present
Subodh Kumar. Aug 2023 - present

M.Tech. Students

Sangram Kapre. Aug 2011 - July 2013
Anubhav Jain. Aug 2011 - July 2014
Natti Bhuvana Sai. Aug 2013 - July 2015
Yogesh Charan. Aug 2013 - July 2015
Rajeev Ranjan. Aug 2016 - July 2018
Darivemula Mamatha Rani. Aug 2018 - July 2020
Soumyakanta Sahoo. Aug 2019 - July 2021
Prashanth Vaidya. Aug 2020 - July 2022
Raghvendra Gupta. Aug 2022 - July 2024

Teaching

This semester (January - April 2025)

CS5200. Approximation Algorithms. 3 credits.

Taught over NPTEL

Computational Complexity.
- Playlist of the all the lectures.
- Course Materials.
Theory of Computation
- Playlist of the all the lectures.
- Course Materials.

Previous semesters ( full list)

I usually teach courses in the area of Theoretical Computer Science. Courses that I have offered in the past fall into broadly two categories — graduate level elective courses and undergraduate level core courses such as Data Structures, Algorithms and Theory of Computation. Click here to see the full list of courses.

Contact

+91 40 2301 6355
Room CS-508, EECS Building,
IIT Hyderabad,
Kandi, Sangareddy, 502285
Email me to set up an appointment