Potential projects/topics: discrete optimization projects related to political redistricting, robotics, energy, or data co-registration
Potential skills gained: mathematical modeling; coding; knowledge in graph theory and integer programming
Required qualifications: some coding experience would be helpful
Direct mentor: Faculty/P.I., Post-doctorate, Graduate Student
Illya Hicks’ research interests are in combinatorial optimization, graph theory, and integer programming with applications in big data, imaging, social networks, cancer treatment, and logistics. In particular, he has done extensive research in finding cohesive groups in data networks and utilizing graph decomposition techniques to solve computationally difficult discrete optimization problems.