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 database¹, Fan Zhang authored at least 51 papers between 2004 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Discovering and Maintaining the Best $k$k in Core Decomposition.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., November, 2024

Efficient Regular Simple Path Queries under Transitive Restricted Expressions.

[BibT_eX]

[DOI]

Proc. VLDB Endow., March, 2024

Influence Maximization via Vertex Countering.

[BibT_eX]

[DOI]

Proc. VLDB Endow., February, 2024

Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., January, 2024

Graph Summarization: Compactness Meets Efficiency.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2024

Optimizing Network Resilience via Vertex Anchoring.

[BibT_eX]

[DOI]

Proceedings of the ACM on Web Conference 2024, 2024

EntropyStop: Unsupervised Deep Outlier Detection with Loss Entropy.

[BibT_eX]

[DOI]

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

2023

Adaptive Asynchronous Clustering Algorithms for Wireless Mesh Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., March, 2023

Efficient m-closest entity matching over heterogeneous information networks.

[BibT_eX]

[DOI]

Knowl. Based Syst., March, 2023

Influence Minimization via Blocking Strategies.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

Quantifying Node Importance over Network Structural Stability.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Unsupervised Graph Outlier Detection: Problem Revisit, New Insight, and Superior Method.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Minimizing the Influence of Misinformation via Vertex Blocking.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

IMinimize: A System for Negative Influence Minimization via Vertex Blocking.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

2022

VEK: a vertex-oriented approach for edge k-core problem.

[BibT_eX]

[DOI]

World Wide Web, 2022

Discovering key users for defending network structural stability.

[BibT_eX]

[DOI]

World Wide Web, 2022

Anchored coreness: efficient reinforcement of social networks.

[BibT_eX]

[DOI]

VLDB J., 2022

Are we really making much progress in unsupervised graph outlier detection? Revisiting the problem with new insight and superior method.

[BibT_eX]

[DOI]

CoRR, 2022

Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021

Hierarchical Core Maintenance on Large Dynamic Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Discovering fortress-like cohesive subgraphs.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2021

Towards User Engagement Dynamics in Social Networks.

[BibT_eX]

[DOI]

CoRR, 2021

Efficient Community Search with Size Constraint.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Truss Decomposition on Multilayer Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

Global Reinforcement of Social Networks: The Anchored Coreness Problem.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

Finding the Best k in Core Decomposition: A Time and Space Optimal Solution.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2020

2019

Efficient community discovery with user engagement and similarity.

[BibT_eX]

[DOI]

VLDB J., 2019

Efficient Progressive Minimum k-core Search.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Critical Edge Identification: A K-Truss Based Model.

[BibT_eX]

[DOI]

CoRR, 2019

K-Core Maximization through Edge Additions.

[BibT_eX]

[DOI]

CoRR, 2019

CoreCube: Core Decomposition in Multilayer Graphs.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

Pivotal Relationship Identification: The K-Truss Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

K-Core Maximization: An Edge Addition Approach.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Hierarchical Decomposition of Big Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

Similarity Evaluation on Labeled Graphs via Hierarchical Core Decomposition.

[BibT_eX]

[DOI]

Deming Chu

Fan Zhang

Jingjing Lin

Proceedings of the Big Data - 7th CCF Conference, 2019

2018

Efficiently Reinforcing Social Networks over User Engagement and Tie Strength.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Discovering Strong Communities with User Engagement and Tie Strength.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

External Topological Sorting in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

Towards Efficient Path Skyline Computation in Bicriteria Networks.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

Finding Maximal Stable Cores in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2018

2017

Cohesive subgraph mining on social networks

[BibT_eX]

[DOI]

Fan Zhang

PhD thesis, 2017

OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

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

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2004

Research on combined framework and measurement design of parallel kinematic machines (PKM) digital prototyping.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Systems, 2004

Fan Zhang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...