M
Mehdi Kargar
Researcher at Ryerson University
Publications - 73
Citations - 1053
Mehdi Kargar is an academic researcher from Ryerson University. The author has contributed to research in topics: Computer science & Approximation algorithm. The author has an hindex of 14, co-authored 62 publications receiving 834 citations. Previous affiliations of Mehdi Kargar include Sharif University of Technology & University of Ontario Institute of Technology.
Papers
More filters
Proceedings ArticleDOI
Discovering top-k teams of experts with/without a leader in social networks
Mehdi Kargar,Aijun An +1 more
TL;DR: Two procedures that produce top-k teams of experts with or without a leader in polynomial delay are proposed and the effectiveness and scalability of the proposed methods are demonstrated.
Journal ArticleDOI
Keyword search in graphs: finding r-cliques
Mehdi Kargar,Aijun An +1 more
TL;DR: An exact algorithm is proposed that finds all r-cliques in the input graph and an approximation algorithm that produces r-Cliques with 2-approximation in polynomial delay is proposed, which confirms the efficiency and accuracy of finding r- cliques in graphs.
Book ChapterDOI
Efficient bi-objective team formation in social networks
TL;DR: The problem of finding a team of experts from a social network to complete a project that requires a set of skills and minimizes the communication cost as well as the personnel cost is tackled.
Proceedings Article
Finding Affordable and Collaborative Teams from a Network of Experts.
TL;DR: This work proposes several (α, β)-approximation algorithms that receive a budget on one objective and minimizes the other objective within the budget with guaranteed performance bounds and shows that the problem of minimizing these objectives is NP-hard.
Journal ArticleDOI
User community detection via embedding of social network structure and temporal content
TL;DR: This paper identifies user communities through multimodal feature learning (embeddings) through a new method for learning neural embeddings for users based on their temporal content similarity and finds that content- based methods produce higher quality communities compared to link-based methods.