Vahid Liaghat

454 total citations
16 papers, 182 citations indexed

About

Vahid Liaghat is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Management Science and Operations Research. According to data from OpenAlex, Vahid Liaghat has authored 16 papers receiving a total of 182 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computer Networks and Communications, 9 papers in Computational Theory and Mathematics and 6 papers in Management Science and Operations Research. Recurrent topics in Vahid Liaghat's work include Optimization and Search Problems (10 papers), Complexity and Algorithms in Graphs (8 papers) and Auction Theory and Applications (6 papers). Vahid Liaghat is often cited by papers focused on Optimization and Search Problems (10 papers), Complexity and Algorithms in Graphs (8 papers) and Auction Theory and Applications (6 papers). Vahid Liaghat collaborates with scholars based in United States, Iran and China. Vahid Liaghat's co-authors include MohammadTaghi Hajiaghayi, Saeed Alaei, Hossein Esfandiari, Morteza Monemizadeh, Mohammad Taghi Hajiaghayi, Yufan Yang, Dan Li, Gordon Wilfong, Chuanxiong Guo and Krzysztof Onak and has published in prestigious journals such as SIAM Journal on Computing, SIAM Journal on Discrete Mathematics and Theory of Computing Systems.

In The Last Decade

Vahid Liaghat

13 papers receiving 179 citations

Peers

Vahid Liaghat

CNC

MSOR

CTM

John Noga United States

Nir Andelman Israel

Yogeshwer Sharma United States

Qingqin Nong China

Spyros Kontogiannis Greece

Onkar Bhardwaj United States

Daniël Reijsbergen Singapore

Petra Schuurman Netherlands

Chenhao Wang China

Mahsa Derakhshan United States

John Noga United States

Vahid Liaghat

326 ×2.4

CNC

69 ×1.0

MSOR

47 ×0.9

CTM

31 ×1.2

25 ×1.0

Citations per year, relative to Vahid Liaghat Vahid Liaghat (= 1×) peers John Noga

Countries citing papers authored by Vahid Liaghat

Since Specialization

Citations

This map shows the geographic impact of Vahid Liaghat's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Vahid Liaghat with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vahid Liaghat more than expected).

Fields of papers citing papers by Vahid Liaghat

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Vahid Liaghat. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Vahid Liaghat. The network helps show where Vahid Liaghat may publish in the future.

Co-authorship network of co-authors of Vahid Liaghat

This figure shows the co-authorship network connecting the top 25 collaborators of Vahid Liaghat. A scholar is included among the top collaborators of Vahid Liaghat based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Vahid Liaghat. Vahid Liaghat is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

16 of 16 papers shown

Hajiaghayi, Mohammad Taghi, et al.. (2018). Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems. SIAM Journal on Computing. 47(4). 1275–1293. 4 indexed citations

Hajiaghayi, MohammadTaghi, et al.. (2018). Greedy Algorithms for Online Survivable Network Design. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Esfandiari, Hossein, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, & Krzysztof Onak. (2018). Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. ACM Transactions on Algorithms. 14(4). 1–23. 12 indexed citations

Hajiaghayi, MohammadTaghi, Vahid Liaghat, & Debmalya Panigrahi. (2017). Online Node-weighted Steiner Forest and Extensions via Disk Paintings. SIAM Journal on Computing. 46(3). 911–935.

Esfandiari, Hossein, MohammadTaghi Hajiaghayi, Vahid Liaghat, & Morteza Monemizadeh. (2017). Prophet Secretary. SIAM Journal on Discrete Mathematics. 31(3). 1685–1701. 28 indexed citations

Kim, Anthony, Vahid Liaghat, Junjie Qin, & Amin Saberi. (2016). Online Energy Storage Management: an Algorithmic Approach. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Hajiaghayi, MohammadTaghi, et al.. (2016). Online degree-bounded steiner network design. Symposium on Discrete Algorithms. 164–175.

Esfandiari, Hossein, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, & Krzysztof Onak. (2014). Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. 1217–1233. 15 indexed citations

Liaghat, Vahid, MohammadTaghi Hajiaghayi, Dan Li, et al.. (2013). PACE: Policy-Aware Application Cloud Embedding. 638–646. 46 indexed citations

10.

Hajiaghayi, Mohammad Taghi, Vahid Liaghat, & Debmalya Panigrahi. (2013). Online Node-Weighted Steiner Forest and Extensions via Disk Paintings. 558–567. 6 indexed citations

11.

Hajiaghayi, Mohammad Taghi, Rohit Khandekar, Guy Kortsarz, & Vahid Liaghat. (2013). On a Local Protocol for Concurrent File Transfers. Theory of Computing Systems. 55(3). 613–636. 1 indexed citations

12.

Alaei, Saeed, MohammadTaghi Hajiaghayi, & Vahid Liaghat. (2012). Online prophet-inequality matching with applications to ad allocation. 18–35. 47 indexed citations

13.

Chitnis, Rajesh, MohammadTaghi Hajiaghayi, & Vahid Liaghat. (2011). Parameterized Complexity of Problems in Coalitional Resource Games. Proceedings of the AAAI Conference on Artificial Intelligence. 25(1). 620–625. 4 indexed citations

14.

Akbari, Saieed, Vahid Liaghat, & Afshin Nikzad. (2011). Colorful Paths in Vertex Coloring of Graphs. The Electronic Journal of Combinatorics. 18(1). 13 indexed citations

15.

Chitnis, Rajesh, Mohammad Taghi Hajiaghayi, & Vahid Liaghat. (2011). Parameterized Complexity of Problems in Coalitional Resource Games. arXiv (Cornell University). 620–625. 2 indexed citations

16.

Hajiaghayi, MohammadTaghi, Rohit Khandekar, Guy Kortsarz, & Vahid Liaghat. (2011). On a local protocol for concurrent file transfers. 269–278. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact