Omer Wasim
(He/him/his)
PhD Student
Research interests
- Algorithms and theory
- Online algorithms
- Dynamic algorithms
- Distributed computing
- Approximation algorithms
- Learning augmented algorithms
- Beyond worst case analysis of algorithms
Education
- MS in Computer Science, University of Victoria — Canada
- BEng in Computer Science, University of Hong King — China
Biography
Omer Wasim is a doctoral student at the Khoury College of Computer Sciences at Northeastern University, advised by Rajmohan Rajamaran. His doctoral research, which he began in 2020 and expects to complete in 2026, focuses on algorithms and theory.
Wasim is broadly interested in theoretical computer science, with an emphasis on the design and analysis of efficient graph algorithms in dynamic, distributed, online, and sublinear settings. He is affiliated with the Algorithms and Theory group and, along with former advisor Valerie King, published a paper on algorithms for MAX-CUT at FSTTCS 2020.
Recent publications
-
Fully Dynamic (Δ + 1)-Coloring Against Adaptive Adversaries
Citation: Soheil Behnezhad, Rajmohan Rajaraman, Omer Wasim. (2025). Fully Dynamic (Δ + 1)-Coloring Against Adaptive Adversaries SODA, 4983-5026. https://doi.org/10.1137/1.9781611978322.169 -
Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT
Citation: Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT Omer Wasim and Valerie King 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)