activity
20192026
most citedEfficient Bitruss Decomposition for Large-scale Bipartite Graphs

4 citations · 14 across the 28 of their papers we have counts for

collaborators

30 papers

cs.DB2026

Algebraic Subgraph Counting

Qiuyu Guo, Jianye Yang, Wenjie Zhang +3

Subgraph isomorphism counting is a fundamental problem in graph analytics, which aims to find the number of subgraph isomorphisms of a query graph in a data graph. The candidate tr…

cs.DB2026

Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter

Yuanhang Yu, Dawei Cheng, Ying Zhang +3

Nearest neighbor search on high-dimensional vectors is fundamental in modern AI and database systems. In many real-world applications, queries involve constraints on multiple numer…

cs.DB2026

RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning

Wei Huang, Hanchen Wang, Dong Wen +4

Identifying the most frequent induced subgraph of size in a target graph is a fundamental graph mining problem with direct implications for Web-related data mining and social n…

cs.CL2026

HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery

Shiyuan Liu, Jianwei Wang, Xuemin Lin +3

As a pivotal task in data lake management, joinable table discovery has attracted widespread interest. While existing language model-based methods achieve remarkable performance by…

cs.SI2025

UniCom: Towards a Unified and Cohesiveness-aware Framework for Community Search and Detection

Yifan Zhu, Hanchen Wang, Wenjie Zhang +2

Searching and detecting communities in real-world graphs underpins a wide range of applications. Despite the success achieved, current learning-based solutions regard community sea…

cs.LG2025

FADTI: Fourier and Attention Driven Diffusion for Multivariate Time Series Imputation

Runze Li, Hanchen Wang, Wenjie Zhang +4

Multivariate time series imputation is fundamental in applications such as healthcare, traffic forecasting, and biological modeling, where sensor failures and irregular sampling le…