default search action
Xiaodong Li 0009
Person information
- affiliation: University of Hong Kong, Department of Computer Science, Hong Kong
- not to be confused with: Xiaodong Li 0010
Other persons with the same name
- Xiaodong Li (aka: Xiao-Dong Li) — disambiguation page
- Xiaodong Li 0001
— RMIT University, Evolutionary Computation and Machine Learning Research Group, Melbourne, VIC, Australia (and 1 more)
- Xiaodong Li 0002
- Xiaodong Li 0003
- Xiaodong Li 0004
- Xiaodong Li 0005 — University of Pennsylvania, Department of Wharton Statistics, Philadelphia, PA, USA (and 1 more)
- Xiaodong Li 0006
- Xiaodong Li 0007
- Xiaodong Li 0008
- Xiaodong Li 0010 — University of Hong Kong, Department of Orthopaedics and Traumatology, Hong Kong (and 1 more)
- Xiaodong Li 0011
- Xiaodong Li 0012
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Xiaolin Han
FDM: Effective and efficient incident detection on sparse trajectory data. Inf. Syst. 125: 102418 (2024) - [j8]Nan Huo, Reynold Cheng, Ben Kao, Wentao Ning, Nur Al Hasan Haldar, Xiaodong Li, Jinyang Li, Mohammad Matin Najafi, Tian Li, Ge Qu:
ZeroEA: A Zero-Training Entity Alignment Framework via Pre-Trained Language Model. Proc. VLDB Endow. 17(7): 1765-1774 (2024) - [j7]Chenhao Ma
Accelerating directed densest subgraph queries with software and hardware approaches. VLDB J. 33(1): 207-230 (2024) - [c6]Qihao Wang, Hongtai Cao, Xiaodong Li, Kevin Chen-Chuan Chang, Reynold Cheng:
From Motif to Path: Connectivity and Homophily. ICDE 2024: 2751-2764 - [c5]Hongtai Cao, Qihao Wang, Xiaodong Li, Matin Najafi, Kevin Chen-Chuan Chang, Reynold Cheng:
Large Subgraph Matching: A Comprehensive and Efficient Approach for Heterogeneous Graphs. ICDE 2024: 2972-2985 - 2023
- [j6]Mohammad Matin Najafi, Chenhao Ma, Xiaodong Li, Reynold Cheng, Laks V. S. Lakshmanan:
MOSER: Scalable Network Motif Discovery using Serial Test. Proc. VLDB Endow. 17(3): 591-603 (2023) - 2022
- [j5]Reynold Cheng
The Social Technology and Research (STAR) Lab in the University of Hong Kong. SIGMOD Rec. 51(2): 63-68 (2022) - [c4]Xiaolin Han, Reynold Cheng
Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks. SDM 2022: 64-72 - 2021
- [j4]Xiaodong Li, Reynold Cheng
On Analyzing Graphs with Motif-Paths. Proc. VLDB Endow. 14(6): 1111-1123 (2021) - 2020
- [c3]Xiaodong Li, Reynold Cheng, Matin Najafi, Kevin Chen-Chuan Chang, Xiaolin Han, Hongtai Cao:
M-Cypher: A GQL Framework Supporting Motifs. CIKM 2020: 3433-3436 - [c2]Xiaolin Han, Tobias Grubenmann, Reynold Cheng, Sze Chun Wong, Xiaodong Li, Wenya Sun:
Traffic Incident Detection: A Trajectory-based Approach. ICDE 2020: 1866-1869
2010 – 2019
- 2019
- [j3]Chenhao Ma
LINC: A Motif Counting Algorithm for Uncertain Graphs. Proc. VLDB Endow. 13(2): 155-168 (2019) - [j2]Yixiang Fang
On Spatial-Aware Community Search. IEEE Trans. Knowl. Data Eng. 31(4): 783-798 (2019) - 2018
- [c1]Xiaodong Li, Reynold Cheng, Yixiang Fang, Jiafeng Hu, Silviu Maniu
Scalable Evaluation of k-NN Queries on Large Uncertain Graphs. EDBT 2018: 181-192 - 2017
- [j1]Yixiang Fang
Effective Community Search over Large Spatial Graphs. Proc. VLDB Endow. 10(6): 709-720 (2017)
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-10 20:47 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: