Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Efficient Regular Simple Path Queries under Transitive Restricted Expressions.

Q. Liang, D. Ouyang, F. Zhang, J. Yang, X. Lin, and Z. Tian. Proc. VLDB Endow., 17 (7): 1710-1722 (March 2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dian Handayani

Xiaokang Ouyang

Yingkai Ouyang

Mahmud Dianati

Nadja Diane

Other publications of authors with the same name

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks.D. Ouyang, D. Wen, L. Qin, L. Chang, X. Lin, and Y. Zhang. VLDB J., 32 (6): 1263-1287 (November 2023)(p,q)-biclique counting and enumeration for large sparse bipartite graphs.J. Yang, Y. Peng, D. Ouyang, W. Zhang, X. Lin, and X. Zhao. VLDB J., 32 (5): 1137-1161 (September 2023)Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees.D. Ouyang, L. Yuan, L. Qin, L. Chang, Y. Zhang, and X. Lin. Proc. VLDB Endow., 13 (5): 602-615 (2020)Parallelize Accelerated Triangle Counting Using Bit-Wise on GPU.L. Lin, D. Ouyang, Z. He, and C. Li. WISA, volume 14094 of Lecture Notes in Computer Science, page 551-558. Springer, (2023)Speeding Up GED Verification for Graph Similarity Search.L. Chang, X. Feng, X. Lin, L. Qin, W. Zhang, and D. Ouyang. ICDE, page 793-804. IEEE, (2020)Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution.F. Zhang, H. Guo, D. Ouyang, S. Yang, X. Lin, and Z. Tian. IEEE Trans. Knowl. Data Eng., 36 (1): 356-371 (January 2024)Efficient shortest distance query processing and indexing on large road networkD. Ouyang. University of Technology Sydney, Australia, (2019)Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks.Q. Guo, X. Zhao, Y. Fang, S. Yang, X. Lin, and D. Ouyang. CIKM, page 635-645. ACM, (2022)Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs.J. Zhang, S. Yang, D. Ouyang, F. Zhang, X. Lin, and L. Yuan. ICDE, page 762-775. IEEE, (2023)Truss Decomposition on Multilayer Graphs.H. Huang, Q. Linghu, F. Zhang, D. Ouyang, and S. Yang. IEEE BigData, page 5912-5915. IEEE, (2021)

BibSonomy

Disambiguation of "Ouyang, Dian"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Efficient Regular Simple Path Queries under Transitive Restricted Expressions.

Please choose a person to relate this publication to

Dian Handayani

Xiaokang Ouyang

Yingkai Ouyang

Mahmud Dianati

Nadja Diane

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Ouyang, Dian"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Efficient Regular Simple Path Queries under Transitive Restricted Expressions.

Please choose a person to relate this publication to

Dian Handayani

Xiaokang Ouyang

Yingkai Ouyang

Mahmud Dianati

Nadja Diane

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Efficient Regular Simple Path Queries under Transitive Restricted Expressions.