2026 Lijun Chang: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	34	12277	11920	374	373	99	4167

Overview

Lijun Chang is affiliated with the University of Sydney in Australia, focusing primarily on research within the field of Computer Science.

Their work spans several subfields, including:

Artificial Intelligence
Computer Vision and Pattern Recognition
Computational Theory and Mathematics
Computer Networks and Communications
Statistical and Nonlinear Physics

Chang's main topics of research cover multiple areas related to graph theory and algorithms and advanced computational methods. These include:

Graph Theory and Algorithms
Advanced Graph Neural Networks
Data Management and Algorithms
Complex Network Analysis Techniques
Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Machine Learning and Algorithms

The scientist has published extensively, with frequent contributions to several reputable venues. The top publication venues for Chang include:

Proceedings of the VLDB Endowment
IEEE Transactions on Knowledge and Data Engineering
The VLDB Journal
Proceedings of the ACM on Management of Data
Proceedings of the 2022 International Conference on Management of Data

Representative recent papers authored or coauthored by Lijun Chang include:

"Efficient maximum clique computation and enumeration over large sparse graphs" (2020), The VLDB Journal
"Efficient maximum k-plex computation over large sparse graphs" (2022), Proceedings of the VLDB Endowment

Other notable papers involving frequent collaborators include:

"Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees" (2020), Proceedings of the VLDB Endowment
"Efficient size-bounded community search over large networks" (2021), Proceedings of the VLDB Endowment
"Shortest-path queries on complex networks" (2022), Proceedings of the VLDB Endowment

Lijun Chang has collaborated with a range of researchers, with the most frequent coauthors being:

Lu Qin
Ying Zhang
Kai Yao
Xuemin Lin
Dong Wen

Best Publications

Efficient Subgraph Matching by Postponing Cartesian Products

Fei Bi;Lijun Chang;Xuemin Lin;Lu Qin

333
Citations
Diversified top-k clique search

Long Yuan;Lu Qin;Xuemin Lin;Lijun Chang

204
Citations
Keyword search in databases: the power of RDBMS

Lu Qin;Jeffrey Xu Yu;Lijun Chang

184
Citations
Keyword Search in Relational Databases: A Survey.

Jeffrey Xu Yu;Lu Qin;Lijun Chang

176
Citations
Querying Communities in Relational Databases

Lu Qin;Jeffrey Xu Yu;Lijun Chang;Yufei Tao

161
Citations
Diversifying top-k results

Lu Qin;Jeffrey Xu Yu;Lijun Chang

148
Citations
Efficiently computing k-edge connected components via graph decomposition

Lijun Chang;Jeffrey Xu Yu;Lu Qin;Xuemin Lin

142
Citations
Index-Based Densest Clique Percolation Community Search in Networks

Long Yuan;Lu Qin;Wenjie Zhang;Lijun Chang

140
Citations
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme

Miao Qiao;Hong Cheng;Lijun Chang;Jeffrey Xu Yu

130
Citations
Keyword Search in Databases

Jeffrey Xu Yu;Lu Qin;Lijun Chang

127
Citations
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks

Dian Ouyang;Lu Qin;Lijun Chang;Xuemin Lin

114
Citations
Scalable distributed subgraph enumeration

Longbin Lai;Lu Qin;Xuemin Lin;Ying Zhang

107
Citations
Scalable big graph processing in MapReduce

Lu Qin;Jeffrey Xu Yu;Lijun Chang;Hong Cheng

104
Citations
Scalable subgraph enumeration in MapReduce

Longbin Lai;Lu Qin;Xuemin Lin;Lijun Chang

100
Citations
Locally Densest Subgraph Discovery

Lu Qin;Rong-Hua Li;Lijun Chang;Chengqi Zhang

98
Citations
pSCAN: Fast and exact structural graph clustering

Lijun Chang;Wei Li;Xuemin Lin;Lu Qin

83
Citations
Fast Maximal Cliques Enumeration in Sparse Graphs

Lijun Chang;Jeffrey Xu Yu;Lu Qin

82
Citations
The exact distance to destination in undirected world

Lijun Chang;Jeffrey Xu Yu;Lu Qin;Hong Cheng

80
Citations
More is simpler: effectively and efficiently assessing node-pair similarities based on hyperlinks

Weiren Yu;Xuemin Lin;Wenjie Zhang;Lijun Chang

79
Citations
Efficient Maximum Clique Computation over Large Sparse Graphs

Lijun Chang

72
Citations
Scaling Distance Labeling on Small-World Networks

Wentao Li;Miao Qiao;Lu Qin;Ying Zhang

59
Citations

Frequent Co-Authors

Lu Qin University of Technology Sydney

Xuemin Lin Shanghai Jiao Tong University

Jeffrey Xu Yu Chinese University of Hong Kong

Wenjie Zhang University of New South Wales

Ying Zhang University of Technology Sydney

Hong Cheng Chinese University of Hong Kong

Jian Pei Duke University

Yufei Tao Chinese University of Hong Kong

Chengqi Zhang Hong Kong Polytechnic University

Philip S. Yu University of Illinois at Chicago

External Links

Personal website of Lijun Chang

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

When considering a Computer Science degree in the USA, it's useful to explore other STEM fields that offer flexible, affordable online study options and diverse career outcomes. Many students interested in technology or engineering often look into the cheapest online mechanical engineering degree programs for a strong foundation in problem-solving and design.

Another popular option is earning your physics degree online, which is ideal for those who want a broad scientific background and critical thinking skills that can be applied to a wide range of industries, including tech and research.

For students interested in fields with high growth and earning potential, pursuing a data science degree online is an excellent choice. Data science combines programming, mathematics, and analytics to solve real-world problems—skills that are in high demand.

Lastly, if you are interested in electronics or hardware, researching the online electrical engineering career outcomes can provide insights into roles in energy, robotics, and technology development.