Yingli Zhou

Orcid: 0009-0008-5630-6822

According to our database1, Yingli Zhou authored at least 7 papers between 2022 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks.
Proc. VLDB Endow., July, 2024

Efficient Parallel D-core Decomposition at Scale.
Proc. VLDB Endow., June, 2024

A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery.
Proc. ACM Manag. Data, 2024

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework.
CoRR, 2024

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index.
CoRR, 2024

2023
Influential Community Search over Large Heterogeneous Information Networks.
Proc. VLDB Endow., 2023

2022
Understanding users' requirements precisely: a double Bi-LSTM-CRF joint model for detecting user's intentions and slot tags.
Neural Comput. Appl., 2022


  Loading...