Diversity Maximization via Composable Coresets. - Sepideh Aghamolaei; Majid Farhadi; Hamid Zarrabi-Zadeh (CCCG, 2015)

A Composable Coreset for k-Center in Doubling Metrics. - Sepideh Aghamolaei; Mohammad Ghodsi (CCCG, 2018)

Geometric Spanners in the MapReduce Model. - Sepideh Aghamolaei; Fatemeh Baharifard; Mohammad Ghodsi (COCOON, 2018)

A MapReduce Algorithm for Metric Anonymity Problems. - Sepideh Aghamolaei; Mohammad Ghodsi; Seyyedhamid Miri (CCCG, 2019)

Approximating p-Mean Curve of Large Data-Sets. - Sepideh Aghamolaei; Mohammad Ghodsi (CoRR, 2020)

Point-Location in The Arrangement of Curves. - Sepideh Aghamolaei (CoRR, 2020)

Computing The Packedness of Curves. - Sepideh Aghamolaei; Vahideh Keikha; Mohammad Ghodsi; Ali Mohades (CoRR, 2020)

Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model. - Vahideh Keikha; Sepideh Aghamolaei; Ali Mohades; Mohammad Ghodsi (Fundam. Informaticae, 2021)

Windowing queries using Minkowski sum and their extension to MapReduce. - Sepideh Aghamolaei; Vahideh Keikha; Mohammad Ghodsi; Ali Mohades (J. Supercomput., 2021)

An Efficient Construction of Yao-Graph in Data-Distributed Settings. - Sepideh Aghamolaei; Mohammad Ghodsi (CoRR, 2023)

A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem. - Sepideh Aghamolaei; Mohammad Ghodsi (CoRR, 2023)

A 2-Approximation Algorithm for Data-Distributed Metric k-Center. - Sepideh Aghamolaei; Mohammad Ghodsi (CoRR, 2023)

Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering. - Sepideh Aghamolaei; Mohammad Ghodsi (CoRR, 2023)

Sampling and sparsification for approximating the packedness of trajectories and detecting gatherings. - Sepideh Aghamolaei; Vahideh Keikha; Mohammad Ghodsi; Ali Mohades (Int. J. Data Sci. Anal., 2023)

Explainable graph clustering via expanders in the massively parallel computation model. - Sepideh Aghamolaei; Mohammad Ghodsi (Inf. Sci., 2024)