default search action
Dian Ouyang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Qi Liang, Dian Ouyang, Fan Zhang, Jianye Yang, Xuemin Lin, Zhihong Tian:
Efficient Regular Simple Path Queries under Transitive Restricted Expressions. Proc. VLDB Endow. 17(7): 1710-1722 (2024) - [j6]Fan Zhang
, Haicheng Guo
Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution. IEEE Trans. Knowl. Data Eng. 36(1): 356-371 (2024) - [j5]Jianhua Wang
Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs. IEEE Trans. Knowl. Data Eng. 36(9): 4618-4631 (2024) - [j4]Dian Ouyang
Multi-Source Shortest Path Query With Assembly Points on Large Graphs. IEEE Trans. Knowl. Data Eng. 36(12): 8859-8875 (2024) - 2023
- [j3]Jianye Yang, Yun Peng, Dian Ouyang, Wenjie Zhang, Xuemin Lin, Xiang Zhao:
(p,q)-biclique counting and enumeration for large sparse bipartite graphs. VLDB J. 32(5): 1137-1161 (2023) - [j2]Dian Ouyang, Dong Wen
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. VLDB J. 32(6): 1263-1287 (2023) - [c8]Li Lin, Dian Ouyang, Zhipeng He, Chengqian Li:
Parallelize Accelerated Triangle Counting Using Bit-Wise on GPU. WISA 2023: 551-558 - [c7]Jiujing Zhang, Shiyu Yang, Dian Ouyang, Fan Zhang, Xuemin Lin, Long Yuan
Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs. ICDE 2023: 762-775 - 2022
- [c6]Qiuyu Guo, Xiang Zhao, Yang Fang, Shiyu Yang, Xuemin Lin, Dian Ouyang:
Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks. CIKM 2022: 635-645 - 2021
- [c5]Hongxuan Huang, Qingyuan Linghu, Fan Zhang, Dian Ouyang, Shiyu Yang:
Truss Decomposition on Multilayer Graphs. IEEE BigData 2021: 5912-5915 - 2020
- [j1]Dian Ouyang, Long Yuan
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees. Proc. VLDB Endow. 13(5): 602-615 (2020) - [c4]Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin
Speeding Up GED Verification for Graph Similarity Search. ICDE 2020: 793-804 - [c3]Dian Ouyang, Dong Wen
Progressive Top-K Nearest Neighbors Search in Large Road Networks. SIGMOD Conference 2020: 1781-1795
2010 – 2019
- 2019
- [b1]Dian Ouyang:
Efficient shortest distance query processing and indexing on large road network. University of Technology Sydney, Australia, 2019 - 2018
- [c2]Dian Ouyang, Long Yuan
Towards Efficient Path Skyline Computation in Bicriteria Networks. DASFAA (1) 2018: 239-254 - [c1]Dian Ouyang, Lu Qin
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. SIGMOD Conference 2018: 709-724
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: