Fan Zhang

Orcid: 0000-0003-0548-0130

Affiliations:
  • Guangzhou University, China
  • University of New South Wales, Sydney, NSW, Australia (former)
  • University of Technology Sydney, CAI, NSW, Australia (PhD 2017)


According to our database1, Fan Zhang authored at least 43 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Influence Maximization via Vertex Countering.
Proc. VLDB Endow., February, 2024

Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution.
IEEE Trans. Knowl. Data Eng., January, 2024

2023
Adaptive Asynchronous Clustering Algorithms for Wireless Mesh Networks.
IEEE Trans. Knowl. Data Eng., March, 2023

Efficient m-closest entity matching over heterogeneous information networks.
Knowl. Based Syst., March, 2023

Influence Minimization via Blocking Strategies.
CoRR, 2023

GPUSCAN<sup>++</sup>: Eficient Structural Graph Clustering on GPUs.
CoRR, 2023

Quantifying Node Importance over Network Structural Stability.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Minimizing the Influence of Misinformation via Vertex Blocking.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

IMinimize: A System for Negative Influence Minimization via Vertex Blocking.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

2022
VEK: a vertex-oriented approach for edge k-core problem.
World Wide Web, 2022

Discovering key users for defending network structural stability.
World Wide Web, 2022

Anchored coreness: efficient reinforcement of social networks.
VLDB J., 2022

Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
Hierarchical Core Maintenance on Large Dynamic Graphs.
Proc. VLDB Endow., 2021

Discovering fortress-like cohesive subgraphs.
Knowl. Inf. Syst., 2021

Towards User Engagement Dynamics in Social Networks.
CoRR, 2021

Efficient Community Search with Size Constraint.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Truss Decomposition on Multilayer Graphs.
Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

2020
Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems.
IEEE Trans. Knowl. Data Eng., 2020

Global Reinforcement of Social Networks: The Anchored Coreness Problem.
Proceedings of the 2020 International Conference on Management of Data, 2020

Finding the Best k in Core Decomposition: A Time and Space Optimal Solution.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength.
Proceedings of the Database Systems for Advanced Applications, 2020

2019
Efficient community discovery with user engagement and similarity.
VLDB J., 2019

Efficient Progressive Minimum k-core Search.
Proc. VLDB Endow., 2019

Critical Edge Identification: A K-Truss Based Model.
CoRR, 2019

K-Core Maximization through Edge Additions.
CoRR, 2019

CoreCube: Core Decomposition in Multilayer Graphs.
Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

Pivotal Relationship Identification: The K-Truss Minimization Problem.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

K-Core Maximization: An Edge Addition Approach.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Hierarchical Decomposition of Big Graphs.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

Similarity Evaluation on Labeled Graphs via Hierarchical Core Decomposition.
Proceedings of the Big Data - 7th CCF Conference, 2019

2018
Efficiently Reinforcing Social Networks over User Engagement and Tie Strength.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Discovering Strong Communities with User Engagement and Tie Strength.
Proceedings of the Database Systems for Advanced Applications, 2018

External Topological Sorting in Large Graphs.
Proceedings of the Database Systems for Advanced Applications, 2018

Towards Efficient Path Skyline Computation in Bicriteria Networks.
Proceedings of the Database Systems for Advanced Applications, 2018

Finding Maximal Stable Cores in Social Networks.
Proceedings of the Databases Theory and Applications, 2018

2017
Cohesive subgraph mining on social networks
PhD thesis, 2017

OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks.
Proc. VLDB Endow., 2017

When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks.
Proc. VLDB Endow., 2017

Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017


  Loading...