Mengxuan Zhang

Orcid: 0000-0001-8155-4942

Affiliations:
  • Iowa State University, USA
  • University of Queensland, Australia (Ph.D.)


According to our database1, Mengxuan Zhang authored at least 31 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs.
IEEE Trans. Knowl. Data Eng., November, 2024

Mobility Data Science: Perspectives and Challenges.
ACM Trans. Spatial Algorithms Syst., June, 2024

Efficient processing of coverage centrality queries on road networks.
World Wide Web (WWW), May, 2024

Three Pillars Towards Next-Generation Routing System.
CoRR, 2024

High Throughput Shortest Distance Query Processing on Large Dynamic Road Networks.
CoRR, 2024

Scalable Distance Labeling Maintenance and Construction for Dynamic Small-World Networks.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

A Just-In-Time Framework for Continuous Routing.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Managing the Future: Route Planning Influence Evaluation in Transportation Systems.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Approximate Skyline Index for Constrained Shortest Pathfinding with Theoretical Guarantee.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

2023
Parallel Hub Labeling Maintenance With High Efficiency in Dynamic Small-World Networks.
IEEE Trans. Knowl. Data Eng., November, 2023

Multi-constraint shortest path using forest hop labeling.
VLDB J., May, 2023

A Universal Scheme for Partitioned Dynamic Shortest Path Index.
CoRR, 2023

Towards Mobility Data Science (Vision Paper).
CoRR, 2023

Global Routing Optimization In Road Networks.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
Stream Processing of Shortest Path Query in Dynamic Road Networks.
IEEE Trans. Knowl. Data Eng., 2022

Diversified Top-k Route Planning in Road Network.
Proc. VLDB Endow., 2022

FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints.
Proc. VLDB Endow., 2022

Mobility Data Science (Dagstuhl Seminar 22021).
Dagstuhl Reports, 2022

A Top-Down Scheme for Coverage Centrality Queries on Road Networks.
Proceedings of the Databases Theory and Applications, 2022

2021
Efficient shortest path query processing in dynamic road networks
PhD thesis, 2021

An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network.
Proc. VLDB Endow., 2021

Dynamic Hub Labeling for Road Networks.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient 2-Hop Labeling Maintenance in Dynamic Small-World Networks.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient Constrained Shortest Path Query Answering with Forest Hop Labeling.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient Trajectory Contact Query Processing.
Proceedings of the Database Systems for Advanced Applications, 2021

An Experimental Study on Exact Multi-constraint Shortest Path Finding.
Proceedings of the Databases Theory and Applications, 2021

2020
Fast Query Decomposition for Batch Shortest Path Processing in Road Networks.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Path Query Processing Using Typical Snapshots in Dynamic Road Networks.
Proceedings of the Database Systems for Advanced Applications, 2020

Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks.
Proceedings of the Databases Theory and Applications, 2020

2019
Efficient Batch Processing of Shortest Path Queries in Road Networks.
Proceedings of the 20th IEEE International Conference on Mobile Data Management, 2019

Batch Processing of Shortest Path Queries in Road Networks.
Proceedings of the Databases Theory and Applications, 2019


  Loading...