default search action
Ahmad Mahmoody
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j5]Ahmad Mahmoody, Eli Upfal
:
Optimizing static and adaptive probing schedules for rapid event detection. Theor. Comput. Sci. 774: 14-30 (2019) - [c8]Shekoofeh Mokhtari, Ahmad Mahmoody, Dragomir Yankov, Ning Xie:
Tagging Address Queries in Maps Search. AAAI 2019: 9547-9551 - [c7]Zeping Yu, Jianxun Lian, Ahmad Mahmoody, Gongshen Liu, Xing Xie
Adaptive User Modeling with Long and Short-Term Preferences for Personalized Recommendation. IJCAI 2019: 4213-4219 - 2017
- [b1]Ahmad Mahmoody:
Scalable Algorithms for Mining Graphs and Social Networks via Sampling. Brown University, USA, 2017 - [c6]Alessandro Epasto
Real-Time Targeted-Influence Queries over Large Graphs. ASONAM 2017: 224-231 - [c5]Michael R. Evans, Ahmad Mahmoody, Dragomir Yankov, Florin Teodorescu, Wei Wu, Pavel Berkhin:
LiveMaps: Learning Geo-Intent from Images of Maps on a Large Scale. SIGSPATIAL/GIS 2017: 31:1-31:9 - 2016
- [c4]Ahmad Mahmoody, Charalampos E. Tsourakakis
Scalable Betweenness Centrality Maximization via Sampling. KDD 2016: 1765-1773 - [c3]Ahmad Mahmoody, Matteo Riondato
Wiggins: Detecting Valuable Information in Dynamic Networks Using Limited Resources. WSDM 2016: 677-686 - [i3]Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal:
Scalable Betweenness Centrality Maximization via Sampling. CoRR abs/1609.00790 (2016) - 2015
- [c2]Ahmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal
Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection. COCOA 2015: 377-391 - [i2]Ahmad Mahmoody, Eli Upfal:
The Probabilistic Hitting Set Paradigm: a General Framework for Search and Detection in Dynamic Social Networks. CoRR abs/1504.03275 (2015) - [i1]Ahmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal:
Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection. CoRR abs/1509.02487 (2015) - 2014
- [j4]Iman Hajirasouliha, Ahmad Mahmoody, Benjamin J. Raphael:
A combinatorial approach for analyzing intra-tumor heterogeneity from high-throughput sequencing data. Bioinform. 30(12): 78-86 (2014) - 2013
- [c1]Layla Oesper, Ahmad Mahmoody, Benjamin J. Raphael:
Inferring Intra-tumor Heterogeneity from High-Throughput DNA Sequencing Data. RECOMB 2013: 171-172 - 2012
- [j3]Ahmad Mahmoody, Crystal L. Kahn, Benjamin J. Raphael:
Reconstructing genome mixtures from partial adjacencies. BMC Bioinform. 13(S-19): S9 (2012)
2000 – 2009
- 2009
- [j2]Saieed Akbari, M. Jamaali, Ahmad Mahmoody, Seyed Amin Seyed Fakhari:
On the size of graphs whose cycles have length divisible by a fixed integer. Australas. J Comb. 45: 67-72 (2009) - [j1]Ahmad Mahmoody:
A Note on Graceful Graphs with Large Chromatic Numbers. Ars Comb. 90 (2009)
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-04-25 05:48 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: