default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSepideh Aghamolaei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Sepideh Aghamolaei
, Mohammad Ghodsi:
Explainable graph clustering via expanders in the massively parallel computation model. Inf. Sci. 677: 120897 (2024)- 2023
- [j3]Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi, Ali Mohades:
Sampling and sparsification for approximating the packedness of trajectories and detecting gatherings. Int. J. Data Sci. Anal. 15(2): 201-216 (2023) - [i9]Sepideh Aghamolaei, Mohammad Ghodsi:
An Efficient Construction of Yao-Graph in Data-Distributed Settings. CoRR abs/2308.15065 (2023) - [i8]Sepideh Aghamolaei, Mohammad Ghodsi:
A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem. CoRR abs/2309.00242 (2023) - [i7]Sepideh Aghamolaei, Mohammad Ghodsi:
A 2-Approximation Algorithm for Data-Distributed Metric k-Center. CoRR abs/2309.04327 (2023) - [i6]Sepideh Aghamolaei, Mohammad Ghodsi:
Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering. CoRR abs/2309.07486 (2023) - 2021
- [j2]Vahideh Keikha, Sepideh Aghamolaei, Ali Mohades, Mohammad Ghodsi:
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model. Fundam. Informaticae 184(3): 205-231 (2021) - [j1]Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi, Ali Mohades:
Windowing queries using Minkowski sum and their extension to MapReduce. J. Supercomput. 77(1): 936-972 (2021) - [i5]Vahideh Keikha, Sepideh Aghamolaei, Ali Mohades, Mohammad Ghodsi:
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model. CoRR abs/2111.13989 (2021) - 2020
- [i4]Sepideh Aghamolaei, Mohammad Ghodsi:
Approximating p-Mean Curve of Large Data-Sets. CoRR abs/2005.06672 (2020) - [i3]Sepideh Aghamolaei:
Point-Location in The Arrangement of Curves. CoRR abs/2007.11451 (2020) - [i2]Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi, Ali Mohades:
Computing The Packedness of Curves. CoRR abs/2012.04403 (2020)
2010 – 2019
- 2019
- [c4]Sepideh Aghamolaei, Mohammad Ghodsi, Seyyedhamid Miri:
A MapReduce Algorithm for Metric Anonymity Problems. CCCG 2019: 117-123 - [i1]Sepideh Aghamolaei, Mohammad Ghodsi:
A Composable Coreset for k-Center in Doubling Metrics. CoRR abs/1902.01896 (2019) - 2018
- [c3]Sepideh Aghamolaei, Mohammad Ghodsi:
A Composable Coreset for k-Center in Doubling Metrics. CCCG 2018: 165-171 - [c2]Sepideh Aghamolaei, Fatemeh Baharifard, Mohammad Ghodsi:
Geometric Spanners in the MapReduce Model. COCOON 2018: 675-687 - 2015
- [c1]Sepideh Aghamolaei, Majid Farhadi, Hamid Zarrabi-Zadeh:
Diversity Maximization via Composable Coresets. CCCG 2015
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
