GAC-decomposition based soft decoding of block codes for multimedia data. - Dongfeng Yuan; Chun-Yan Gao; Lijun Chang (PIMRC, 2003)

Context-sensitive document ranking. - Lijun Chang; Jeffrey Xu Yu; Lu Qin 001 (CIKM, 2009)

Query ranking in probabilistic XML data. - Lijun Chang; Jeffrey Xu Yu; Lu Qin 001 (EDBT, 2009)

Querying Communities in Relational Databases. - Lu Qin 001; Jeffrey Xu Yu; Lijun Chang; Yufei Tao 001 (ICDE, 2009)

Scalable Keyword Search on Large Data Streams. - Lu Qin 001; Jeffrey Xu Yu; Lijun Chang; Yufei Tao 001 (ICDE, 2009)

Keyword search in databases: the power of RDBMS. - Lu Qin 001; Jeffrey Xu Yu; Lijun Chang (SIGMOD Conference, 2009)

Fast Probabilistic Ranking under x-Relation Model - Lijun Chang; Jeffrey Xu Yu; Lu Qin 001 (CoRR, 2009)

Keyword Search in Databases - Jeffrey Xu Yu; Lu Qin 001; Lijun Chang (Morgan & Claypool Publishers, 2009)

Probabilistic ranking over relations. - Lijun Chang; Jeffrey Xu Yu; Lu Qin 001; Xuemin Lin 001 (EDBT, 2010)

Keyword Search in Relational Databases: A Survey. - Jeffrey Xu Yu; Lu Qin 001; Lijun Chang (IEEE Data Eng. Bull., 2010)

Ten Thousand SQLs: Parallel Keyword Queries Computing. - Lu Qin 001; Jeffrey Xu Yu; Lijun Chang (Proc. VLDB Endow., 2010)

Finding information nebula over large networks. - Lijun Chang; Jeffrey Xu Yu; Lu Qin 001; Yuanyuan Zhu 001; Haixun Wang (CIKM, 2011)

Computing structural statistics by keywords in databases. - Lu Qin 001; Jeffrey Xu Yu; Lijun Chang (ICDE, 2011)

Scalable keyword search on large data streams. - Lu Qin 001; Jeffrey Xu Yu; Lijun Chang (VLDB J., 2011)

Uncertain data management. - Lijun Chang (2011)

Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme. - Miao Qiao; Hong Cheng 001; Lijun Chang; Jeffrey Xu Yu (ICDE, 2012)

Diversifying Top-K Results. - Lu Qin 001; Jeffrey Xu Yu; Lijun Chang (Proc. VLDB Endow., 2012)

The exact distance to destination in undirected world. - Lijun Chang; Jeffrey Xu Yu; Lu Qin 001; Hong Cheng 001; Miao Qiao (VLDB J., 2012)

Efficiently computing k-edge connected components via graph decomposition. - Lijun Chang; Jeffrey Xu Yu; Lu Qin 001; Xuemin Lin 001; Chengfei Liu; Weifa Liang (SIGMOD Conference, 2013)

I/O efficient: computing SCCs in massive graphs. - Zhiwei Zhang 002; Jeffrey Xu Yu; Lu Qin 001; Lijun Chang; Xuemin Lin 001 (SIGMOD Conference, 2013)

Probabilistic n-of-N Skyline Computation over Uncertain Data Streams. - Wenjie Zhang 001; Aiping Li; Muhammad Aamir Cheema; Ying Zhang 001; Lijun Chang (WISE (2), 2013)

Fast Maximal Cliques Enumeration in Sparse Graphs. - Lijun Chang; Jeffrey Xu Yu; Lu Qin 001 (Algorithmica, 2013)

More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks. - Weiren Yu; Xuemin Lin 001; Wenjie Zhang 001; Lijun Chang; Jian Pei 001 (Proc. VLDB Endow., 2013)

Computing weight constraint reachability in large networks. - Miao Qiao; Hong Cheng 001; Lu Qin 001; Jeffrey Xu Yu; Philip S. Yu; Lijun Chang (VLDB J., 2013)

Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time. - Yuxing Han 002; Lijun Chang; Wenjie Zhang 001; Xuemin Lin 001; Liping Wang 012 (ADC, 2014)

Scalable big graph processing in MapReduce. - Lu Qin 001; Jeffrey Xu Yu; Lijun Chang; Hong Cheng 001; Chengqi Zhang; Xuemin Lin 001 (SIGMOD Conference, 2014)

Efficient String Similarity Search: A Cross Pivotal Based Approach. - Fei Bi; Lijun Chang; Wenjie Zhang 001; Xuemin Lin 001 (DASFAA (1), 2015)

Efficiently Computing Top-K Shortest Path Join. - Lijun Chang; Xuemin Lin 001; Lu Qin 001; Jeffrey Xu Yu; Jian Pei 001 (EDBT, 2015)

