default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaofan Li 0004
Person information
- affiliation: Nanjing University, School of Computer Science, China
- affiliation (former): Nanyang Technological University, College of Computing and Data Science, Singapore
- affiliation (former): Swinburne University of Technology, School of Software and Electrical Engineering, Melbourne, VIC, Australia
Other persons with the same name
- Xiaofan Li — disambiguation page
- Xiaofan Li 0001
![[0000-0002-6687-5569]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-6687-5569")
— Jinan University, School of Intelligent Systems Science and Engineering, Zhuhai, China (and 4 more) - Xiaofan Li 0002 — Yancheng Institute of Technology, School of Electrical Engineering, Yancheng, China (and 1 more)
- Xiaofan Li 0003 — Illinois Institute of Technology, Department of Applied Mathematics, Chicago, IL, USA (and 1 more)
- Xiaofan Li 0005 (aka: XiaoFan Li 0005) — Chinese Academy of Sciences, Shenyang Institute of Automation, Shenyang, China
- Xiaofan Li 0006 — Virginia Tech, Bradley Department of Electrical and Computer Engineering, Blacksburg, VA, USA
- Xiaofan Li 0007 — University of Texas at Austin, McCombs School of Business, TX, USA
- Xiaofan Li 0008 — East China Normal University (ECNU), Shanghai, China
- Xiaofan Li 0009 — University of Delaware, Newark, DE, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c7]Xiaofan Li, Rui Zhou, Lu Chen, Chengfei Liu:
Clique Comparator: A Fundamental Operator for Finding a Concise Clique Summary. ICDE 2025: 3248-3260- [c6]Xintong Yu, Rui Zhou, Xiaofan Li, Lu Chen, Chengfei Liu:
Finding a Summary for All Maximal Bicliques. ICDE 2025: 3984-3997 - [e1]Siuly Siuly, Chunxiao Xing, Xiaofan Li, Rui Zhou:
Health Information Science - 13th International Conference, HIS 2024, Hong Kong, China, December 8-10, 2024, Proceedings. Lecture Notes in Computer Science 15336, Springer 2025, ISBN 978-981-96-5596-0 [contents] - [i3]Xiaofan Li, Gao Cong, Rui Zhou:
Gate-Based and Annealing-Based Quantum Algorithms for the Maximum K-Plex Problem. CoRR abs/2509.19214 (2025) - 2024
- [c5]Xiaofan Li, Gao Cong, Rui Zhou:
Quantum Algorithms for the Maximum K-Plex Problem. ICDE 2024: 2435-2448 - [c4]Wei Zhang, Xiaofan Li, Wolfgang Nejdl:
Adversarial Mask Explainer for Graph Neural Networks. WWW 2024: 861-869 - 2023
- [i2]Xiaofan Li, Prasenjit Mitra, Rui Zhou, Wolfgang Nejdl:
Quantum Algorithm for Maximum Biclique Problem. CoRR abs/2309.04503 (2023) - 2022
- [c3]Xiaofan Li, Rui Zhou, Lu Chen, Chengfei Liu, Qiang He, Yun Yang:
One Set to Cover All Maximal Cliques Approximately. SIGMOD Conference 2022: 2006-2019 - 2021
- [c2]Xiaofan Li, Rui Zhou, Lu Chen, Yong Zhang, Chengfei Liu, Qiang He, Yun Yang:
Finding a Summary for All Maximal Cliques. ICDE 2021: 1344-1355 - 2020
- [i1]Xiaofan Li, Rui Zhou, Lu Chen, Chengfei Liu, Qiang He, Yun Yang:
Efficiently Finding a Maximal Clique Summary via Effective Sampling. CoRR abs/2009.10376 (2020)
2010 – 2019
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 2026-03-03 23:21 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:
