SRIRAM BHYRAVARAPU

Employment

• Indian Institute of Technology Guwahati Assistant Professor
  2025 - Present
• Institute of Mathematical Sciences Postdoc
  2021 - 2025
• Vignan's Foundation for Science Technology and Research Assistant Professor
  2014 - 2016
• Cognizant Technology Solutions India Software Trainee
  2012 - 2012

Education

• IIT Hyderabad PhD
  2016 - 2021
• International Institute of Information Technology Hyderabad M.Tech
  2012 - 2014
• Amrita School of Engineering Coimbatore Campus B.Tech
  2008 - 2012

Projects & Funding

Projects & funding information is unavailable.

Publications (37)

• On the parameterized complexity of odd coloring
  Theoretical Computer Science 2026 DOI: 10.1016/j.tcs.2026.116074
  +Save
• On the complexity of minimum membership dominating set
  Theoretical Computer Science 2026 DOI: 10.1016/j.tcs.2026.116121
  +Save
• Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT
  2026 DOI: 10.1007/978-3-032-11835-6_6
  +Save
• Conflict-free coloring on subclasses of perfect graphs and bipartite graphs
  Theoretical Computer Science 2025 DOI: 10.1016/j.tcs.2025.115080
  +Save
• Polynomial Time Algorithms for Hop Domination
  Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics 2025 DOI: 10.1007/978-3-031-83438-7_8
  +Save
• On the Structural Parameterized Complexity of Defective Coloring
  Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics 2025 DOI: 10.1007/978-3-031-82670-2_9
  +Save
• On the Parameterized Complexity of Odd Coloring
  Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics 2025 DOI: 10.1007/978-3-031-83438-7_6
  +Save
• On the Complexity of Minimum Membership Dominating Set
  Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics 2025 DOI: 10.1007/978-3-031-82670-2_8
  +Save
• On the Parameterized Complexity of Odd Coloring
  Arxiv 2025 DOI: 10.48550/arXiv.2503.05312
  +Save
• Further parameterized results on weak Grundy coloring
  Theoretical Computer Science 2025 DOI: 10.1016/j.tcs.2025.115361
  +Save