Diversified top-k clique search. - Long Yuan 001; Lu Qin 001; Xuemin Lin 001; Lijun Chang; Wenjie Zhang 001 (ICDE, 2015)

Locally Densest Subgraph Discovery. - Lu Qin 001; Rong-Hua Li; Lijun Chang; Chengqi Zhang (KDD, 2015)

Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity. - Lijun Chang; Xuemin Lin 001; Lu Qin 001; Jeffrey Xu Yu; Wenjie Zhang 001 (SIGMOD Conference, 2015)

Optimal Enumeration: Efficient Top-k Tree Matching. - Lijun Chang; Xuemin Lin 001; Wenjie Zhang 001; Jeffrey Xu Yu; Ying Zhang 001; Lu Qin 001 (Proc. VLDB Endow., 2015)

Scalable Subgraph Enumeration in MapReduce. - Longbin Lai; Lu Qin 001; Xuemin Lin 001; Lijun Chang (Proc. VLDB Endow., 2015)

pSCAN: Fast and exact structural graph clustering. - Lijun Chang; Wei Li 109; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001 (ICDE, 2016)

Computing Connected Components with linear communication cost in pregel-like systems. - Xing Feng; Lijun Chang; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001 (ICDE, 2016)

Scalable supergraph search in large graph databases. - Bingqing Lyu; Lu Qin 001; Xuemin Lin 001; Lijun Chang; Jeffrey Xu Yu (ICDE, 2016)

Efficient Subgraph Matching by Postponing Cartesian Products. - Fei Bi; Lijun Chang; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001 (SIGMOD Conference, 2016)

Scalable Distributed Subgraph Enumeration. - Longbin Lai; Lu Qin 001; Xuemin Lin 001; Ying Zhang 001; Lijun Chang (Proc. VLDB Endow., 2016)

I/O Efficient ECC Graph Decomposition via Graph Reduction. - Long Yuan 001; Lu Qin 001; Xuemin Lin 001; Lijun Chang; Wenjie Zhang 001 (Proc. VLDB Endow., 2016)

Scalable Top-K Structural Diversity Search. - Lijun Chang; Chen Zhang 013; Xuemin Lin 001; Lu Qin 001 (ICDE, 2017)

Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling. - Lijun Chang; Wei Li 109; Wenjie Zhang 001 (SIGMOD Conference, 2017)

Enumerating k-Vertex Connected Components in Large Graphs. - Dong Wen 001; Lu Qin 001; Xuemin Lin 001; Ying Zhang 001; Lijun Chang (CoRR, 2017)

Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation. - Lijun Chang; Xing Feng; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001 (CoRR, 2017)

An Optimal and Progressive Approach to Online Search of Top-k Important Communities. - Fei Bi; Lijun Chang; Xuemin Lin 001; Wenjie Zhang 001 (CoRR, 2017)

A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition. - Lijun Chang (CoRR, 2017)

Leveraging Set Relations in Exact Set Similarity Join. - Xubo Wang; Lu Qin 001; Xuemin Lin 001; Ying Zhang 001; Lijun Chang (Proc. VLDB Endow., 2017)

Efficient Structural Graph Clustering: An Index-Based Approach. - Dong Wen 001; Lu Qin 001; Ying Zhang 001; Lijun Chang; Xuemin Lin 001 (Proc. VLDB Endow., 2017)

Effective and Efficient Dynamic Graph Coloring. - Long Yuan 001; Lu Qin 001; Xuemin Lin 001; Lijun Chang; Wenjie Zhang 001 (Proc. VLDB Endow., 2017)

pSCAN: Fast and Exact Structural Graph Clustering. - Lijun Chang; Wei Li 109; Lu Qin 001; Wenjie Zhang 001; Shiyu Yang (IEEE Trans. Knowl. Data Eng., 2017)

Scalable subgraph enumeration in MapReduce: a cost-oriented approach. - Longbin Lai; Lu Qin 001; Xuemin Lin 001; Lijun Chang (VLDB J., 2017)

Ranking weighted clustering coefficient in large dynamic graphs. - Xuefei Li; Lijun Chang; Kai Zheng 001; Zi Huang; Xiaofang Zhou 001 (World Wide Web, 2017)

Exacting Eccentricity for Small-World Networks. - Wentao Li 001; Miao Qiao; Lu Qin 001; Ying Zhang 001; Lijun Chang; Xuemin Lin 001 (ICDE, 2018)

Querying Cohesive Subgraphs by Keywords. - Yuanyuan Zhu 001; Qian Zhang; Lu Qin 001; Lijun Chang; Jeffrey Xu Yu (ICDE, 2018)

When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. - Dian Ouyang; Lu Qin 001; Lijun Chang; Xuemin Lin 001; Ying Zhang 001; Qing Zhu (SIGMOD Conference, 2018)

