I build fast, scalable algorithms and systems for graphs. My flagship work, Highway, detects overlapping communities in networks up to 1.13 million nodes using sparse backbones — and is now integrated into cdlib, a mainstream community-detection library.
I'm currently finishing my MEng at the University of Toronto and applying to CS/EECS PhD programs for Fall 2027. I'm drawn to research where algorithmic ideas meet real-world scale — and increasingly to bringing graph structure into how models represent and control meaning.

Overlapping Network Community Detection Using Sparse Backbones
ASONAM 2026 (Springer proceedings) · Accepted · journal extension in preparation (SNAM)
A four-step sparse-backbone method. Evaluated on ~3,000 synthetic graphs and three real SNAP networks (up to 1.13M nodes / 2.99M edges); the only method to finish all three within 300s (7.34× faster on the largest instance).

Triad: Suppressing Structural Degeneracy in Overlapping Community Detection
WAW 2026 · Presentation (not a proceedings paper)
A QCP formulation with node/edge/community constraints that explicitly suppresses structural degeneracy — the predecessor method that led to Highway.
An open, reproducible benchmark for overlapping community detection — plug in your own algorithm and compare against Highway plus eight cdlib baselines on five metrics. Requested by the WAW program chair.
An exploratory direction carrying overlapping-community ideas into how models represent meaning: a graph-structured, interpretable semantic-control layer. My proposed future research direction.
A full-stack system that grew out of a finance-ML course project — a six-layer data platform with governed data spine and multiple clients. Evidence of engineering maturity rather than a research thrust.
University of Toronto — MEng, Mechanical & Industrial Engineering (Data Analytics & ML), 2025–2026.
University of Waterloo — B.C.S. Honours with Distinction; CS major, AI specialization, Computational Math minor, 2020–2025.