Vahid Liaghat

According to our database1, Vahid Liaghat authored at least 21 papers between 2011 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Greedy Algorithms for Online Survivable Network Design.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Online Degree-Bounded Steiner Network Design.
CoRR, 2017

Stochastic k-Server: How Should Uber Work?.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Prophet Inequality and Online Auctions.
Encyclopedia of Algorithms, 2016

Online Degree-Bounded Steiner Network Design.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Online Energy Storage Management: an Algorithmic Approach.
Proceedings of the Approximation, 2016

2015
Primal-Dual Techniques for Online Algorithms and Mechanisms.
PhD thesis, 2015

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Prophet Secretary.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Online Stochastic Reordering Buffer Scheduling.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
PACE: Policy-Aware Application Cloud Embedding.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Online Node-Weighted Steiner Forest and Extensions via Disk Paintings.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

The Online Stochastic Generalized Assignment Problem.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Online prophet-inequality matching with applications to ad allocation.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011
Colorful Paths in Vertex Coloring of Graphs.
Electron. J. Comb., 2011

On a local protocol for concurrent file transfers.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

AdCell: Ad Allocation in Cellular Networks.
Proceedings of the Algorithms - ESA 2011, 2011

Parameterized Complexity of Problems in Coalitional Resource Games.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011


  Loading...