Meng He - RankMe

105 papers A* 4A 6B 37C 4Journal 45Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Compressed Set Representations based on Set Difference. CoRR Travis Gagie, Meng He, Gonzalo Navarro
2025	J	`jnl`	Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. Comput. Geom. Topol. Meng He, Serikzhan Kazi
2025	B	`conf`	Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex Leafage. WADS Meng He, Kaiyu Wu
2024	B	`conf`	Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs. CPM Meng He, Kaiyu Wu
2024	J	`jnl`	Distance queries over dynamic interval graphs. Comput. Geom. Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
2024	J	`jnl`	Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG). Comput. Geom. Meng He, Don Sheehy
2024	—	`conf`	On Approximate Colored Path Counting. LATIN (1) Younan Gao, Meng He
2024	B	`conf`	Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs. DCC Meng He, J. Ian Munro, Kaiyu Wu
2024	B	`conf`	Succinct Data Structures for Path Graphs and Chordal Graphs Revisited. DCC Meng He, J. Ian Munro, Kaiyu Wu
2023	B	`conf`	Distance Queries over Dynamic Interval Graphs. ISAAC Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
2023	C	`conf`	Dynamic Compact Planar Embeddings. SPIRE Travis Gagie, Meng He, Michael St Denis
2023	B	`conf`	Exact and Approximate Range Mode Query Data Structures in Practice. SEA Meng He, Zhen Liu
2023	J	`jnl`	Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021). Algorithmica Meng He, Anna Lubiw, Mohammad R. Salavatipour
2023	J	`jnl`	Preface. Comput. Geom. Meng He, Anna Lubiw, Mohammad R. Salavatipour
2023	—	`conf`	Sum-of-Local-Effects Data Structures for Separable Graphs. COCOON (1) Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh
2023	J	`jnl`	Sum-of-Local-Effects Data Structures for Separable Graphs. CoRR Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh
2022	J	`jnl`	Data structures for categorical path counting queries. Theor. Comput. Sci. Meng He, Serikzhan Kazi
2022	A	`conf`	Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product. ESA Younan Gao, Meng He
2022	C	`conf`	Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. SPIRE Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu
2022	B	`conf`	Shortest Beer Path Queries in Interval Graphs. ISAAC Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu
2022	J	`jnl`	Shortest Beer Path Queries in Interval Graphs. CoRR Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu
2021	B	`conf`	Data Structures for Categorical Path Counting Queries. CPM Meng He, Serikzhan Kazi
2021	—	`ed.`	Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova Scotia, Canada CCCG Meng He, Don Sheehy
2021	A	`conf`	Space Efficient Two-Dimensional Orthogonal Colored Range Counting. ESA Younan Gao, Meng He
2021	J	`jnl`	Space Efficient Two-Dimensional Orthogonal Colored Range Counting. CoRR Younan Gao, Meng He
2020	J	`jnl`	Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. CoRR Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
2020	J	`jnl`	Compressed Dynamic Range Majority and Minority Data Structures. Algorithmica Travis Gagie, Meng He, Gonzalo Navarro
2020	B	`conf`	Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
2020	A	`conf`	Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. ESA Younan Gao, Meng He, Yakov Nekrich
2020	J	`jnl`	Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. CoRR Younan Gao, Meng He, Yakov Nekrich
2020	J	`jnl`	Fast and compact planar embeddings. Comput. Geom. Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
2020	B	`conf`	Path Query Data Structures in Practice. SEA Meng He, Serikzhan Kazi
2020	J	`jnl`	Path Query Data Structures in Practice. CoRR Meng He, Serikzhan Kazi
2020	J	`jnl`	Tree path majority data structures. Theor. Comput. Sci. Travis Gagie, Meng He, Gonzalo Navarro, Carlos Ochoa
2019	J	`jnl`	Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG). Comput. Geom. Meng He, Norbert Zeh
2019	B	`conf`	On Approximate Range Mode and Range Selection. ISAAC Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
2019	J	`jnl`	On Approximate Range Mode and Range Selection. CoRR Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
2019	J	`jnl`	Path and Ancestor Queries on Trees with Multidimensional Weight Vectors. CoRR Meng He, Serikzhan Kazi
2019	B	`conf`	Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. ISAAC Meng He, Serikzhan Kazi
2019	J	`jnl`	Path queries on functions. Theor. Comput. Sci. Travis Gagie, Meng He, Gonzalo Navarro
2018	J	`jnl`	Dynamic Path Queries in Linear Space. Algorithmica Meng He, J. Ian Munro, Gelin Zhou
2018	A	`conf`	Improved Time and Space Bounds for Dynamic Range Mode. ESA Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
2018	J	`jnl`	Improved Time and Space Bounds for Dynamic Range Mode. CoRR Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
2018	B	`conf`	Maximal and Convex Layers of Random Point Sets. LATIN Meng He, Cuong P. Nguyen, Norbert Zeh
2018	—	`conf`	Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. ANALCO Meng He, Richard Peng, Yinzhan Xu
2018	B	`conf`	Tree Path Majority Data Structures. ISAAC Travis Gagie, Meng He, Gonzalo Navarro
2018	J	`jnl`	Tree Path Majority Data Structures. CoRR Travis Gagie, Meng He, Gonzalo Navarro
2017	B	`conf`	Compressed Dynamic Range Majority Data Structures. DCC Travis Gagie, Meng He, Gonzalo Navarro
2017	B	`conf`	Fast and Compact Planar Embeddings. WADS Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
2017	B	`conf`	High-performance Computational Framework for Phrase Relatedness. DocEng Zichu Ai, Jie Mei, Abidalrahman Moh'd, Norbert Zeh, Meng He, Evangelos E. Milios
2017	J	`jnl`	I/O-Efficient Path Traversal in Succinct Planar Graphs. Algorithmica Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
2017	J	`jnl`	Parallel Construction of Compact Planar Embeddings. CoRR Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
2017	J	`jnl`	Parallel construction of succinct trees. Theor. Comput. Sci. José Fuentes-Sepúlveda, Leo Ferres, Meng He, Norbert Zeh
2017	B	`conf`	Path Queries on Functions. CPM Travis Gagie, Meng He, Gonzalo Navarro
2017	J	`jnl`	Succinct Indices for Path Minimum, with Applications. Algorithmica Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
2016	J	`jnl`	Compressed Dynamic Range Majority Data Structures. CoRR Travis Gagie, Meng He, Gonzalo Navarro
2016	J	`jnl`	Data Structures for Path Queries. ACM Trans. Algorithms Meng He, J. Ian Munro, Gelin Zhou
2016	B	`conf`	Deletion without Rebalancing in Non-Blocking Binary Search Trees. OPODIS Meng He, Mengdu Li
2016	J	`jnl`	Dynamic range majority data structures. Theor. Comput. Sci. Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
2016	B	`conf`	Engineering Wavelet Tree Implementations for Compressed Web Graph Representations. DCC Meng He, Chen Miao
2016	J	`jnl`	Fast and Compact Planar Embeddings. CoRR Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
2016	—	`ch.`	Succinct Data Structures for Parentheses Matching. Encyclopedia of Algorithms Meng He
2015	J	`jnl`	On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Theory Comput. Syst. Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco
2015	B	`conf`	Parallel Construction of Succinct Trees. SEA Leo Ferres, José Fuentes-Sepúlveda, Meng He, Norbert Zeh
2014	J	`jnl`	A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Algorithmica Meng He, J. Ian Munro, Gelin Zhou
2014	B	`conf`	Dynamic Path Counting and Reporting in Linear Space. ISAAC Meng He, J. Ian Munro, Gelin Zhou
2014	B	`conf`	Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. ISAAC Meng He, Ganggui Tang, Norbert Zeh
2014	J	`jnl`	Space efficient data structures for dynamic orthogonal range counting. Comput. Geom. Meng He, J. Ian Munro
2014	A	`conf`	Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
2013	J	`jnl`	Range majority in constant time and linear space. Inf. Comput. Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
2013	—	`conf`	Succinct and Implicit Data Structures for Computational Geometry. Space-Efficient Data Structures, Streams, and Algorithms Meng He
2013	B	`conf`	The Distance 4-Sector of Two Points Is Unique. ISAAC Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson
2012	B	`conf`	A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. ISAAC Meng He, J. Ian Munro, Gelin Zhou
2012	B	`conf`	A Space-Efficient Framework for Dynamic Point Location. ISAAC Meng He, Patrick K. Nicholson, Norbert Zeh
2012	B	`conf`	On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. WAOA Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco
2012	B	`conf`	On the Advice Complexity of Buffer Management. ISAAC Reza Dorrigiv, Meng He, Norbert Zeh
2012	A	`conf`	Succinct Data Structures for Path Queries. ESA Meng He, J. Ian Munro, Gelin Zhou
2012	J	`jnl`	Succinct Representation of Labeled Graphs. Algorithmica Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
2012	J	`jnl`	Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica Craig Dillabaugh, Meng He, Anil Maheshwari
2012	J	`jnl`	Succinct geometric indexes supporting point location queries. ACM Trans. Algorithms Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
2012	J	`jnl`	Succinct ordinal trees based on tree covering. ACM Trans. Algorithms Meng He, J. Ian Munro, Srinivasa Rao Satti
2011	J	`jnl`	Dynamic Range Majority Data Structures CoRR Meng He, J. Ian Munro, Patrick K. Nicholson
2011	B	`conf`	Dynamic Range Majority Data Structures. ISAAC Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
2011	J	`jnl`	Dynamic Range Selection in Linear Space CoRR Meng He, J. Ian Munro, Patrick K. Nicholson
2011	B	`conf`	Dynamic Range Selection in Linear Space. ISAAC Meng He, J. Ian Munro, Patrick K. Nicholson
2011	C	`conf`	Finding Frequent Elements in Compressed 2D Arrays and Strings. SPIRE Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson
2011	B	`conf`	Path Queries in Weighted Trees. ISAAC Meng He, J. Ian Munro, Gelin Zhou
2011	—	`conf`	Range Majority in Constant Time and Linear Space. ICALP (1) Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
2011	B	`conf`	Space Efficient Data Structures for Dynamic Orthogonal Range Counting. WADS Meng He, J. Ian Munro
2011	J	`jnl`	Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti
2011	J	`jnl`	Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala
2010	J	`jnl`	Succinct Representations of Dynamic Strings CoRR Meng He, J. Ian Munro
2010	C	`conf`	Succinct Representations of Dynamic Strings. SPIRE Meng He, J. Ian Munro
2009	B	`conf`	I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
2009	B	`conf`	Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin
2009	A*	`conf`	Succinct geometric indexes supporting point location queries. SODA Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
2009	B	`conf`	Untangled Monotonic Chains and Adaptive Range Search. ISAAC Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala
2008	—	`ch.`	Succinct Data Structures for Parentheses Matching. Encyclopedia of Algorithms Meng He
2008	J	`jnl`	Succinct Geometric Indexes Supporting Point Location Queries CoRR Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
2008	—	`—`	Succinct Indexes. Meng He
2008	B	`conf`	Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC Craig Dillabaugh, Meng He, Anil Maheshwari
2007	A*	`conf`	Succinct Ordinal Trees Based on Tree Covering. ICALP Meng He, J. Ian Munro, S. Srinivasa Rao
2007	B	`conf`	Succinct Representation of Labeled Graphs. ISAAC Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
2007	A*	`conf`	Succinct indexes for strings, binary relations and multi-labeled trees. SODA Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
2005	A*	`conf`	A categorization theorem on suffix arrays with applications to space efficient text indexes. SODA Meng He, J. Ian Munro, S. Srinivasa Rao