Distributed computing connected components with linear communication cost. - Xing Feng; Lijun Chang; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001; Long Yuan 001 (Distributed Parallel Databases, 2018)

An Optimal and Progressive Approach to Online Search of Top-K Influential Communities. - Fei Bi; Lijun Chang; Xuemin Lin 001; Wenjie Zhang 001 (Proc. VLDB Endow., 2018)

Automatic Index Selection for Large-Scale Datalog Computation. - Pavle Subotic; Herbert Jordan; Lijun Chang; Alan D. Fekete; Bernhard Scholz (Proc. VLDB Endow., 2018)

Index-Based Densest Clique Percolation Community Search in Networks. - Long Yuan 001; Lu Qin 001; Wenjie Zhang 001; Lijun Chang; Jianye Yang 001 (IEEE Trans. Knowl. Data Eng., 2018)

Cohesive Subgraph Computation Over Large Sparse Graphs. - Lijun Chang; Lu Qin 001 (ICDE, 2019)

Enumerating k-Vertex Connected Components in Large Graphs. - Dong Wen 001; Lu Qin 001; Ying Zhang 001; Lijun Chang; Ling Chen 006 (ICDE, 2019)

Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs. - Bohua Yang; Dong Wen 001; Lu Qin 001; Ying Zhang 001; Lijun Chang; Rong-Hua Li (ICDE, 2019)

Index-Based Densest Clique Percolation Community Search in Networks (Extended Abstract). - Long Yuan 001; Lu Qin 001; Wenjie Zhang 001; Lijun Chang; Jianye Yang 001 (ICDE, 2019)

Efficient Maximum Clique Computation over Large Sparse Graphs. - Lijun Chang (KDD, 2019)

Scaling Distance Labeling on Small-World Networks. - Wentao Li 001; Miao Qiao; Lu Qin 001; Ying Zhang 001; Lijun Chang; Xuemin Lin 001 (SIGMOD Conference, 2019)

Computing Maximum Independent Sets over Large Sparse Graphs. - Maram Alsahafy; Lijun Chang (WISE, 2019)

Supergraph Search in Graph Databases via Hierarchical Feature-Tree. - Bingqing Lyu; Lu Qin 001; Xuemin Lin 001; Lijun Chang; Jeffrey Xu Yu (IEEE Trans. Knowl. Data Eng., 2019)

Eccentricities on small-world networks. - Wentao Li 001; Miao Qiao; Lu Qin 001; Ying Zhang 001; Lijun Chang; Xuemin Lin 001 (VLDB J., 2019)

Leveraging set relations in exact and dynamic set similarity join. - Xubo Wang; Lu Qin 001; Xuemin Lin 001; Ying Zhang 001; Lijun Chang (VLDB J., 2019)

Efficient Closest Community Search over Large Graphs. - Mingshen Cai; Lijun Chang (DASFAA (2), 2020)

Speeding Up GED Verification for Graph Similarity Search. - Lijun Chang; Xing Feng; Xuemin Lin 001; Lu Qin 001; Wenjie Zhang 001; Dian Ouyang (ICDE, 2020)

Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. - Wentao Li 001; Miao Qiao; Lu Qin 001; Ying Zhang 001; Lijun Chang; Xuemin Lin 001 (SIGMOD Conference, 2020)

Progressive Top-K Nearest Neighbors Search in Large Road Networks. - Dian Ouyang; Dong Wen 001; Lu Qin 001; Lijun Chang; Ying Zhang 001; Xuemin Lin 001 (SIGMOD Conference, 2020)

Fast Algorithm for Distance Dynamics-Based Community Detection. - Maram Alsahafy; Lijun Chang (WISE (1), 2020)

Deconstruct Densest Subgraphs. - Lijun Chang; Miao Qiao (WWW, 2020)

Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System. - Xubo Wang; Lu Qin 001; Lijun Chang; Ying Zhang 001; Dong Wen 001; Xuemin Lin 001 (CoRR, 2020)

Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees. - Dian Ouyang; Long Yuan 001; Lu Qin 001; Lijun Chang; Ying Zhang 001; Xuemin Lin 001 (Proc. VLDB Endow., 2020)

Efficient maximum clique computation and enumeration over large sparse graphs. - Lijun Chang (VLDB J., 2020)

Efficient Size-Bounded Community Search over Large Networks. - Kai Yao; Lijun Chang (Proc. VLDB Endow., 2021)

Application of Fuzzy Comprehensive Evaluation Based on Genetic Algorithm in Psychological Measurement. - Lijun Chang (Sci. Program., 2021)

ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing (Extended Abstract). - Xubo Wang; Dong Wen 001; Lu Qin 001; Lijun Chang; Wenjie Zhang 001 (ICDE, 2022)

