37 citations · 54 across the 4 of their papers we have counts for
5 papers
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…
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…
Semi-Supervised Hierarchical Graph Classification
Jia Li, Yongfeng Huang, Heng Chang +1
Node classification and graph classification are two graph learning problems that predict the class label of a node and the class label of a graph respectively. A node of a graph u…
Graph Pattern Matching for Dynamic Team Formation
Shuai Ma, Jia Li, Chunming Hu +2
Finding a list of k teams of experts, referred to as top-k team formation, with the required skills and high collaboration compatibility has been extensively studied. However, exis…
Big Graph Search: Challenges and Techniques
Shuai Ma, Jia Li, Chunming Hu +2
On one hand, compared with traditional relational and XML models, graphs have more expressive power and are widely used today. On the other hand, various applications of social com…