Xin Chen

Orcid: 0009-0006-5802-404X

Affiliations:
  • e Chinese University of Hong Kong, Hong Kong, SAR, China


According to our database1, Xin Chen authored at least 5 papers between 2022 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Finding Near-Optimal Maximum Set of Disjoint <i>k</i>-Cliques in Real-World Social Networks.
CoRR, March, 2025

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks.
Proceedings of the 41st IEEE International Conference on Data Engineering, 2025

2024
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs.
Proc. VLDB Endow., February, 2024

NT-LLM: A Novel Node Tokenizer for Integrating Graph Structure into Large Language Models.
CoRR, 2024

2022
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs.
Proc. VLDB Endow., 2022


  Loading...