Computing Maximum Structural Balanced Cliques in Signed Graphs. - Kai Yao; Lijun Chang; Lu Qin 001 (ICDE, 2022)

On Scalable Computation of Graph Eccentricities. - Wentao Li 001; Miao Qiao; Lu Qin 001; Lijun Chang; Ying Zhang 001; Xuemin Lin 001 (SIGMOD Conference, 2022)

Anchored Densest Subgraph. - Yizhou Dai; Miao Qiao; Lijun Chang (SIGMOD Conference, 2022)

A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition. - Lijun Chang; Zhiyi Wang (Proc. VLDB Endow., 2022)

Efficient Maximum k-Plex Computation over Large Sparse Graphs. - Lijun Chang; Mouyi Xu; Darren Strash (Proc. VLDB Endow., 2022)

Identifying Similar-Bicliques in Bipartite Graphs. - Kai Yao; Lijun Chang; Jeffrey Xu Yu (Proc. VLDB Endow., 2022)

Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement. - Junhua Zhang; Wentao Li 001; Long Yuan 001; Lu Qin 001; Ying Zhang 001; Lijun Chang (Proc. VLDB Endow., 2022)

Efficient Sink-Reachability Analysis via Graph Reduction. - Jens Dietrich 001; Lijun Chang; Long Qian; Lyndon M. Henry; Catherine McCartin; Bernhard Scholz (IEEE Trans. Knowl. Data Eng., 2022)

Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach. - Dong Wen 001; Bohua Yang; Lu Qin 001; Ying Zhang 001; Lijun Chang; Rong-Hua Li (IEEE Trans. Knowl. Data Eng., 2022)

Cohesive Subgraph Search Using Keywords in Large Networks. - Yuanyuan Zhu 001; Qian Zhang; Lu Qin 001; Lijun Chang; Jeffrey Xu Yu (IEEE Trans. Knowl. Data Eng., 2022)

Distance labeling: on parallelism, compression, and ordering. - Wentao Li 001; Miao Qiao; Lu Qin 001; Ying Zhang 001; Lijun Chang; Xuemin Lin 001 (VLDB J., 2022)

On Directed Densest Subgraph Detection. - Kai Yao; Xin Yang; Lijun Chang (ADC, 2023)

Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract). - Jens Dietrich 001; Lijun Chang; Long Qian; Lyndon M. Henry; Catherine McCartin; Bernhard Scholz (ICDE, 2023)

Verification-Free Approaches to Efficient Locally Densest Subgraph Discovery. - Tran Ba Trung; Lijun Chang; Nguyen Tien Long; Kai Yao; Huynh Thi Thanh Binh (ICDE, 2023)

ScaleG: A Distributed Disk-Based System for Vertex-Centric Graph Processing. - Xubo Wang; Dong Wen 001; Lu Qin 001; Lijun Chang; Ying Zhang 001; Wenjie Zhang 001 (IEEE Trans. Knowl. Data Eng., 2023)

Accelerating Graph Similarity Search via Efficient GED Computation. - Lijun Chang; Xing Feng; Kai Yao; Lu Qin 001; Wenjie Zhang 001 (IEEE Trans. Knowl. Data Eng., 2023)

Efficient Maximum k-Defective Clique Computation with Improved Time Complexity. - Lijun Chang (Proc. ACM Manag. Data, 2023)

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. - Dian Ouyang; Dong Wen 001; Lu Qin 001; Lijun Chang; Xuemin Lin 001; Ying Zhang 001 (VLDB J., 2023)

Maximum k-Plex Computation: Theory and Practice. - Lijun Chang; Kai Yao (Proc. ACM Manag. Data, 2024)

Identifying Large Structural Balanced Cliques in Signed Graphs. - Kai Yao; Lijun Chang; Lu Qin 001 (IEEE Trans. Knowl. Data Eng., 2024)

Efficient k-Clique Count Estimation with Accuracy Guarantee. - Lijun Chang; Rashmika Gamage; Jeffrey Xu Yu (Proc. VLDB Endow., 2024)

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance. - Lijun Chang (Proc. VLDB Endow., 2024)

Identifying Maximum Defective Bicliques in Large Bipartite Graphs. - Zhiyi Wang; Lijun Chang; Jeffrey Xu Yu (ICDE, 2025)

A Local Search Approach to Efficient (k,p)-Core Maintenance. - Chenghan Zhang; Yuanyuan Zhu 001; Lijun Chang (Proc. ACM Manag. Data, 2025)

Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods. - Mouyi Xu; Lijun Chang (Proc. ACM Manag. Data, 2025)

Probabilistic Truss Decomposition on Uncertain Graphs: Indexing and Dynamic Maintenance. - Zitan Sun; Xin Huang 001; Jianliang Xu; Francesco Bonchi; Lijun Chang (ACM Trans. Database Syst., 2025)