| 2025 | WADS | Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex Leafage. | Meng He, Kaiyu Wu |
| 2024 | CPM | Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs. | Meng He, Kaiyu Wu |
| 2024 | DCC | Succinct Data Structures for Path Graphs and Chordal Graphs Revisited. | Meng He, J. Ian Munro, Kaiyu Wu |
| 2024 | DCC | Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs. | Meng He, J. Ian Munro, Kaiyu Wu |
| 2023 | ISAAC | Distance Queries over Dynamic Interval Graphs. | Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang |
| 2022 | ISAAC | Shortest Beer Path Queries in Interval Graphs. | Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu |
| 2022 | SPIRE | Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. | Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu |
| 2020 | ISAAC | Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. | Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu |
| 2018 | ISAAC | Succinct Data Structures for Chordal Graphs. | J. Ian Munro, Kaiyu Wu |