Research

Currently, I am working on online algorithms, with a primary focus on fundamental graph-theoretic optimization problems such as online graph coloring, online dominating set, online independent set etc. My research interests lie in understanding how classical graph problems behave under online and incremental input models, where vertices or edges arrive over time and decisions must be made irrevocably without knowledge of future inputs. I am also interested in recourse models, where limited changes to previously made decisions are allowed in order to improve solution quality.