Publications
2025
[VLDB2025] Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
Qiuyang Mang, Jingbang Chen, Hangrui Zhou, Yu Gao, Yingli Zhou, Qingyu Shi, Richard Peng, Yixiang Fang, Chenhao Ma[VLDB2025] In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
Yingli Zhou, Qingshuo Guo, Yi Yang, Yixiang Fang, Chenhao Ma, Laks V.S. Lakshmanan[VLDB2025] PRICE: A Pretrained Model for Cross-Database Cardinality Estimation
Tianjing Zeng, Junwei Lan, Jiahong Ma, Wenqing Wei, Rong Zhu, Yingli Zhou, Pengfei Li, Bolin, Ding, Defu Lian, Zhewei Wei, Jingren Zhou
2024
[VLDB2024] Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks
Yingli Zhou, Yixiang Fang, Chenhao Ma, Tianci Hou, Xin Huang[VLDB2024] Efficient Parallel D-core Decomposition at Scale
Wensheng Luo, Yixiang Fang, Chunxu Lin, Yingli Zhou[SIGMOD2024] A Counting-based Approach for Efficient 𝑘-Clique Densest Subgraph Discovery
Yingli Zhou, Qingshuo Guo, Yixiang Fang, Chenhao Ma
2023