Xiaofan Li

Orcid: 0000-0003-4379-3277

Affiliations:
  • Swinburne University of Technology, School of Software and Electrical Engineering, Melbourne, VIC, Australia


According to our database1, Xiaofan Li authored at least 6 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Adversarial Mask Explainer for Graph Neural Networks.
Proceedings of the ACM on Web Conference 2024, 2024

2023
Quantum Algorithm for Maximum Biclique Problem.
CoRR, 2023

2022
One Set to Cover All Maximal Cliques Approximately.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021
Finding a Summary for All Maximal Cliques.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

2020
Efficiently Finding a Maximal Clique Summary via Effective Sampling.
CoRR, 2020

2019
Mining Maximal Clique Summary with Effective Sampling.
Proceedings of the 2019 IEEE International Conference on Data Mining, 2019


  Loading...