85 citations · 225 across the 16 of their papers we have counts for
17 papers
Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs
Jiaxi Pu, Yanhao Wang, Yuchen Li +1
Temporal bipartite graphs are widely used to denote time-evolving relationships between two disjoint sets of nodes, such as customer-product interactions in E-commerce and user-gro…
Spectral Normalized-Cut Graph Partitioning with Fairness Constraints
Jia Li, Yanhao Wang, Arpit Merchant
Normalized-cut graph partitioning aims to divide the set of nodes in a graph into disjoint clusters to minimize the fraction of the total edges between any cluster and all othe…
Opinion-aware Influence Maximization in Online Social Networks
Ying Wang, Yanhao Wang
Influence maximization (IM) aims to find seed users on an online social network to maximize the spread of information about a target product through word-of-mouth propagation among…
Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms
Yanhao Wang, Michael Mathioudakis, Jia Li +1
Diversity maximization aims to select a diverse and representative subset of items from a large dataset. It is a fundamental optimization task that finds applications in data summa…
SAH: Shifting-aware Asymmetric Hashing for Reverse -Maximum Inner Product Search
Qiang Huang, Yanhao Wang, Anthony K. H. Tung
This paper investigates a new yet challenging problem called Reverse -Maximum Inner Product Search (RMIPS). Given a query (item) vector, a set of item vectors, and a set of u…
Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams
Jingjing Wang, Yanhao Wang, Wenjun Jiang +2
A great variety of complex systems, from user interactions in communication networks to transactions in financial markets, can be modeled as temporal graphs consisting of a set of…