PPaperPicks

Yixiang Fang

The Chinese University of Hong Kong, Shenzhen, China

38 papers at tracked venues · 37 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs
  2. Accelerated Coordinate Descent for Directed Densest Subgraph Discovery
  3. ArchRAG: Attributed Community-based Hierarchical Retrieval-Augmented Generation
  4. BookRAG: A Hierarchical Structure-aware Index-based Approach for Retrieval-Augmented Generation on Complex Documents
  5. Clue-RAG: Towards Accurate and Cost-Efficient Graph-Based RAG Via Multi-Partite Graph-Based Index
  6. Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance
  7. Efficient Influential Community Search over Dynamic Graphs
  8. HAMMER: An Automatic RAG Tuning System via Hierarchical Memory-Guided Monte Carlo Tree Search
  9. Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs
  10. ACE: A Cardinality Estimator for Set-Valued Queries
  11. Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs
  12. Bridging Knowledge Gap Between Image Inpainting and Large-Area Visible Watermark Removal
  13. Effective Durable Community Search in Large Temporal Graph
  14. Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
  15. Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs
  16. Efficient and Scalable Directed Densest Subgraph Discovery
  17. Efficient 푘-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory
  18. Efficiently Counting Triangles in Large Temporal Graphs
  19. In-depth Analysis of Graph-based RAG in a Unified Framework
  20. LLM+Graph: 2nd International Workshop on Data Management Opportunities in Bringing LLMs with Graph Data
    VLDB 2025 · Yixiang Fang
  21. Scalable Approximate Biclique Counting over Large Bipartite Graphs
  22. Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks
  23. Semi-supervised Node Importance Estimation with Informative Distribution Modeling for Uncertainty Regularization
  24. TRACE: Intra-visit Clinical Event Nowcasting via Effective Patient Trajectory Encoding
  25. A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery
  26. A Similarity-based Approach for Efficient Large Quasi-clique Detection
  27. Deep Structural Knowledge Exploitation and Synergy for Estimating Node Importance Value on Heterogeneous Information Networks
  28. Distributed Shortest Distance Labeling on Large-Scale Graphs
  29. Effective Job-market Mobility Prediction with Attentive Heterogeneous Knowledge Learning and Synergy
  30. Efficient Core Decomposition Over Large Heterogeneous Information Networks
  31. Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs
  32. Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks
  33. Efficient Parallel D-core Decomposition at Scale
  34. In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
  35. Influential Exemplar Replay for Incremental Learning in Recommender Systems
  36. Interactive Graph Search for Multiple Targets on DAGs
  37. On Efficient Large Sparse Matrix Chain Multiplication
  38. Removing Interference and Recovering Content Imaginatively for Visible Watermark Removal