Stochastic Minimum Spanning Trees and Related Problems. - Pegah Kamousi; Subhash Suri (ANALCO, 2011)

Stochastic minimum spanning trees in euclidean spaces. - Pegah Kamousi; Timothy M. Chan; Subhash Suri (SCG, 2011)

Memory Efficient De Bruijn Graph Construction - Yang Li 150; Pegah Kamousi; Fangqiu Han; Shengqi Yang; Xifeng Yan; Subhash Suri (CoRR, 2012)

Euclidean Traveling Salesman Tours through Stochastic Neighborhoods. - Pegah Kamousi; Subhash Suri (ISAAC, 2013)

Memory Efficient Minimum Substring Partitioning. - Yang Li 150; Pegah Kamousi; Fangqiu Han; Shengqi Yang; Xifeng Yan; Subhash Suri (Proc. VLDB Endow., 2013)

Closest pair and the post office problem for stochastic points. - Pegah Kamousi; Timothy M. Chan; Subhash Suri (Comput. Geom., 2014)

Analysis of farthest point sampling for approximating geodesics in a graph. - Pegah Kamousi; Sylvain Lazard; Anil Maheshwari; Stefanie Wuhrer (Comput. Geom., 2016)

A Few-Shot Sequential Approach for Object Counting. - Negin Sokhandan; Pegah Kamousi; Alejandro Posada; Eniola Alese; Negar Rostamzadeh (CoRR, 2020)