首页 > 研究生教育 > O > 正文

欧阳典

发布时间:2021-03-19文章来源: 浏览次数:

教育经历:

悉尼大学博士后

2019.3-2020.3

澳大利亚

悉尼科技大学博士

2015-2019

澳大利亚

中国人民大学学士

2011-2015

中国

研究方向:

图论算法研究,图数据管理,数据挖掘,路网查询等等

 

发表文章:

1.Dian OuyangLu QinLijun ChangXuemin LinYing ZhangQing Zhu: When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks, published in SIGMOD 2018(CCF A class)

2.Dian OuyangLong YuanFan ZhangLu QinXuemin Lin:Towards Efficient Path Skyline Computation in Bicriteria Networks, published in DASFAA 2018(CCF B class)

3.Dian Ouyang, Long YuanLu QinLijun ChangYing ZhangXuemin Lin: Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees, published in VLDB 2020(CCF A class)

4.Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang, Dian Ouyang: Speeding Up GED Verification for Graph Similarity Search, published in ICDE 2020(CCF A class)

5.Dian Ouyang, Dong Wen, Lu QinLijun ChangYing ZhangXuemin Lin: Progressive Top-K Nearest Neighbors Search in Large Road Networks, published in SIGMOD 2020(CCF A class)


Email:dian.ouyang@outlook.com

关闭 打印责任编辑:274975