default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArash Asadpour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Arash Asadpour
, Rad Niazadeh, Amin Saberi, Ali Shameli:
Sequential Submodular Maximization and Applications to Ranking an Assortment of Products. Oper. Res. 71(4): 1154-1170 (2023)- [j8]Arash Asadpour, Ilan Lobel, Garrett J. van Ryzin:
Minimum Earnings Regulation and the Stability of Marketplaces. Manuf. Serv. Oper. Manag. 25(1): 254-265 (2023) - 2022
- [c8]Arash Asadpour, Rad Niazadeh, Amin Saberi, Ali Shameli:
Sequential Submodular Maximization and Applications to Ranking an Assortment of Products. EC 2022: 817 - 2021
- [j7]Tarek Abdallah, Arash Asadpour, Josh Reed:
Large-Scale Bundle-Size Pricing: A Theoretical Analysis. Oper. Res. 69(4): 1158-1185 (2021) - 2020
- [j6]Arash Asadpour, Xuan Wang, Jiawei Zhang:
Online Resource Allocation with Limited Flexibility. Manag. Sci. 66(2): 642-666 (2020) - [c7]Arash Asadpour, Ilan Lobel, Garrett J. van Ryzin:
Minimum Earnings Regulation and the Stability of Marketplaces. EC 2020: 293 - [i1]Arash Asadpour, Rad Niazadeh, Amin Saberi, Ali Shameli:
Ranking an Assortment of Products via Sequential Submodular Optimization. CoRR abs/2002.09458 (2020)
2010 – 2019
- 2019
- [j5]Arash Asadpour, MohammadHossein Bateni, Kshipra Bhawalkar, Vahab S. Mirrokni:
Concise Bid Optimization Strategies with Multiple Budget Constraints. Manag. Sci. 65(12): 5785-5812 (2019) - 2017
- [j4]Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi:
An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem. Oper. Res. 65(4): 1043-1061 (2017) - 2016
- [j3]Arash Asadpour, Hamid Nazerzadeh:
Maximizing Stochastic Monotone Submodular Functions. Manag. Sci. 62(8): 2374-2391 (2016) - 2014
- [c6]Arash Asadpour, MohammadHossein Bateni, Kshipra Bhawalkar, Vahab S. Mirrokni:
Concise Bid Optimization Strategies with Multiple Budget Constraints. WINE 2014: 263-276 - 2012
- [j2]Arash Asadpour, Uriel Feige, Amin Saberi:
Santa claus meets hypergraph matchings. ACM Trans. Algorithms 8(3): 24:1-24:9 (2012) - 2010
- [j1]Arash Asadpour, Amin Saberi:
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods. SIAM J. Comput. 39(7): 2970-2989 (2010) - [c5]Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi:
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. SODA 2010: 379-389
2000 – 2009
- 2009
- [c4]Arash Asadpour, Amin Saberi:
On the Inefficiency Ratio of Stable Equilibria in Congestion Games. WINE 2009: 545-552 - 2008
- [c3]Arash Asadpour, Uriel Feige, Amin Saberi:
Santa Claus Meets Hypergraph Matchings. APPROX-RANDOM 2008: 10-20 - [c2]Arash Asadpour, Hamid Nazerzadeh, Amin Saberi:
Stochastic Submodular Maximization. WINE 2008: 477-489 - 2007
- [c1]Arash Asadpour, Amin Saberi:
An approximation algorithm for max-min fair allocation of indivisible goods. STOC 2007: 114-121
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-24 23:16 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:
