default search action
M. Reza Khani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j4]Rad Niazadeh
, Jason D. Hartline, Nicole Immorlica, Mohammad Reza Khani, Brendan Lucier:
Fast Core Pricing for Rich Advertising Auctions. Oper. Res. 70(1): 223-240 (2022) - [c12]Max Springer, MohammadTaghi Hajiaghayi, Debmalya Panigrahi, Mohammad Reza Khani:
Online Algorithms for the Santa Claus Problem. NeurIPS 2022 - [i4]MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Debmalya Panigrahi, Max Springer:
Online Algorithms for the Santa Claus Problem. CoRR abs/2210.07333 (2022)
2010 – 2019
- 2018
- [c11]Jason D. Hartline, Nicole Immorlica, Mohammad Reza Khani, Brendan Lucier, Rad Niazadeh
Fast Core Pricing for Rich Advertising Auctions. EC 2018: 111-112 - [c10]Mohammad Taghi Hajiaghayi, Mohammad Reza Khani, Saeed Seddighin:
Frugal Auction Design for Set Systems: Vertex Cover and Knapsack. EC 2018: 645-662 - 2016
- [j3]M. Reza Khani, Mohammad R. Salavatipour:
Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph. J. Comb. Optim. 31(2): 669-685 (2016) - [j2]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Mohammad Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. ACM Trans. Algorithms 12(4): 54:1-54:38 (2016) - [c9]Yoram Bachrach, Sofia Ceppi, Ian A. Kash, Peter B. Key, Mohammad Reza Khani:
Mechanism Design for Mixed Bidders. WWW 2016: 215-225 - [r1]Gagan Goel, Mohammad Reza Khani:
Revenue Monotone Auctions. Encyclopedia of Algorithms 2016: 1824-1839 - 2015
- [c8]Gagan Goel, Mohammad Reza Khani, Renato Paes Leme:
Core-competitive Auctions. EC 2015: 149-166 - [i3]Gagan Goel, Mohammad Reza Khani, Renato Paes Leme:
Core-competitive Auctions. CoRR abs/1505.07911 (2015) - [i2]Gagan Goel, MohammadTaghi Hajiaghayi, Mohammad Reza Khani:
Randomized Revenue Monotone Mechanisms for Online Advertising. CoRR abs/1507.00130 (2015) - 2014
- [j1]M. Reza Khani, Mohammad R. Salavatipour:
Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems. Algorithmica 69(2): 443-460 (2014) - [c7]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke:
Online Stochastic Reordering Buffer Scheduling. ICALP (1) 2014: 465-476 - [c6]Mohammad Taghi Hajiaghayi, Theodore Johnson, Mohammad Reza Khani, Barna Saha:
Hierarchical graph partitioning. SPAA 2014: 51-60 - [c5]Gagan Goel, MohammadTaghi Hajiaghayi, Mohammad Reza Khani:
Randomized Revenue Monotone Mechanisms for Online Advertising. WINE 2014: 324-337 - [c4]Gagan Goel, Mohammad Reza Khani:
Revenue monotone mechanisms for online advertising. WWW 2014: 723-734 - 2013
- [c3]MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. APPROX-RANDOM 2013: 218-232 - [i1]MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. CoRR abs/1306.3739 (2013) - 2011
- [c2]M. Reza Khani, Mohammad R. Salavatipour:
Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems. APPROX-RANDOM 2011: 302-314 - [c1]M. Reza Khani, Mohammad R. Salavatipour:
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph. ISAAC 2011: 20-29
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-05-08 21:03 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: