Lijun Chang

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 74

Top Venues

Chinese University of Hong Kong, Hong Kong (PHD)

Education History

Chinese University of Hong Kong, Hong Kong

PHD

Publications

Lijun Chang, Zhiyi Wang
A near-optimal approach to edge connectivity-based hierarchical graph decomposition. VLDB J. 33 (1) (2024)
Lijun Chang, Kai Yao
Maximum k-Plex Computation: Theory and Practice. Proc. ACM Manag. Data 2 (1) (2024)
Kai Yao, Lijun Chang, Lu Qin
Identifying Large Structural Balanced Cliques in Signed Graphs. IEEE Trans. Knowl. Data Eng. 36 (3) (2024)
Kai Yao, Lijun Chang, Jeffrey Xu Yu
Identifying similar-bicliques in bipartite graphs. VLDB J. 33 (3) (2024)
Lijun Chang
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance. CoRR (2024)
Lijun Chang
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity. Proc. ACM Manag. Data 1 (3) (2023)
Xubo Wang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, Wenjie Zhang
ScaleG: A Distributed Disk-Based System for Vertex-Centric Graph Processing. IEEE Trans. Knowl. Data Eng. 35 (2) (2023)
Tran Ba Trung, Lijun Chang, Nguyen Tien Long, Kai Yao, Huynh Thi Thanh Binh
Verification-Free Approaches to Efficient Locally Densest Subgraph Discovery. ICDE (2023)
Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. VLDB J. 32 (6) (2023)
Jens Dietrich, Lijun Chang, Long Qian, Lyndon M. Henry, Catherine McCartin, Bernhard Scholz
Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract). ICDE (2023)
Lijun Chang, Xing Feng, Kai Yao, Lu Qin, Wenjie Zhang
Accelerating Graph Similarity Search via Efficient GED Computation. IEEE Trans. Knowl. Data Eng. 35 (5) (2023)
Lijun Chang
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity. CoRR (2023)
Kai Yao, Xin Yang, Lijun Chang
On Directed Densest Subgraph Detection. ADC (2023)
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin
Distance labeling: on parallelism, compression, and ordering. VLDB J. 31 (1) (2022)
Dong Wen, Bohua Yang, Lu Qin, Ying Zhang, Lijun Chang, Rong-Hua Li
Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach. IEEE Trans. Knowl. Data Eng. 34 (7) (2022)
Lijun Chang, Zhiyi Wang
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition. Proc. VLDB Endow. 15 (6) (2022)
Junhua Zhang, Wentao Li, Long Yuan, Lu Qin, Ying Zhang, Lijun Chang
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement. Proc. VLDB Endow. 15 (11) (2022)
Wentao Li, Miao Qiao, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin
On Scalable Computation of Graph Eccentricities. SIGMOD Conference (2022)
Yuanyuan Zhu, Qian Zhang, Lu Qin, Lijun Chang, Jeffrey Xu Yu
Cohesive Subgraph Search Using Keywords in Large Networks. IEEE Trans. Knowl. Data Eng. 34 (1) (2022)
Kai Yao, Lijun Chang, Jeffrey Xu Yu
Identifying Similar-Bicliques in Bipartite Graphs. Proc. VLDB Endow. 15 (11) (2022)
Yizhou Dai, Miao Qiao, Lijun Chang
Anchored Densest Subgraph. SIGMOD Conference (2022)
Jens Dietrich, Lijun Chang, Long Qian, Lyndon M. Henry, Catherine McCartin, Bernhard Scholz
Efficient Sink-Reachability Analysis via Graph Reduction. IEEE Trans. Knowl. Data Eng. 34 (11) (2022)
Kai Yao, Lijun Chang, Lu Qin
Computing Maximum Structural Balanced Cliques in Signed Graphs. ICDE (2022)
Lijun Chang, Mouyi Xu, Darren Strash
Efficient Maximum k-Plex Computation over Large Sparse Graphs. Proc. VLDB Endow. 16 (2) (2022)
Xubo Wang, Dong Wen, Lu Qin, Lijun Chang, Wenjie Zhang
ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing (Extended Abstract). ICDE (2022)
Lijun Chang
Application of Fuzzy Comprehensive Evaluation Based on Genetic Algorithm in Psychological Measurement. Sci. Program. 2021 (2021)
Kai Yao, Lijun Chang
Efficient Size-Bounded Community Search over Large Networks. Proc. VLDB Endow. 14 (8) (2021)
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. SIGMOD Conference (2020)
Dian Ouyang, Long Yuan, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees. Proc. VLDB Endow. 13 (5) (2020)
Lijun Chang
Efficient maximum clique computation and enumeration over large sparse graphs. VLDB J. 29 (5) (2020)
Mingshen Cai, Lijun Chang
Efficient Closest Community Search over Large Graphs. DASFAA (2) (2020)
Xubo Wang, Lu Qin, Lijun Chang, Ying Zhang, Dong Wen, Xuemin Lin
Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System. CoRR (2020)
Maram Alsahafy, Lijun Chang
Fast Algorithm for Distance Dynamics-Based Community Detection. WISE (1) (2020)
Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang, Dian Ouyang
Speeding Up GED Verification for Graph Similarity Search. ICDE (2020)
Lijun Chang, Miao Qiao
Deconstruct Densest Subgraphs. WWW (2020)
Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin
Progressive Top-K Nearest Neighbors Search in Large Road Networks. SIGMOD Conference (2020)
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin
Scaling Distance Labeling on Small-World Networks. SIGMOD Conference (2019)
Maram Alsahafy, Lijun Chang
Computing Maximum Independent Sets over Large Sparse Graphs. WISE (2019)
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin
Eccentricities on small-world networks. VLDB J. 28 (5) (2019)
Bohua Yang, Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Rong-Hua Li
Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs. ICDE (2019)
Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang
Leveraging set relations in exact and dynamic set similarity join. VLDB J. 28 (2) (2019)
Bingqing Lyu, Lu Qin, Xuemin Lin, Lijun Chang, Jeffrey Xu Yu
Supergraph Search in Graph Databases via Hierarchical Feature-Tree. IEEE Trans. Knowl. Data Eng. 31 (2) (2019)
Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Ling Chen
Enumerating k-Vertex Connected Components in Large Graphs. ICDE (2019)
Lijun Chang
Efficient Maximum Clique Computation over Large Sparse Graphs. KDD (2019)
Lijun Chang, Lu Qin
Cohesive Subgraph Computation Over Large Sparse Graphs. ICDE (2019)
Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin
Efficient structural graph clustering: an index-based approach. VLDB J. 28 (3) (2019)
Long Yuan, Lu Qin, Wenjie Zhang, Lijun Chang, Jianye Yang
Index-Based Densest Clique Percolation Community Search in Networks (Extended Abstract). ICDE (2019)
Yuanyuan Zhu, Qian Zhang, Lu Qin, Lijun Chang, Jeffrey Xu Yu
Querying Cohesive Subgraphs by Keywords. ICDE (2018)
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin
Exacting Eccentricity for Small-World Networks. ICDE (2018)
Fei Bi, Lijun Chang, Xuemin Lin, Wenjie Zhang
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities. Proc. VLDB Endow. 11 (9) (2018)
Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, Qing Zhu
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. SIGMOD Conference (2018)
Long Yuan, Lu Qin, Wenjie Zhang, Lijun Chang, Jianye Yang
Index-Based Densest Clique Percolation Community Search in Networks. IEEE Trans. Knowl. Data Eng. 30 (5) (2018)
Pavle Subotic, Herbert Jordan, Lijun Chang, Alan D. Fekete, Bernhard Scholz
Automatic Index Selection for Large-Scale Datalog Computation. Proc. VLDB Endow. 12 (2) (2018)
Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang, Long Yuan
Distributed computing connected components with linear communication cost. Distributed Parallel Databases 36 (3) (2018)
Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin
Efficient Structural Graph Clustering: An Index-Based Approach. Proc. VLDB Endow. 11 (3) (2017)
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang
Effective and Efficient Dynamic Graph Coloring. Proc. VLDB Endow. 11 (3) (2017)
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang
I/O efficient ECC graph decomposition via graph reduction. VLDB J. 26 (2) (2017)
Longbin Lai, Lu Qin, Xuemin Lin, Lijun Chang
Scalable subgraph enumeration in MapReduce: a cost-oriented approach. VLDB J. 26 (3) (2017)
Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang
Leveraging Set Relations in Exact Set Similarity Join. Proc. VLDB Endow. 10 (9) (2017)
Xuefei Li, Lijun Chang, Kai Zheng, Zi Huang, Xiaofang Zhou
Ranking weighted clustering coefficient in large dynamic graphs. World Wide Web 20 (5) (2017)
Lijun Chang, Wei Li, Wenjie Zhang
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling. SIGMOD Conference (2017)
Lijun Chang
A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition. CoRR (2017)
Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang
Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation. CoRR (2017)
Lijun Chang, Chen Zhang, Xuemin Lin, Lu Qin
Scalable Top-K Structural Diversity Search. ICDE (2017)
Lijun Chang, Wei Li, Lu Qin, Wenjie Zhang, Shiyu Yang
pSCAN: Fast and Exact Structural Graph Clustering. IEEE Trans. Knowl. Data Eng. 29 (2) (2017)
Fei Bi, Lijun Chang, Xuemin Lin, Wenjie Zhang
An Optimal and Progressive Approach to Online Search of Top-k Important Communities. CoRR (2017)
Dong Wen, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang
Enumerating k-Vertex Connected Components in Large Graphs. CoRR (2017)
Bingqing Lyu, Lu Qin, Xuemin Lin, Lijun Chang, Jeffrey Xu Yu
Scalable supergraph search in large graph databases. ICDE (2016)
Lijun Chang, Wei Li, Xuemin Lin, Lu Qin, Wenjie Zhang
pSCAN: Fast and exact structural graph clustering. ICDE (2016)
Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang
Computing Connected Components with linear communication cost in pregel-like systems. ICDE (2016)
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang
Diversified top-k clique search. VLDB J. 25 (2) (2016)
Longbin Lai, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang
Scalable Distributed Subgraph Enumeration. Proc. VLDB Endow. 10 (3) (2016)
Fei Bi, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang
Efficient Subgraph Matching by Postponing Cartesian Products. SIGMOD Conference (2016)
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang
I/O Efficient ECC Graph Decomposition via Graph Reduction. Proc. VLDB Endow. 9 (7) (2016)
Lijun Chang, Xuemin Lin, Wenjie Zhang, Jeffrey Xu Yu, Ying Zhang, Lu Qin
Optimal Enumeration: Efficient Top-k Tree Matching. Proc. VLDB Endow. 8 (5) (2015)
Wenjie Zhang, Aiping Li, Muhammad Aamir Cheema, Ying Zhang, Lijun Chang
Probabilistic n-of-N skyline computation over uncertain data streams. World Wide Web 18 (5) (2015)
Lu Qin, Rong-Hua Li, Lijun Chang, Chengqi Zhang
Locally Densest Subgraph Discovery. KDD (2015)
Longbin Lai, Lu Qin, Xuemin Lin, Lijun Chang
Scalable Subgraph Enumeration in MapReduce. Proc. VLDB Endow. 8 (10) (2015)
Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, Xuemin Lin
I/O efficient: computing SCCs in massive graphs. VLDB J. 24 (2) (2015)
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang
Diversified top-k clique search. ICDE (2015)
Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Jian Pei
Efficiently Computing Top-K Shortest Path Join. EDBT (2015)
Fei Bi, Lijun Chang, Wenjie Zhang, Xuemin Lin
Efficient String Similarity Search: A Cross Pivotal Based Approach. DASFAA (1) (2015)
Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Wenjie Zhang
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity. SIGMOD Conference (2015)
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme. IEEE Trans. Knowl. Data Eng. 26 (1) (2014)
Yuxing Han, Lijun Chang, Wenjie Zhang, Xuemin Lin, Liping Wang
Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time. ADC (2014)
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Hong Cheng, Chengqi Zhang, Xuemin Lin
Scalable big graph processing in MapReduce. SIGMOD Conference (2014)
Weiren Yu, Xuemin Lin, Wenjie Zhang, Lijun Chang, Jian Pei
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks. Proc. VLDB Endow. 7 (1) (2013)
Miao Qiao, Hong Cheng, Lu Qin, Jeffrey Xu Yu, Philip S. Yu, Lijun Chang
Computing weight constraint reachability in large networks. VLDB J. 22 (3) (2013)
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, Weifa Liang
Efficiently computing k-edge connected components via graph decomposition. SIGMOD Conference (2013)
Wenjie Zhang, Aiping Li, Muhammad Aamir Cheema, Ying Zhang, Lijun Chang
Probabilistic n-of-N Skyline Computation over Uncertain Data Streams. WISE (2) (2013)
Lijun Chang, Jeffrey Xu Yu, Lu Qin
Fast Maximal Cliques Enumeration in Sparse Graphs. Algorithmica 66 (1) (2013)
Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, Xuemin Lin
I/O efficient: computing SCCs in massive graphs. SIGMOD Conference (2013)
Lu Qin, Jeffrey Xu Yu, Lijun Chang
Diversifying Top-K Results. Proc. VLDB Endow. 5 (11) (2012)
Lu Qin, Jeffrey Xu Yu, Lijun Chang
Computing Structural Statistics by Keywords in Databases. IEEE Trans. Knowl. Data Eng. 24 (10) (2012)
Lu Qin, Jeffrey Xu Yu, Lijun Chang
Diversifying Top-K Results CoRR (2012)
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Hong Cheng, Miao Qiao
The exact distance to destination in undirected world. VLDB J. 21 (6) (2012)
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme. ICDE (2012)
Lu Qin, Jeffrey Xu Yu, Lijun Chang
Computing structural statistics by keywords in databases. ICDE (2011)
Lu Qin, Jeffrey Xu Yu, Lijun Chang
Scalable keyword search on large data streams. VLDB J. 20 (1) (2011)
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Yuanyuan Zhu, Haixun Wang
Finding information nebula over large networks. CIKM (2011)

Lijun Chang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Lijun Chang