default search action
Lijun Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j54]Lijun Chang
, Kai Yao
Maximum k-Plex Computation: Theory and Practice. Proc. ACM Manag. Data 2(1): 63:1-63:26 (2024) - [j53]Lijun Chang, Rashmika Gamage, Jeffrey Xu Yu:
Efficient k-Clique Count Estimation with Accuracy Guarantee. Proc. VLDB Endow. 17(11): 3707-3719 (2024) - [j52]Kai Yao
Identifying Large Structural Balanced Cliques in Signed Graphs. IEEE Trans. Knowl. Data Eng. 36(3): 1145-1160 (2024) - [j51]Lijun Chang, Zhiyi Wang:
A near-optimal approach to edge connectivity-based hierarchical graph decomposition. VLDB J. 33(1): 49-71 (2024) - [j50]Kai Yao
Identifying similar-bicliques in bipartite graphs. VLDB J. 33(3): 703-726 (2024) - [i9]Lijun Chang:
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance. CoRR abs/2403.07561 (2024) - 2023
- [j49]Lijun Chang
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity. Proc. ACM Manag. Data 1(3): 209:1-209:26 (2023) - [j48]Xubo Wang
ScaleG: A Distributed Disk-Based System for Vertex-Centric Graph Processing. IEEE Trans. Knowl. Data Eng. 35(2): 2019-2033 (2023) - [j47]Lijun Chang
Accelerating Graph Similarity Search via Efficient GED Computation. IEEE Trans. Knowl. Data Eng. 35(5): 4485-4498 (2023) - [j46]Dian Ouyang, Dong Wen
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. VLDB J. 32(6): 1263-1287 (2023) - [c49]Kai Yao, Xin Yang, Lijun Chang:
On Directed Densest Subgraph Detection. ADC 2023: 371-384 - [c48]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: 1-13 - [c47]Jens Dietrich
Efficient Sink-Reachability Analysis via Graph Reduction (Extended Abstract). ICDE 2023: 3897-3898 - [i8]Lijun Chang:
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity. CoRR abs/2309.02635 (2023) - 2022
- [j45]Lijun Chang, Zhiyi Wang:
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition. Proc. VLDB Endow. 15(6): 1146-1158 (2022) - [j44]Junhua Zhang, Wentao Li, Long Yuan
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement. Proc. VLDB Endow. 15(11): 2640-2652 (2022) - [j43]Kai Yao
Identifying Similar-Bicliques in Bipartite Graphs. Proc. VLDB Endow. 15(11): 3085-3097 (2022) - [j42]Lijun Chang, Mouyi Xu, Darren Strash:
Efficient Maximum k-Plex Computation over Large Sparse Graphs. Proc. VLDB Endow. 16(2): 127-139 (2022) - [j41]Yuanyuan Zhu
Cohesive Subgraph Search Using Keywords in Large Networks. IEEE Trans. Knowl. Data Eng. 34(1): 178-191 (2022) - [j40]Dong Wen
Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach. IEEE Trans. Knowl. Data Eng. 34(7): 3126-3138 (2022) - [j39]Jens Dietrich
Efficient Sink-Reachability Analysis via Graph Reduction. IEEE Trans. Knowl. Data Eng. 34(11): 5321-5335 (2022) - [j38]Wentao Li
Distance labeling: on parallelism, compression, and ordering. VLDB J. 31(1): 129-155 (2022) - [c46]Kai Yao
Computing Maximum Structural Balanced Cliques in Signed Graphs. ICDE 2022: 1004-1016 - [c45]Xubo Wang, Dong Wen, Lu Qin
ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing (Extended Abstract). ICDE 2022: 1511-1512 - [c44]Wentao Li
On Scalable Computation of Graph Eccentricities. SIGMOD Conference 2022: 904-916 - [c43]Yizhou Dai
Anchored Densest Subgraph. SIGMOD Conference 2022: 1200-1213 - 2021
- [j37]Kai Yao
Efficient Size-Bounded Community Search over Large Networks. Proc. VLDB Endow. 14(8): 1441-1453 (2021) - [j36]Lijun Chang:
Application of Fuzzy Comprehensive Evaluation Based on Genetic Algorithm in Psychological Measurement. Sci. Program. 2021: 9607006:1-9607006:11 (2021) - 2020
- [j35]Dian Ouyang, Long Yuan
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees. Proc. VLDB Endow. 13(5): 602-615 (2020) - [j34]Lijun Chang
Efficient maximum clique computation and enumeration over large sparse graphs. VLDB J. 29(5): 999-1022 (2020) - [c42]Mingshen Cai, Lijun Chang:
Efficient Closest Community Search over Large Graphs. DASFAA (2) 2020: 569-587 - [c41]Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin
Speeding Up GED Verification for Graph Similarity Search. ICDE 2020: 793-804 - [c40]Wentao Li
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. SIGMOD Conference 2020: 1367-1381 - [c39]Dian Ouyang, Dong Wen
Progressive Top-K Nearest Neighbors Search in Large Road Networks. SIGMOD Conference 2020: 1781-1795 - [c38]Maram Alsahafy, Lijun Chang:
Fast Algorithm for Distance Dynamics-Based Community Detection. WISE (1) 2020: 213-226 - [c37]Lijun Chang, Miao Qiao
Deconstruct Densest Subgraphs. WWW 2020: 2747-2753 - [i7]Xubo Wang, Lu Qin, Lijun Chang, Ying Zhang, Dong Wen, Xuemin Lin:
Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System. CoRR abs/2003.00680 (2020)
2010 – 2019
- 2019
- [j33]Bingqing Lyu
Supergraph Search in Graph Databases via Hierarchical Feature-Tree. IEEE Trans. Knowl. Data Eng. 31(2): 385-400 (2019) - [j32]Xubo Wang, Lu Qin
Leveraging set relations in exact and dynamic set similarity join. VLDB J. 28(2): 267-292 (2019) - [j31]Dong Wen
Efficient structural graph clustering: an index-based approach. VLDB J. 28(3): 377-399 (2019) - [j30]Wentao Li
Eccentricities on small-world networks. VLDB J. 28(5): 765-792 (2019) - [c36]Dong Wen
Enumerating k-Vertex Connected Components in Large Graphs. ICDE 2019: 52-63 - [c35]Bohua Yang
Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs. ICDE 2019: 64-75 - [c34]Lijun Chang, Lu Qin
Cohesive Subgraph Computation Over Large Sparse Graphs. ICDE 2019: 2068-2071 - [c33]Long Yuan
Index-Based Densest Clique Percolation Community Search in Networks (Extended Abstract). ICDE 2019: 2161-2162 - [c32]Lijun Chang:
Efficient Maximum Clique Computation over Large Sparse Graphs. KDD 2019: 529-538 - [c31]Wentao Li
Scaling Distance Labeling on Small-World Networks. SIGMOD Conference 2019: 1060-1077 - [c30]Maram Alsahafy, Lijun Chang:
Computing Maximum Independent Sets over Large Sparse Graphs. WISE 2019: 711-727 - [e6]Lijun Chang, Junhao Gan, Xin Cao:
Databases Theory and Applications, 30th Australasian Database Conference, ADC 2019, Sydney, NSW, Australia, January 29 - February 1, 2019, Proceedings. Lecture Notes in Computer Science 11393, Springer 2019, ISBN 978-3-030-12078-8 [contents] - 2018
- [j29]Xing Feng, Lijun Chang, Xuemin Lin
Distributed computing connected components with linear communication cost. Distributed Parallel Databases 36(3): 555-592 (2018) - [j28]Fei Bi, Lijun Chang, Xuemin Lin
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities. Proc. VLDB Endow. 11(9): 1056-1068 (2018) - [j27]Pavle Subotic, Herbert Jordan, Lijun Chang, Alan D. Fekete, Bernhard Scholz:
Automatic Index Selection for Large-Scale Datalog Computation. Proc. VLDB Endow. 12(2): 141-153 (2018) - [j26]Long Yuan
Index-Based Densest Clique Percolation Community Search in Networks. IEEE Trans. Knowl. Data Eng. 30(5): 922-935 (2018) - [c29]Wentao Li
Exacting Eccentricity for Small-World Networks. ICDE 2018: 785-796 - [c28]Yuanyuan Zhu, Qian Zhang, Lu Qin
Querying Cohesive Subgraphs by Keywords. ICDE 2018: 1324-1327 - [c27]Dian Ouyang, Lu Qin
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. SIGMOD Conference 2018: 709-724 - 2017
- [j25]Xubo Wang, Lu Qin
Leveraging Set Relations in Exact Set Similarity Join. Proc. VLDB Endow. 10(9): 925-936 (2017) - [j24]Dong Wen
Efficient Structural Graph Clustering: An Index-Based Approach. Proc. VLDB Endow. 11(3): 243-255 (2017) - [j23]Long Yuan
Effective and Efficient Dynamic Graph Coloring. Proc. VLDB Endow. 11(3): 338-351 (2017) - [j22]Lijun Chang, Wei Li, Lu Qin
pSCAN: Fast and Exact Structural Graph Clustering. IEEE Trans. Knowl. Data Eng. 29(2): 387-401 (2017) - [j21]Long Yuan
I/O efficient ECC graph decomposition via graph reduction. VLDB J. 26(2): 275-300 (2017) - [j20]Longbin Lai
Scalable subgraph enumeration in MapReduce: a cost-oriented approach. VLDB J. 26(3): 421-446 (2017) - [j19]Xuefei Li
Ranking weighted clustering coefficient in large dynamic graphs. World Wide Web 20(5): 855-883 (2017) - [c26]Lijun Chang, Chen Zhang, Xuemin Lin
Scalable Top-K Structural Diversity Search. ICDE 2017: 95-98 - [c25]Lijun Chang, Wei Li, Wenjie Zhang
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling. SIGMOD Conference 2017: 1181-1196 - [e5]K. Selçuk Candan, Lei Chen, Torben Bach Pedersen, Lijun Chang, Wen Hua:
Database Systems for Advanced Applications - 22nd International Conference, DASFAA 2017, Suzhou, China, March 27-30, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10177, Springer 2017, ISBN 978-3-319-55752-6 [contents] - [e4]K. Selçuk Candan, Lei Chen, Torben Bach Pedersen, Lijun Chang, Wen Hua:
Database Systems for Advanced Applications - 22nd International Conference, DASFAA 2017, Suzhou, China, March 27-30, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10178, Springer 2017, ISBN 978-3-319-55698-7 [contents] - [e3]Zhifeng Bao, Goce Trajcevski, Lijun Chang, Wen Hua:
Database Systems for Advanced Applications - DASFAA 2017 International Workshops: BDMS, BDQM, SeCoP, and DMMOOC, Suzhou, China, March 27-30, 2017, Proceedings. Lecture Notes in Computer Science 10179, Springer 2017, ISBN 978-3-319-55704-5 [contents] - [i6]Dong Wen, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Enumerating k-Vertex Connected Components in Large Graphs. CoRR abs/1703.08668 (2017) - [i5]Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang:
Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation. CoRR abs/1709.06810 (2017) - [i4]Fei Bi, Lijun Chang, Xuemin Lin, Wenjie Zhang:
An Optimal and Progressive Approach to Online Search of Top-k Important Communities. CoRR abs/1711.05857 (2017) - [i3]Lijun Chang:
A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition. CoRR abs/1711.09189 (2017) - 2016
- [j18]Long Yuan
I/O Efficient ECC Graph Decomposition via Graph Reduction. Proc. VLDB Endow. 9(7): 516-527 (2016) - [j17]Longbin Lai
Scalable Distributed Subgraph Enumeration. Proc. VLDB Endow. 10(3): 217-228 (2016) - [j16]Long Yuan
Diversified top-k clique search. VLDB J. 25(2): 171-196 (2016) - [c24]Xing Feng, Lijun Chang, Xuemin Lin
Computing Connected Components with linear communication cost in pregel-like systems. ICDE 2016: 85-96 - [c23]Bingqing Lyu, Lu Qin
Scalable supergraph search in large graph databases. ICDE 2016: 157-168 - [c22]Lijun Chang, Wei Li, Xuemin Lin
pSCAN: Fast and exact structural graph clustering. ICDE 2016: 253-264 - [c21]Fei Bi, Lijun Chang, Xuemin Lin
Efficient Subgraph Matching by Postponing Cartesian Products. SIGMOD Conference 2016: 1199-1214 - [e2]Muhammad Aamir Cheema, Wenjie Zhang
Databases Theory and Applications - 27th Australasian Database Conference, ADC 2016, Sydney, NSW, Australia, September 28-29, 2016, Proceedings. Lecture Notes in Computer Science 9877, Springer 2016, ISBN 978-3-319-46921-8 [contents] - [e1]Atsuyuki Morishima, Lijun Chang, Tom Z. J. Fu, Kuien Liu, Xiaoyan Yang, Jia Zhu, Rong Zhang, Wenjie Zhang
Web Technologies and Applications - APWeb 2016 Workshops, WDMA, GAP, and SDMA, Suzhou, China, September 23-25, 2016, Proceedings. Lecture Notes in Computer Science 9865, 2016, ISBN 978-3-319-45834-2 [contents] - 2015
- [j15]Lijun Chang, Xuemin Lin
Optimal Enumeration: Efficient Top-k Tree Matching. Proc. VLDB Endow. 8(5): 533-544 (2015) - [j14]Longbin Lai
Scalable Subgraph Enumeration in MapReduce. Proc. VLDB Endow. 8(10): 974-985 (2015) - [j13]Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin
I/O efficient: computing SCCs in massive graphs. VLDB J. 24(2): 245-270 (2015) - [j12]Wenjie Zhang
Probabilistic n-of-N skyline computation over uncertain data streams. World Wide Web 18(5): 1331-1350 (2015) - [c20]Fei Bi, Lijun Chang, Wenjie Zhang
Efficient String Similarity Search: A Cross Pivotal Based Approach. DASFAA (1) 2015: 545-564 - [c19]Lijun Chang, Xuemin Lin
Efficiently Computing Top-K Shortest Path Join. EDBT 2015: 133-144 - [c18]Long Yuan
Diversified top-k clique search. ICDE 2015: 387-398 - [c17]Lu Qin
Locally Densest Subgraph Discovery. KDD 2015: 965-974 - [c16]Lijun Chang, Xuemin Lin
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity. SIGMOD Conference 2015: 459-474 - 2014
- [j11]Miao Qiao
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme. IEEE Trans. Knowl. Data Eng. 26(1): 55-68 (2014) - [c15]Yuxing Han
Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time. ADC 2014: 122-134 - [c14]Lu Qin
Scalable big graph processing in MapReduce. SIGMOD Conference 2014: 827-838 - 2013
- [j10]Lijun Chang, Jeffrey Xu Yu, Lu Qin
Fast Maximal Cliques Enumeration in Sparse Graphs. Algorithmica 66(1): 173-186 (2013) - [j9]Weiren Yu, Xuemin Lin
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks. Proc. VLDB Endow. 7(1): 13-24 (2013) - [j8]Miao Qiao
Computing weight constraint reachability in large networks. VLDB J. 22(3): 275-294 (2013) - [c13]Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin
I/O efficient: computing SCCs in massive graphs. SIGMOD Conference 2013: 181-192 - [c12]Lijun Chang, Jeffrey Xu Yu, Lu Qin
Efficiently computing k-edge connected components via graph decomposition. SIGMOD Conference 2013: 205-216 - [c11]Wenjie Zhang
Probabilistic n-of-N Skyline Computation over Uncertain Data Streams. WISE (2) 2013: 439-457 - 2012
- [j7]Lu Qin
Diversifying Top-K Results. Proc. VLDB Endow. 5(11): 1124-1135 (2012) - [j6]Lu Qin
Computing Structural Statistics by Keywords in Databases. IEEE Trans. Knowl. Data Eng. 24(10): 1731-1746 (2012) - [j5]Lijun Chang, Jeffrey Xu Yu, Lu Qin
The exact distance to destination in undirected world. VLDB J. 21(6): 869-888 (2012) - [c10]Miao Qiao
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme. ICDE 2012: 462-473 - [i2]Lu Qin, Jeffrey Xu Yu, Lijun Chang:
Diversifying Top-K Results. CoRR abs/1208.0076 (2012) - 2011
- [b2]Lijun Chang:
Uncertain data management. Chinese University of Hong Kong, Hong Kong, 2011 - [j4]Lu Qin
Scalable keyword search on large data streams. VLDB J. 20(1): 35-57 (2011) - [c9]Lijun Chang, Jeffrey Xu Yu, Lu Qin
Finding information nebula over large networks. CIKM 2011: 1465-1474 - [c8]Lu Qin
Computing structural statistics by keywords in databases. ICDE 2011: 363-374 - 2010
- [j3]Jeffrey Xu Yu, Lu Qin, Lijun Chang:
Keyword Search in Relational Databases: A Survey. IEEE Data Eng. Bull. 33(1): 67-78 (2010) - [j2]Lijun Chang, Jeffrey Xu Yu, Lu Qin
Context-Sensitive Document Ranking. J. Comput. Sci. Technol. 25(3): 444-457 (2010) - [j1]Lu Qin
Ten Thousand SQLs: Parallel Keyword Queries Computing. Proc. VLDB Endow. 3(1): 58-69 (2010) - [c7]Lijun Chang, Jeffrey Xu Yu, Lu Qin
Probabilistic ranking over relations. EDBT 2010: 477-488
2000 – 2009
- 2009
- [b1]Jeffrey Xu Yu, Lu Qin
Keyword Search in Databases. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2009, ISBN 978-3-031-79425-4 - [c6]Lijun Chang, Jeffrey Xu Yu, Lu Qin
Context-sensitive document ranking. CIKM 2009: 1533-1536 - [c5]Lijun Chang, Jeffrey Xu Yu, Lu Qin
Query ranking in probabilistic XML data. EDBT 2009: 156-167 - [c4]Lu Qin
Querying Communities in Relational Databases. ICDE 2009: 724-735 - [c3]Lu Qin
Scalable Keyword Search on Large Data Streams. ICDE 2009: 1199-1202 - [c2]Lu Qin
Keyword search in databases: the power of RDBMS. SIGMOD Conference 2009: 681-694 - [i1]Lijun Chang, Jeffrey Xu Yu, Lu Qin:
Fast Probabilistic Ranking under x-Relation Model. CoRR abs/0906.4927 (2009) - 2003
- [c1]Dongfeng Yuan, Chun-Yan Gao, Lijun Chang:
GAC-decomposition based soft decoding of block codes for multimedia data. PIMRC 2003: 727-729
Coauthor Index
[j52] [j48] [j47] [j46] [j44] [j41] [j40] [j38] [c46] [c45] [c44] [j35] [c41] [c40] [c39] [i7] [j33] [j32] [j31] [j30] [c36] [c35] [c34] [c33] [c31] [j29] [j26] [c29] [c28] [c27] [j25] [j24] [j23] [j22] [j21] [j20] [c26] [i6] [i5] [j18] [j17] [j16] [c24] [c23] [c22] [c21] [j15] [j14] [j13] [c19] [c18] [c17] [c16] [c14] [j10] [j8] [c13] [c12] [j7] [j6] [j5] [i2] [j4] [c9] [c8] [j3] [j2] [j1] [c7] [b1] [c6] [c5] [c4] [c3] [c2] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 01:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: