Select Publications
Journal articles
2023, 'Balanced Clique Computation in Signed Networks: Concepts and Algorithms', IEEE Transactions on Knowledge and Data Engineering, 35, pp. 11079 - 11092, http://dx.doi.org/10.1109/TKDE.2022.3225562
,2023, 'Cohesive Subgraph Discovery Over Uncertain Bipartite Graphs', IEEE Transactions on Knowledge and Data Engineering, 35, pp. 11165 - 11179, http://dx.doi.org/10.1109/TKDE.2023.3234567
,2023, 'When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks', VLDB Journal, 32, pp. 1263 - 1287, http://dx.doi.org/10.1007/s00778-023-00789-x
,2023, '(p,q)-biclique counting and enumeration for large sparse bipartite graphs', VLDB Journal, 32, pp. 1137 - 1161, http://dx.doi.org/10.1007/s00778-023-00786-0
,2023, 'Core maintenance for hypergraph streams', World Wide Web, 26, pp. 3709 - 3733, http://dx.doi.org/10.1007/s11280-023-01196-6
,2023, 'Fully Dynamic Contraction Hierarchies with Label Restrictions on Road Networks', Data Science and Engineering, 8, pp. 263 - 278, http://dx.doi.org/10.1007/s41019-023-00227-6
,2023, 'Efficient Maximum Edge-Weighted Biclique Search on Large Bipartite Graphs', IEEE Transactions on Knowledge and Data Engineering, 35, pp. 7921 - 7934, http://dx.doi.org/10.1109/TKDE.2022.3220901
,2023, 'Finding the Maximum k-Balanced Biclique on Weighted Bipartite Graphs', IEEE Transactions on Knowledge and Data Engineering, PP, pp. 1 - 14, http://dx.doi.org/10.1109/tkde.2022.3206351
,2023, 'Task Variance Regularized Multi-Task Learning', IEEE Transactions on Knowledge and Data Engineering, 35, pp. 8615 - 8629, http://dx.doi.org/10.1109/TKDE.2022.3207049
,2023, 'Computing Significant Cliques in Large Labeled Networks', IEEE Transactions on Big Data, 9, pp. 904 - 917, http://dx.doi.org/10.1109/TBDATA.2022.3223644
,2023, 'Scaling Up k-Clique Densest Subgraph Detection', Proceedings of the ACM on Management of Data, 1, pp. 1 - 26, http://dx.doi.org/10.1145/3588923
,2023, 'Towards Generating Hop-constrained s-t Simple Path Graphs', Proceedings of the ACM on Management of Data, 1, pp. 1 - 26, http://dx.doi.org/10.1145/3588915
,2023, 'Toward maintenance of hypercores in large-scale dynamic hypergraphs', VLDB Journal, 32, pp. 647 - 664, http://dx.doi.org/10.1007/s00778-022-00763-z
,2023, 'Class-aware tiny object recognition over large-scale 3D point clouds', Neurocomputing, 529, pp. 166 - 181, http://dx.doi.org/10.1016/j.neucom.2023.01.094
,2023, 'Efficiently Cleaning Structured Event Logs: A Graph Repair Approach', ACM Transactions on Database Systems, 48, http://dx.doi.org/10.1145/3571281
,2023, 'Accelerated butterfly counting with vertex priority on bipartite graphs', VLDB Journal, 32, pp. 257 - 281, http://dx.doi.org/10.1007/s00778-022-00746-0
,2023, 'Fast subgraph query processing and subgraph matching via static and dynamic equivalences', VLDB Journal, 32, pp. 343 - 368, http://dx.doi.org/10.1007/s00778-022-00749-x
,2022, 'Maximum and top-k diversified biclique search at scale', VLDB Journal, 31, pp. 1365 - 1389, http://dx.doi.org/10.1007/s00778-021-00681-6
,2022, 'ABLE: Meta-Path Prediction in Heterogeneous Information Networks', ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 16, http://dx.doi.org/10.1145/3494558
,2022, 'Continuous monitoring of moving skyline and top-k queries', VLDB Journal, 31, pp. 459 - 482, http://dx.doi.org/10.1007/s00778-021-00702-4
,2022, 'Critical Nodes Identification in Large Networks: The Inclined and Detached Models', World Wide Web, 25, pp. 1315 - 1341, http://dx.doi.org/10.1007/s11280-022-01049-8
,2022, 'Answering reachability and K-reach queries on large graphs with label constraints', VLDB Journal, 31, pp. 101 - 127, http://dx.doi.org/10.1007/s00778-021-00695-0
,2022, 'Distance labeling: on parallelism, compression, and ordering', VLDB Journal, 31, pp. 129 - 155, http://dx.doi.org/10.1007/s00778-021-00694-1
,2021, 'Discovering fortress-like cohesive subgraphs', Knowledge and Information Systems, 63, pp. 3217 - 3250, http://dx.doi.org/10.1007/s10115-021-01624-x
,2021, 'On Directed Densest Subgraph Discovery', ACM Transactions on Database Systems, 46, http://dx.doi.org/10.1145/3483940
,2021, 'Efficient Hop-constrained s-t Simple Path Enumeration', VLDB Journal, 30, pp. 799 - 823, http://dx.doi.org/10.1007/s00778-021-00674-5
,2021, 'Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs', Information Sciences, 572, pp. 277 - 296, http://dx.doi.org/10.1016/j.ins.2021.04.027
,2021, 'Knowledge Graph Question Answering with semantic oriented fusion model', Knowledge-Based Systems, 221, http://dx.doi.org/10.1016/j.knosys.2021.106954
,2021, 'Reinforcement Learning based Collective Entity Alignment with Adaptive Features', ACM Transactions on Information Systems, 39, http://dx.doi.org/10.1145/3446428
,2021, 'Binarized graph neural network', World Wide Web, 24, pp. 825 - 848, http://dx.doi.org/10.1007/s11280-021-00878-3
,2021, 'Efficient structural node similarity computation on billion-scale graphs', VLDB Journal, 30, pp. 471 - 493, http://dx.doi.org/10.1007/s00778-021-00654-9
,2021, 'Efficient and High-Quality Seeded Graph Matching: Employing Higher-order Structural Information', ACM Transactions on Knowledge Discovery from Data, 15, http://dx.doi.org/10.1145/3442340
,2021, 'Efficient Directed Densest Subgraph Discovery', SIGMOD Record, 50, pp. 33 - 40, http://dx.doi.org/10.1145/3471485.3471494
,2021, 'EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search', VLDB Journal, 30, pp. 215 - 235, http://dx.doi.org/10.1007/s00778-020-00635-4
,2021, 'Generalizing the Pigeonhole Principle for Similarity Search in Hamming Space', IEEE Transactions on Knowledge and Data Engineering, 33, pp. 489 - 505, http://dx.doi.org/10.1109/TKDE.2019.2899597
,2021, 'Communication-efficient distributed covariance sketch, with application to distributed PCA', Journal of Machine Learning Research, 22
,2021, 'Efficient bi-triangle counting for large bipartite networks', Proceedings of the VLDB Endowment, 14, pp. 984 - 996, http://dx.doi.org/10.14778/3447689.3447702
,2021, 'Hierarchical core maintenance on large dynamic graphs', Proceedings of the VLDB Endowment, 14, pp. 757 - 770, http://dx.doi.org/10.14778/3446095.3446099
,2021, 'FAST: FPGA-based Subgraph Matching on Massive Graphs', arXiv preprint arXiv:2102.10768
,2020, 'Correction: A survey of community search over big graphs (The VLDB Journal, (2020), 29, 1, (353-392), 10.1007/s00778-019-00556-x)', VLDB Journal, 29, pp. 1219, http://dx.doi.org/10.1007/s00778-019-00592-7
,2020, 'Efficient (α , β)-core computation in bipartite graphs', VLDB Journal, 29, pp. 1075 - 1099, http://dx.doi.org/10.1007/s00778-020-00606-9
,2020, 'Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement', IEEE Transactions on Knowledge and Data Engineering, 32, pp. 1475 - 1488, http://dx.doi.org/10.1109/TKDE.2019.2909204
,2020, 'On spatial keyword covering', Knowledge and Information Systems, 62, pp. 2577 - 2612, http://dx.doi.org/10.1007/s10115-020-01446-3
,2020, 'IDAR: Fast supergraph search using DAG integration', Proceedings of the VLDB Endowment, 13, pp. 1456 - 1468, http://dx.doi.org/10.14778/3397230.3397241
,2020, 'Maximum biclique search at billion scale', Proceedings of the VLDB Endowment, 13, pp. 1359 - 1372, http://dx.doi.org/10.14778/3397230.3397234
,2020, 'Fair task assignment in spatial crowdsourcing', Proceedings of the VLDB Endowment, 13, pp. 2479 - 2492, http://dx.doi.org/10.14778/3407790.3407839
,2019, 'Efficient community discovery with user engagement and similarity', VLDB Journal, 28, pp. 987 - 1012, http://dx.doi.org/10.1007/s00778-019-00579-4
,2019, 'Cost optimization based on influence and user preference', Knowledge and Information Systems, 61, pp. 695 - 732, http://dx.doi.org/10.1007/s10115-018-1290-y
,2019, 'Eccentricities on small-world networks', VLDB Journal, 28, pp. 765 - 792, http://dx.doi.org/10.1007/s00778-019-00566-9
,2019, 'Selectivity Estimation on Set Containment Search', Data Science and Engineering, 4, pp. 254 - 268, http://dx.doi.org/10.1007/s41019-019-00104-1
,