SIGMOD 2027
Scaling Up Density Decomposition on Massive Graphs
Yalong Zhang — About me
Hi! I received my B.S. degree in Computer Science from the Beijing Institute of Technology in 2025, where I was extremely fortunate to be advised by Prof. Rong-Hua Li, who has opened the doors to the fascinating world of graph theory for me! I am excited to be starting my Ph.D. at the University of New South Wales (UNSW), under the supervision of Prof. Wenjie Zhang and Dr. Dong Wen.
My research interests lie in graph data mining, particularly in designing graph algorithms based on flow techniques and optimization problems. I am always excited to exchange ideas, so don't hesitate to contact me!
Email: yalong-zhang@qq.com
Publications
Google Scholar ↗ICDE 2026
Density Decomposition of Multilayer Graphs
IEEE TKDE
Pseudoarboricity-Based Skyline Important Community Search in Large Networks
ICDE 2026
Querying Historical k-Dense Subgraphs on Temporal Graphs
VLDB Journal
Density Decomposition on Large Static and Dynamic Graphs: Algorithms and Applications
↗SIGMOD 2025
Integral Densest Subgraph Search on Directed Graphs
↗VLDB 2025
Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs
↗SIGMOD 2025
Density Decomposition of Bipartite Graphs
↗VLDB 2024
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs
↗VLDB 2024
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs
↗Academic service
Reviewer
ACM Transactions on Knowledge Discovery from Data (TKDD)
Grants
2024–2025 · Completed
Beijing Natural Science Foundation Undergraduate Research Grant
