![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Vahid Liaghat
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j6]Mohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, Vahid Liaghat:
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems. SIAM J. Comput. 47(4): 1275-1293 (2018) - [j5]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. ACM Trans. Algorithms 14(4): 48:1-48:23 (2018) - [c17]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin:
Greedy Algorithms for Online Survivable Network Design. ICALP 2018: 152:1-152:14 - 2017
- [j4]MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi:
Online Node-weighted Steiner Forest and Extensions via Disk Paintings. SIAM J. Comput. 46(3): 911-935 (2017) - [j3]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. SIAM J. Discret. Math. 31(3): 1685-1701 (2017) - [c16]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin:
Stochastic k-Server: How Should Uber Work?. ICALP 2017: 126:1-126:14 - [i7]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke:
Online Degree-Bounded Steiner Network Design. CoRR abs/1704.05430 (2017) - [i6]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin:
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. CoRR abs/1704.05811 (2017) - [i5]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin:
Stochastic k-Server: How Should Uber Work? CoRR abs/1705.05755 (2017) - 2016
- [c15]Anthony Kim
, Vahid Liaghat, Junjie Qin, Amin Saberi:
Online Energy Storage Management: an Algorithmic Approach. APPROX-RANDOM 2016: 12:1-12:23 - [c14]Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin:
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. ICALP 2016: 42:1-42:14 - [c13]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Online Degree-Bounded Steiner Network Design. SODA 2016: 164-175 - [r1]Mohammad Taghi Hajiaghayi, Vahid Liaghat:
Prophet Inequality and Online Auctions. Encyclopedia of Algorithms 2016: 1634-1636 - 2015
- [b1]Vahid Liaghat:
Primal-Dual Techniques for Online Algorithms and Mechanisms. University of Maryland, College Park, MD, USA, 2015 - [c12]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. ESA 2015: 496-508 - [c11]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. SODA 2015: 1217-1233 - [i4]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. CoRR abs/1507.01155 (2015) - 2014
- [j2]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a Local Protocol for Concurrent File Transfers. Theory Comput. Syst. 55(3): 613-636 (2014) - [c10]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke:
Online Stochastic Reordering Buffer Scheduling. ICALP (1) 2014: 465-476 - [c9]MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi:
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems. ICALP (1) 2014: 576-587 - 2013
- [c8]Saeed Alaei
, MohammadTaghi Hajiaghayi, Vahid Liaghat:
The Online Stochastic Generalized Assignment Problem. APPROX-RANDOM 2013: 11-25 - [c7]Mohammad Taghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi:
Online Node-Weighted Steiner Forest and Extensions via Disk Paintings. FOCS 2013: 558-567 - [c6]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems. ICALP (1) 2013: 81-92 - [c5]Li Erran Li, Vahid Liaghat, Hongze Zhao, MohammadTaghi Hajiaghayi, Dan Li, Gordon T. Wilfong, Yang Richard Yang, Chuanxiong Guo
:
PACE: Policy-Aware Application Cloud Embedding. INFOCOM 2013: 638-646 - [i3]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems. CoRR abs/1304.7530 (2013) - 2012
- [c4]Saeed Alaei
, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Online prophet-inequality matching with applications to ad allocation. EC 2012: 18-35 - 2011
- [j1]Saieed Akbari
, Vahid Liaghat, Afshin Nikzad:
Colorful Paths in Vertex Coloring of Graphs. Electron. J. Comb. 18(1) (2011) - [c3]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Parameterized Complexity of Problems in Coalitional Resource Games. AAAI 2011: 620-625 - [c2]Saeed Alaei
, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei
, Barna Saha:
AdCell: Ad Allocation in Cellular Networks. ESA 2011: 311-322 - [c1]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a local protocol for concurrent file transfers. SPAA 2011: 269-278 - [i2]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Parameterized Complexity of Problems in Coalitional Resource Games. CoRR abs/1105.0707 (2011) - [i1]Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha:
AdCell: Ad Allocation in Cellular Networks. CoRR abs/1112.5396 (2011)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint