Lijun Chang

Dr. Lijun Chang is an Associate Professor in the School of Computer Science at the University of Sydney. He holds an ARC Future Fellowship (2019–2022) and an ARC DECRA Fellowship (2015–2017). Previously, he was at the University of New South Wales. His research focuses on graph analytics, mining, algorithms, and network science. He teaches courses like INFO5011 (Competitive Programming), COMP5313 (Large Scale Networks), and COMP9120 (Database Management Systems), and coaches the USYD Programming Competition Teams.

Education: B.Eng. in Computer Science & Technology from Renmin University of China; PhD from the Chinese University of Hong Kong.

Research highlights include scalable graph processing systems (e.g., ScaleG), densest subgraph detection, and graph similarity search. He leads projects funded by ARC grants such as 'Advanced Search of Cohesive Subgraphs in Big Graphs' (2018) and 'Directionality-Aware Cohesive Subgraph Search' (2022). His work emphasizes efficient algorithms for large-scale networks and graph databases.

• Awards: ARC Future Fellow, ARC DECRA Fellow
• Students: Yu KONG, Rashmika MATHTHAKA GAMAGE, Mouyi XU
• Labs/Teams: Focuses on graph algorithms and systems research, contributing to open-source tools and large-scale network analysis.