- ICS 2022 | Software-Defined Floating-Point Number Formats and Their Application to Graph Processing
- ICS 2022 | MASTIFF: Structure-Aware Minimum Spanning Tree/Forest
- ISPASS 2022 (Poster) | SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs
- PPoPP 2022 | LOTUS: Locality Optimizing Triangle Counting
- IISWC 2021 | Locality Analysis of Graph Reordering Algorithms
- IEEE CLUSTER 2021 | Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs
- ICPP 2021 | Exploiting in-Hub Temporal Locality in SpMV-based Graph Processing
- CCPE 2021 | Reducing The Burden of Parallel Loop Schedulers for Many‐Core Processors [Open Access]
- ISPASS 2021 (Poster) | How Do Graph Relabeling Algorithms Improve Memory Locality?
- SDU@AAAI 2021 | Understood in Translation, Transformers for Domain Understanding
- FGCS 2020 | Fast load balance parallel graph analytics with an automatic graph data structure selection algorithm
- HPEC 2020 | Half-Precision Floating-Point Formats for PageRank: Opportunities and Challenges
- ICS 2020 | Graptor: Efficient Pull and Push Style Vectorized Graph Processing [ACM]
- PPOPP 2019 | VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing (Poster) [ACM]
- 2018 VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing
- ICPP 2017 | Accelerating Graph Analytics by Utilising the Memory Locality of Graph Partitioning
- ICS 2017 | GraphGrind: Addressing Load Imbalance of Graph Partitioning [ACM]