Hamidreza Jahanjou
Education
- PhD in Computer Science, Northeastern University
- MS, Sharif University of Technology, Iran
Biography
Hamidreza Jahanjou is a part-time lecturer in the Khoury College of Computer Sciences at Northeastern University’s campus in Silicon Valley. He completed his PhD in Computer Sciences at Khoury College where he was advised by Professor Rajmohan Rajaraman. Hamid earned his master’s degree at Sharif University of Technology in Iran. He has collaborated with several faculty members in research and teaching within the field of theoretical computer science, and focuses on finding clever ways to solve computationally difficult problems.
One of Jahanjou’s research goals is to solve the rectangle coloring problem: When given a set of axis-parallel rectangles on a plane, what is the smallest number of colors needed so that rectangles of the same color do not intersect? His research focuses on understanding what makes some problems inherently more difficult than others despite their similarity, a question at the heart of algorithms and complexity theory.
Jahanjou grew up in Isfahan, Iran.
Education
- PhD in Computer Science, Northeastern University
- MS, Sharif University of Technology, Iran
Biography
Hamidreza Jahanjou is a part-time lecturer in the Khoury College of Computer Sciences at Northeastern University’s campus in Silicon Valley. He completed his PhD in Computer Sciences at Khoury College where he was advised by Professor Rajmohan Rajaraman. Hamid earned his master’s degree at Sharif University of Technology in Iran. He has collaborated with several faculty members in research and teaching within the field of theoretical computer science, and focuses on finding clever ways to solve computationally difficult problems.
One of Jahanjou’s research goals is to solve the rectangle coloring problem: When given a set of axis-parallel rectangles on a plane, what is the smallest number of colors needed so that rectangles of the same color do not intersect? His research focuses on understanding what makes some problems inherently more difficult than others despite their similarity, a question at the heart of algorithms and complexity theory.
Jahanjou grew up in Isfahan, Iran.