Lijun Chang

University of Sydney — Australia

Computer Science · Physical Sciences

35h-index3.8kcitations139works2.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Data Management and Algorithms(63), Graph Theory and Algorithms(45), Advanced Graph Neural Networks(43), Complex Network Analysis Techniques(36), Advanced Database Systems and Queries(31)

Publications139 total

Detecting Structural Balanced Near-Cliques in Large Signed Graphs
IEEE Transactions on Knowledge and Data Engineering·2025
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods
Proceedings of the ACM on Management of Data·2025Open Access
Identifying Maximum Defective Bicliques in Large Bipartite Graphs
2025
Probabilistic Truss Decomposition on Uncertain Graphs: Indexing and Dynamic Maintenance
ACM Transactions on Database Systems·2025Open Access
A Local Search Approach to Efficient ( <i>k,p</i> )-Core Maintenance
Proceedings of the ACM on Management of Data·2025· 1 cited
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
Proceedings of the VLDB Endowment·2024· 2 cited
Efficient <i>k</i> -Clique Count Estimation with Accuracy Guarantee
Proceedings of the VLDB Endowment·2024· 5 cited
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
arXiv (Cornell University)·2024Open Access
Maximum k-Plex Computation: Theory and Practice
Proceedings of the ACM on Management of Data·2024· 11 citedOpen Access
Identifying similar-bicliques in bipartite graphs
The VLDB Journal·2024· 3 citedOpen Access
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity
Proceedings of the ACM on Management of Data·2023· 8 citedOpen Access
On Directed Densest Subgraph Detection
Lecture notes in computer science·2023
Identifying Large Structural Balanced Cliques in Signed Graphs
IEEE Transactions on Knowledge and Data Engineering·2023· 4 cited
A near-optimal approach to edge connectivity-based hierarchical graph decomposition
The VLDB Journal·2023· 1 citedOpen Access
Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract)
2023
Verification-Free Approaches to Efficient Locally Densest Subgraph Discovery
2023· 4 cited
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks
The VLDB Journal·2023· 14 cited
Efficient maximum <i>k</i> -plex computation over large sparse graphs
Proceedings of the VLDB Endowment·2022· 23 cited
Identifying similar-bicliques in bipartite graphs
Proceedings of the VLDB Endowment·2022· 15 cited
Shortest-path queries on complex networks
Proceedings of the VLDB Endowment·2022· 20 cited
page 1 of 7Next →

Frequent Co-authors

Lu Qin(39), Xuemin Lin(25), Jeffrey Xu Yu(17), Wenjie Zhang(15), Ying Zhang(11), Miao Qiao(5), Dian Ouyang(4), Long Yuan(4), Hong Cheng(4), Dong Wen(4), Longbin Lai(3), Fei Bi(2), Shiyu Yang(2), Long Yuan(2), Rong-Hua Li(2), Chengqi Zhang(2), Wentao Li(2), Wei Li(2), Long Yuan(1), Jianye Yang(1)