Dian Ouyang

Orcid: 0000-0002-9472-4389

According to our database1, Dian Ouyang authored at least 15 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs.
IEEE Trans. Knowl. Data Eng., September, 2024

Efficient Regular Simple Path Queries under Transitive Restricted Expressions.
Proc. VLDB Endow., March, 2024

Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution.
IEEE Trans. Knowl. Data Eng., January, 2024

2023
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks.
VLDB J., November, 2023

(p,q)-biclique counting and enumeration for large sparse bipartite graphs.
VLDB J., September, 2023

Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Parallelize Accelerated Triangle Counting Using Bit-Wise on GPU.
Proceedings of the Web Information Systems and Applications, 2023

2022
Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021
Truss Decomposition on Multilayer Graphs.
Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

2020
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees.
Proc. VLDB Endow., 2020

Progressive Top-K Nearest Neighbors Search in Large Road Networks.
Proceedings of the 2020 International Conference on Management of Data, 2020

Speeding Up GED Verification for Graph Similarity Search.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

2019
Efficient shortest distance query processing and indexing on large road network
PhD thesis, 2019

2018
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks.
Proceedings of the 2018 International Conference on Management of Data, 2018

Towards Efficient Path Skyline Computation in Bicriteria Networks.
Proceedings of the Database Systems for Advanced Applications, 2018


  Loading...