| Efficient Shortest Path Counting on Large Road Networks. | 0 | 0.34 | 2022 |
| Efficient Top-k Ego-Betweenness Search | 0 | 0.34 | 2022 |
| Filtration-Enhanced Graph Transformation | 0 | 0.34 | 2022 |
| Mining Stable Communities in Temporal Networks by Density-Based Clustering | 0 | 0.34 | 2022 |
| Index-Based Intimate-Core Community Search in Large Weighted Graphs | 0 | 0.34 | 2022 |
| Lightning Fast and Space Efficient k-clique Counting | 0 | 0.34 | 2022 |
| Mining Stable Quasi-Cliques on Temporal Networks | 0 | 0.34 | 2022 |
| Efficient Shortest Path Counting on Large Road Networks. | 0 | 0.34 | 2022 |
| Periodic Communities Mining in Temporal Networks: Concepts and Algorithms | 0 | 0.34 | 2022 |
| Colorful h-star Core Decomposition | 0 | 0.34 | 2022 |
| I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks | 0 | 0.34 | 2022 |
| Fairness-aware Maximal Clique Enumeration | 0 | 0.34 | 2022 |
| Mining Diversified Top-<inline-formula><tex-math notation="LaTeX">$r$</tex-math><alternatives><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>r</mml:mi></mml:math><inline-graphic xlink:href="yuan-ieq1-3058294.gif" xmlns:xlink="http://www.w3.org/1999/xlink"/></alternatives></inline-formula> Lasting Cohesive Subgraphs on Temporal Networks | 1 | 0.35 | 2022 |
| Filtration-Enhanced Graph Transformation. | 0 | 0.34 | 2022 |
| The Component Diagnosability of Hypercubes with Large-Scale Faulty Nodes | 0 | 0.34 | 2022 |
| Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 0 | 0.34 | 2022 |
| Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach | 0 | 0.34 | 2022 |
| Core Decomposition on Uncertain Graphs Revisited (Extended Abstract) | 0 | 0.34 | 2022 |
| Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach | 0 | 0.34 | 2022 |
| Target-Aware Holistic Influence Maximization in Spatial Social Networks | 8 | 0.47 | 2022 |
| Signed Clique Search in Signed Networks: Concepts and Algorithms | 0 | 0.34 | 2021 |
| Dynamic Community Evolution Analysis Framework for Large-Scale Complex Networks Based on Strong and Weak Events | 1 | 0.35 | 2021 |
| Butterfly-Based Higher-Order Clustering on Bipartite Networks. | 0 | 0.34 | 2020 |
| Research on automatic cleaning method for hole work-piece in rail transit by intelligent robot | 0 | 0.34 | 2020 |
| Ordering Heuristics for k-clique Listing. | 0 | 0.34 | 2020 |
| Finding skyline communities in multi-valued networks | 1 | 0.34 | 2020 |
| Cfgat: A Coarse-To-Fine Graph Attention Network For Semi-Supervised Node Classification | 0 | 0.34 | 2020 |
| Where to go: An effective point-of-interest recommendation framework for heterogeneous social networks. | 1 | 0.36 | 2020 |
| Efficient Top-k Edge Structural Diversity Search | 1 | 0.35 | 2020 |
| Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs | 5 | 0.39 | 2019 |
| Evidence-driven dubious decision making in online shopping | 1 | 0.36 | 2019 |
| Mining Periodic Cliques in Temporal Networks | 1 | 0.35 | 2019 |
| Discrete Overlapping Community Detection with Pseudo Supervision | 1 | 0.35 | 2019 |
| Improved Algorithms for Maximal Clique Search in Uncertain Networks | 3 | 0.36 | 2019 |
| Direction-based multiple views on data. | 0 | 0.34 | 2019 |
| Efficient Structural Clustering on Probabilistic Graphs | 1 | 0.36 | 2019 |
| Efficient Estimation of Heat Kernel PageRank for Local Clustering. | 2 | 0.37 | 2019 |
| ADPDF: A Hybrid Attribute Discrimination Method for Psychometric Data With Fuzziness. | 0 | 0.34 | 2019 |
| Skyline Community Search in Multi-valued Networks. | 12 | 0.45 | 2018 |
| Persistent Community Search in Temporal Networks | 13 | 0.46 | 2018 |
| A Fast Parallel Community Discovery Model on Complex Networks Through Approximate Optimization. | 5 | 0.38 | 2018 |
| Efficient Signed Clique Search in Signed Networks | 3 | 0.37 | 2018 |
| Predicting Long-Term Trajectories of Connected Vehicles via the Prefix-Projection Technique. | 5 | 0.39 | 2018 |
| Secure Hashing-Based Verifiable Pattern Matching. | 1 | 0.36 | 2018 |
| Discovering Hierarchical Subgraphs of K-Core-Truss. | 1 | 0.35 | 2018 |
| SocialMix: A familiarity-based and preference-aware location suggestion approach. | 5 | 0.43 | 2018 |
| Finding weighted k-truss communities in large networks. | 10 | 0.52 | 2017 |
| Efficient distance-based representative skyline computation in 2D space. | 1 | 0.35 | 2017 |
| Querying Intimate-Core Groups in Weighted Graphs | 3 | 0.37 | 2017 |
| Efficient Order-Sensitive Activity Trajectory Search. | 0 | 0.34 | 2017 |
