| 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 |
| 2024 | LATIN | On Approximate Colored Path Counting. | Younan Gao, Meng He |
| 2023 | COCOON | Sum-of-Local-Effects Data Structures for Separable Graphs. | Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh |
| 2023 | ISAAC | Distance Queries over Dynamic Interval Graphs. | Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang |
| 2023 | SPIRE | Dynamic Compact Planar Embeddings. | Travis Gagie, Meng He, Michael St Denis |
| 2022 | ESA | Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product. | Younan Gao, Meng He |
| 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 |
| 2021 | CPM | Data Structures for Categorical Path Counting Queries. | Meng He, Serikzhan Kazi |
| 2021 | ESA | Space Efficient Two-Dimensional Orthogonal Colored Range Counting. | Younan Gao, Meng He |
| 2020 | ESA | Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. | Younan Gao, Meng He, Yakov Nekrich |
| 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 |
| 2019 | GLOBECOM | Self-Interference Cancellation and Data Detection for Full-Duplex Communications. | Meng He, Chuan Huang |
| 2019 | ISAAC | Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. | Meng He, Serikzhan Kazi |
| 2019 | ISAAC | On Approximate Range Mode and Range Selection. | Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund |
| 2018 | ESA | Improved Time and Space Bounds for Dynamic Range Mode. | Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund |
| 2018 | ISAAC | Tree Path Majority Data Structures. | Travis Gagie, Meng He, Gonzalo Navarro |
| 2018 | LATIN | Maximal and Convex Layers of Random Point Sets. | Meng He, Cuong P. Nguyen, Norbert Zeh |
| 2017 | CPM | Path Queries on Functions. | Travis Gagie, Meng He, Gonzalo Navarro |
| 2017 | DCC | Compressed Dynamic Range Majority Data Structures. | Travis Gagie, Meng He, Gonzalo Navarro |
| 2017 | DocEng | High-performance Computational Framework for Phrase Relatedness. | Zichu Ai, Jie Mei, Abidalrahman Moh'd, Norbert Zeh, Meng He, Evangelos E. Milios |
| 2017 | WADS | Fast and Compact Planar Embeddings. | Leo Ferres, Jos Fuentes-Seplveda, Travis Gagie, Meng He, Gonzalo Navarro |
| 2016 | DCC | Engineering Wavelet Tree Implementations for Compressed Web Graph Representations. | Meng He, Chen Miao |
| 2016 | OPODIS | Deletion without Rebalancing in Non-Blocking Binary Search Trees. | Meng He, Mengdu Li |
| 2014 | ESA | Succinct Indices for Path Minimum, with Applications to Path Reporting. | Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou |
| 2014 | ISAAC | Dynamic Path Counting and Reporting in Linear Space. | Meng He, J. Ian Munro, Gelin Zhou |
| 2014 | ISAAC | Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. | Meng He, Ganggui Tang, Norbert Zeh |
| 2013 | ISAAC | The Distance 4-Sector of Two Points Is Unique. | Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro Lpez-Ortiz, J. Ian Munro, Patrick K. Nicholson |
| 2012 | ESA | Succinct Data Structures for Path Queries. | Meng He, J. Ian Munro, Gelin Zhou |
| 2012 | ISAAC | On the Advice Complexity of Buffer Management. | Reza Dorrigiv, Meng He, Norbert Zeh |
| 2012 | ISAAC | A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. | Meng He, J. Ian Munro, Gelin Zhou |
| 2012 | ISAAC | A Space-Efficient Framework for Dynamic Point Location. | Meng He, Patrick K. Nicholson, Norbert Zeh |
| 2012 | WAOA | On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. | Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro Lpez-Ortiz, Diego Seco |
| 2011 | ICALP | Range Majority in Constant Time and Linear Space. | Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala |
| 2011 | ISAAC | Dynamic Range Majority Data Structures. | Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson |
| 2011 | ISAAC | Dynamic Range Selection in Linear Space. | Meng He, J. Ian Munro, Patrick K. Nicholson |
| 2011 | ISAAC | Path Queries in Weighted Trees. | Meng He, J. Ian Munro, Gelin Zhou |
| 2011 | SPIRE | Finding Frequent Elements in Compressed 2D Arrays and Strings. | Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson |
| 2011 | WADS | Space Efficient Data Structures for Dynamic Orthogonal Range Counting. | Meng He, J. Ian Munro |
| 2010 | SPIRE | Succinct Representations of Dynamic Strings. | Meng He, J. Ian Munro |
| 2009 | ISAAC | Untangled Monotonic Chains and Adaptive Range Search. | Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro Lpez-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala |
| 2009 | ISAAC | I/O and Space-Efficient Path Traversal in Planar Graphs. | Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh |
| 2009 | SODA | Succinct geometric indexes supporting point location queries. | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin |
| 2009 | WADS | Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. | Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin |
| 2008 | ISAAC | Succinct and I/O Efficient Data Structures for Traversal in Trees. | Craig Dillabaugh, Meng He, Anil Maheshwari |
| 2007 | ICALP | Succinct Ordinal Trees Based on Tree Covering. | Meng He, J. Ian Munro, S. Srinivasa Rao |
| 2007 | ISAAC | Succinct Representation of Labeled Graphs. | Jrmy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro |
| 2007 | SODA | Succinct indexes for strings, binary relations and multi-labeled trees. | Jrmy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao |
| 2005 | SODA | A categorization theorem on suffix arrays with applications to space efficient text indexes. | Meng He, J. Ian Munro, S. Srinivasa Rao |