L. Sunil Chandran

L. Sunil Chandran is a Professor at the Department of Computer Science and Automation, Indian Institute of Science (IISc), Bangalore. His research spans graph theory, combinatorics, algorithms, and quantum computing, with extensive work on graph coloring, boxicity, rainbow connectivity, and computational complexity. He leads a large research group, advising PhD, MSc, and ME students, many of whom hold faculty positions at premier institutions like IITs, NITs, and international universities.

Chandran's research focuses on combinatorial graph algorithms, structural graph theory, and applications in quantum physics. Key areas include approximation algorithms for NP-hard problems, graph representation (boxicity/cubicity), and rainbow coloring variants. His recent work explores quantum entanglement via hypergraphs and parameterized complexity for vertex deletion problems.

His publications (15 most recent shown) demonstrate a consistent focus on graph-theoretic problem-solving, with innovations in algorithmic techniques for graph coloring, combinatorial optimization, and quantum-graph intersections. Trends include increased interdisciplinary work bridging computer science, physics, and discrete mathematics.

Awards and Recognitions:

• Adjunct Professorship at NIT Calicut (2023)
• INSA Fellow (2022) & INAE Fellow (2015)
• Alexander von Humboldt Fellowship
• NASI-SCOPUS Young Scientist Award (2012)
• MSR India Outstanding Young Faculty Award (2009-2010)
• INSA Young Scientist Award (2007)

He has secured grants from DST, UGC, SERB, and NBHM to support postdoctoral researchers and students. Current projects include quantum-graph theory applications and parameterized algorithms. His group maintains active collaborations with institutions globally.