Obserwuj
Long Yuan
Tytuł
Cytowane przez
Cytowane przez
Rok
Index-based densest clique percolation community search in networks
L Yuan, L Qin, W Zhang, L Chang, J Yang
IEEE Transactions on Knowledge and Data Engineering 30 (5), 922-935, 2017
1322017
Diversified top-k clique search
L Yuan, L Qin, X Lin, L Chang, W Zhang
The VLDB Journal 25 (2), 171-196, 2016
1242016
Efficient (α,β)-core Computation: an Index-based Approach
B Liu, L Yuan, X Lin, L Qin, W Zhang, J Zhou
The World Wide Web Conference, 1130-1141, 2019
1162019
Efficient (, )-core computation in bipartite graphs
B Liu, L Yuan, X Lin, L Qin, W Zhang, J Zhou
The VLDB Journal 29 (5), 1075-1099, 2020
702020
Effective and efficient dynamic graph coloring
L Yuan, L Qin, X Lin, L Chang, W Zhang
Proceedings of the VLDB Endowment 11 (3), 338-351, 2017
592017
Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees
D Ouyang, L Yuan, L Qin, L Chang, Y Zhang, X Lin
Proceedings of the VLDB Endowment 13 (5), 602-615, 2020
512020
Efficient maximal balanced clique enumeration in signed networks
Z Chen, L Yuan, X Lin, L Qin, J Yang
Proceedings of The Web Conference 2020, 339-349, 2020
422020
Discovering strong communities with user engagement and tie strength
F Zhang, L Yuan, Y Zhang, L Qin, X Lin, A Zhou
International Conference on Database Systems for Advanced Applications, 425-441, 2018
352018
I/O efficient ECC graph decomposition via graph reduction
L Yuan, L Qin, X Lin, L Chang, W Zhang
The VLDB Journal 26 (2), 275-300, 2017
262017
Distributed hop-constrained st simple path enumeration at billion scale
K Hao, L Yuan, W Zhang
Proceedings of the VLDB Endowment 15 (2), 169-182, 2021
232021
I/O efficient ECC graph decomposition via graph reduction
L Yuan, L Qin, X Lin, L Chang, W Zhang
Proceedings of the VLDB Endowment, 2016
222016
Trusted AI in multi-agent systems: An overview of privacy and security for distributed learning
C Ma, J Li, K Wei, B Liu, M Ding, L Yuan, Z Han, HV Poor
arXiv preprint arXiv:2202.09027, 2022
192022
Efficient label-constrained shortest path queries on road networks: A tree decomposition approach
U Zhang, L Yuan, W Li, L Qin, Y Zhang
Proceedings of the VLDB Endowment, 2021
192021
Efficient set containment join
J Yang, W Zhang, S Yang, Y Zhang, X Lin, L Yuan
The VLDB Journal 27 (4), 471–495, 2018
182018
Towards efficient path skyline computation in bicriteria networks
D Ouyang, L Yuan, F Zhang, L Qin, X Lin
International Conference on Database Systems for Advanced Applications, 239-254, 2018
162018
Towards Efficient k-TriPeak Decomposition on Large Graphs
X Wu, L Yuan, X Lin, S Yang, W Zhang
Database Systems for Advanced Applications: 24th International Conference …, 2019
152019
Data level privacy preserving: A stochastic perturbation approach based on differential privacy
C Ma, L Yuan, L Han, M Ding, R Bhaskar, J Li
IEEE Transactions on Knowledge and Data Engineering 35 (4), 3619-3631, 2021
132021
Higher-order truss decomposition in graphs
Z Chen, L Yuan, L Han, Z Qian
IEEE Transactions on Knowledge and Data Engineering 35 (4), 3966-3978, 2021
122021
Distributed computing connected components with linear communication cost
X Feng, L Chang, X Lin, L Qin, W Zhang, L Yuan
Distributed and Parallel Databases 36, 555-592, 2018
102018
Index-based structural clustering on directed graphs
L Meng, L Yuan, Z Chen, X Lin, S Yang
2022 IEEE 38th International Conference on Data Engineering (ICDE), 2831-2844, 2022
92022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20