My research interests lie, broadly speaking, in extremal graph theory, and combinatorial optimization.

Optimization

We are currently working on a facility location problem, locating primary healthcare centers in Chicago, with my advisor Hemanshu Kaul. We use a bilevel optimization model that contains redistricting of Chicago in the lower level.

Internship at Fermilab

I was an intern at Fermilab under the MSGI program. With my mentors, Jim Kowalkowski and Adam Aurisano, we were trying to define new methods and algorithms for locating and identifying particle trajectories in data obtained from state-of-the-art 3D detector LArTPC using graph theory and related machine learning techniques.

Graph Theory

My motivation in graph theory is to improve bounds on the chromatic numbers of different coloring types by using probabilistic and combinatorial tools. In my master degree, we studied acyclic and star colorings with my outstanding advisor Lale Ozkahya and published a paper that can be seen below. Furthermore, we were working on a positional game, Maker-Breaker Hamiltonicity, which is played on graphs with n vertices. Our goal was to find a winning strategy for players for all n. Currently, I am interested in Latin squares, and DP-coloring.