Lijun Chang

Dr Lijun Chang is an Associate Professor in the School of Computer Science at The University of Sydney. His research interests include Graph, social and multimedia data, Database systems, Applied computing, Distributed computing and systems software, Other mathematical sciences, Data management and data science, and Software engineering. He joined The University of Sydney as a Lecturer in August 2017. For more information, visit his profile page at https://profiles.sydney.edu.au/lijun.chang.

Lijun Chang is a researcher at the University of Sydney with expertise in Graph Database, Graph Mining, Algorithms, and Network Science. Their work focuses on developing efficient algorithms for subgraph matching, k-edge connected components, and community detection in networks. Chang has published extensively on scalable subgraph enumeration, densest clique percolation, and shortest distance queries in road networks. Their research also explores keyword search in relational databases, diversified top-k results, and local landmark schemes for approximate shortest distance computation. The studies emphasize the intersection of graph theory, database systems, and algorithm design to address challenges in large-scale data processing.