dblp: Vahid Liaghat
https://dblp.org/pid/82/9672.html
dblp person page RSS feedWed, 08 May 2024 21:01:15 +0200en-USdaily1released under the CC0 1.0 licensedblp@dagstuhl.de (dblp team)dblp@dagstuhl.de (dblp team)Computers/Computer_Science/Publications/Bibliographieshttp://www.rssboard.org/rss-specificationhttps://dblp.org/img/logo.144x51.pngdblp: Vahid Liaghathttps://dblp.org/pid/82/9672.html14451Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.https://doi.org/10.1137/15M102695XMohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, Vahid Liaghat: Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.SIAM J. Comput.47(4): 1275-1293 (2018)]]>https://dblp.org/rec/journals/siamcomp/BateniHL18Mon, 01 Jan 2018 00:00:00 +0100Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.https://doi.org/10.1145/3230819Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak: Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.ACM Trans. Algorithms14(4): 48:1-48:23 (2018)]]>https://dblp.org/rec/journals/talg/EsfandiariHLMO18Mon, 01 Jan 2018 00:00:00 +0100Greedy Algorithms for Online Survivable Network Design.https://doi.org/10.4230/LIPIcs.ICALP.2018.152Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin: Greedy Algorithms for Online Survivable Network Design.ICALP2018: 152:1-152:14]]>https://dblp.org/rec/conf/icalp/DehghaniEHLS18Mon, 01 Jan 2018 00:00:00 +0100Online Node-weighted Steiner Forest and Extensions via Disk Paintings.https://doi.org/10.1137/14098692XMohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi: Online Node-weighted Steiner Forest and Extensions via Disk Paintings.SIAM J. Comput.46(3): 911-935 (2017)]]>https://dblp.org/rec/journals/siamcomp/HajiaghayiLP17Sun, 01 Jan 2017 00:00:00 +0100Prophet Secretary.https://doi.org/10.1137/15M1029394Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh: Prophet Secretary.SIAM J. Discret. Math.31(3): 1685-1701 (2017)]]>https://dblp.org/rec/journals/siamdm/EsfandiariHLM17Sun, 01 Jan 2017 00:00:00 +0100Stochastic k-Server: How Should Uber Work?.https://doi.org/10.4230/LIPIcs.ICALP.2017.126Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin: Stochastic k-Server: How Should Uber Work?.ICALP2017: 126:1-126:14]]>https://dblp.org/rec/conf/icalp/DehghaniEHLS17Sun, 01 Jan 2017 00:00:00 +0100Online Degree-Bounded Steiner Network Design.http://arxiv.org/abs/1704.05430Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke: Online Degree-Bounded Steiner Network Design.CoRRabs/1704.05430 (2017)]]>https://dblp.org/rec/journals/corr/DehghaniEHLR17Sun, 01 Jan 2017 00:00:00 +0100Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.http://arxiv.org/abs/1704.05811Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin: Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.CoRRabs/1704.05811 (2017)]]>https://dblp.org/rec/journals/corr/DehghaniEHLRS17Sun, 01 Jan 2017 00:00:00 +0100Stochastic k-Server: How Should Uber Work?http://arxiv.org/abs/1705.05755Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin: Stochastic k-Server: How Should Uber Work?CoRRabs/1705.05755 (2017)]]>https://dblp.org/rec/journals/corr/DehghaniEHLS17Sun, 01 Jan 2017 00:00:00 +0100Online Energy Storage Management: an Algorithmic Approach.https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.12Anthony Kim, Vahid Liaghat, Junjie Qin, Amin Saberi: Online Energy Storage Management: an Algorithmic Approach.APPROX-RANDOM2016: 12:1-12:23]]>https://dblp.org/rec/conf/approx/KimLQS16Fri, 01 Jan 2016 00:00:00 +0100Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.https://doi.org/10.4230/LIPIcs.ICALP.2016.42Sina 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.ICALP2016: 42:1-42:14]]>https://dblp.org/rec/conf/icalp/DehghaniEHLRS16Fri, 01 Jan 2016 00:00:00 +0100Online Degree-Bounded Steiner Network Design.https://doi.org/10.1137/1.9781611974331.ch13Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat: Online Degree-Bounded Steiner Network Design.SODA2016: 164-175]]>https://dblp.org/rec/conf/soda/DehghaniEHL16Fri, 01 Jan 2016 00:00:00 +0100Prophet Inequality and Online Auctions.https://doi.org/10.1007/978-1-4939-2864-4_759Mohammad Taghi Hajiaghayi, Vahid Liaghat: Prophet Inequality and Online Auctions.Encyclopedia of Algorithms2016: 1634-1636]]>https://dblp.org/rec/reference/algo/HajiaghayiL16Fri, 01 Jan 2016 00:00:00 +0100Primal-Dual Techniques for Online Algorithms and Mechanisms.https://hdl.handle.net/1903/16514Vahid Liaghat: Primal-Dual Techniques for Online Algorithms and Mechanisms. University of Maryland, College Park, MD, USA, 2015]]>https://dblp.org/rec/phd/basesearch/Liaghat15Thu, 01 Jan 2015 00:00:00 +0100Prophet Secretary.https://doi.org/10.1007/978-3-662-48350-3_42Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh: Prophet Secretary.ESA2015: 496-508]]>https://dblp.org/rec/conf/esa/EsfandiariHLM15Thu, 01 Jan 2015 00:00:00 +0100Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.https://doi.org/10.1137/1.9781611973730.81Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak: Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.SODA2015: 1217-1233]]>https://dblp.org/rec/conf/soda/EsfandiariHLMO15Thu, 01 Jan 2015 00:00:00 +0100Prophet Secretary.http://arxiv.org/abs/1507.01155Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh: Prophet Secretary.CoRRabs/1507.01155 (2015)]]>https://dblp.org/rec/journals/corr/EsfandiariHLM15Thu, 01 Jan 2015 00:00:00 +0100On a Local Protocol for Concurrent File Transfers.https://doi.org/10.1007/s00224-013-9500-1Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat: On a Local Protocol for Concurrent File Transfers.Theory Comput. Syst.55(3): 613-636 (2014)]]>https://dblp.org/rec/journals/mst/HajiaghayiKKL14Wed, 01 Jan 2014 00:00:00 +0100Online Stochastic Reordering Buffer Scheduling.https://doi.org/10.1007/978-3-662-43948-7_39Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke: Online Stochastic Reordering Buffer Scheduling.ICALP (1)2014: 465-476]]>https://dblp.org/rec/conf/icalp/EsfandiariHKLMR14Wed, 01 Jan 2014 00:00:00 +0100Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems.https://doi.org/10.1007/978-3-662-43948-7_48MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi: Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems.ICALP (1)2014: 576-587]]>https://dblp.org/rec/conf/icalp/HajiaghayiLP14Wed, 01 Jan 2014 00:00:00 +0100The Online Stochastic Generalized Assignment Problem.https://doi.org/10.1007/978-3-642-40328-6_2Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat: The Online Stochastic Generalized Assignment Problem.APPROX-RANDOM2013: 11-25]]>https://dblp.org/rec/conf/approx/AlaeiHL13Tue, 01 Jan 2013 00:00:00 +0100Online Node-Weighted Steiner Forest and Extensions via Disk Paintings.https://doi.org/10.1109/FOCS.2013.66Mohammad Taghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi: Online Node-Weighted Steiner Forest and Extensions via Disk Paintings.FOCS2013: 558-567]]>https://dblp.org/rec/conf/focs/HajiaghayiLP13Tue, 01 Jan 2013 00:00:00 +0100Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems.https://doi.org/10.1007/978-3-642-39206-1_8MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat: Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems.ICALP (1)2013: 81-92]]>https://dblp.org/rec/conf/icalp/BateniHL13Tue, 01 Jan 2013 00:00:00 +0100PACE: Policy-Aware Application Cloud Embedding.https://doi.org/10.1109/INFCOM.2013.6566849Li Erran Li, Vahid Liaghat, Hongze Zhao, MohammadTaghi Hajiaghayi, Dan Li, Gordon T. Wilfong, Yang Richard Yang, Chuanxiong Guo: PACE: Policy-Aware Application Cloud Embedding.INFOCOM2013: 638-646]]>https://dblp.org/rec/conf/infocom/LiLZHLWYG13Tue, 01 Jan 2013 00:00:00 +0100Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.http://arxiv.org/abs/1304.7530MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat: Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.CoRRabs/1304.7530 (2013)]]>https://dblp.org/rec/journals/corr/abs-1304-7530Tue, 01 Jan 2013 00:00:00 +0100Online prophet-inequality matching with applications to ad allocation.https://doi.org/10.1145/2229012.2229018Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat: Online prophet-inequality matching with applications to ad allocation.EC2012: 18-35]]>https://dblp.org/rec/conf/sigecom/AlaeiHL12Sun, 01 Jan 2012 00:00:00 +0100Colorful Paths in Vertex Coloring of Graphs.https://doi.org/10.37236/504Saieed Akbari, Vahid Liaghat, Afshin Nikzad: Colorful Paths in Vertex Coloring of Graphs.Electron. J. Comb.18(1) (2011)]]>https://dblp.org/rec/journals/combinatorics/AkbariLN11Sat, 01 Jan 2011 00:00:00 +0100Parameterized Complexity of Problems in Coalitional Resource Games.https://doi.org/10.1609/aaai.v25i1.7887Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat: Parameterized Complexity of Problems in Coalitional Resource Games.AAAI2011: 620-625]]>https://dblp.org/rec/conf/aaai/ChitnisHL11Sat, 01 Jan 2011 00:00:00 +0100AdCell: Ad Allocation in Cellular Networks.https://doi.org/10.1007/978-3-642-23719-5_27Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha: AdCell: Ad Allocation in Cellular Networks.ESA2011: 311-322]]>https://dblp.org/rec/conf/esa/AlaeiHLPS11Sat, 01 Jan 2011 00:00:00 +0100On a local protocol for concurrent file transfers.https://doi.org/10.1145/1989493.1989538MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat: On a local protocol for concurrent file transfers.SPAA2011: 269-278]]>https://dblp.org/rec/conf/spaa/HajiaghayiKKL11Sat, 01 Jan 2011 00:00:00 +0100Parameterized Complexity of Problems in Coalitional Resource Games.http://arxiv.org/abs/1105.0707Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat: Parameterized Complexity of Problems in Coalitional Resource Games.CoRRabs/1105.0707 (2011)]]>https://dblp.org/rec/journals/corr/abs-1105-0707Sat, 01 Jan 2011 00:00:00 +0100AdCell: Ad Allocation in Cellular Networks.http://arxiv.org/abs/1112.5396Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha: AdCell: Ad Allocation in Cellular Networks.CoRRabs/1112.5396 (2011)]]>https://dblp.org/rec/journals/corr/abs-1112-5396Sat, 01 Jan 2011 00:00:00 +0100