WENQIAN.ZHANG — BASH — 80x24

  ██╗    ██╗███████╗███╗   ██╗ ██████╗ ██╗ █████╗ ███╗   ██╗
  ██║    ██║██╔════╝████╗  ██║██╔═══██╗██║██╔══██╗████╗  ██║
  ██║ █╗ ██║█████╗  ██╔██╗ ██║██║   ██║██║███████║██╔██╗ ██║
  ██║███╗██║██╔══╝  ██║╚██╗██║██║   ██║██║██╔══██║██║╚██╗██║
  ╚███╔███╔╝███████╗██║ ╚████║╚██████╔╝██║██║  ██║██║ ╚████║
   ╚══╝╚══╝ ╚══════╝╚═╝  ╚═══╝ ╚═════╝ ╚═╝╚═╝  ╚═╝╚═╝  ╚═══╝
[ SCROLL ]
0x

Efficiency

0x

Memory ↓

0+

Students

0

Papers

[ Projects ]

Billion-Scale Hypergraph Engine

C++ · Rust · Spark

High-performance in-memory engine for core decomposition on hypergraphs with 10^9+ hyperedges.

Distributed Graph Analytics

Kubernetes · Flink · Java

Cloud-native deployment of graph algorithms with auto-scaling and fault tolerance.

[ Research Focus ]

Core Decomposition

Scalable algorithms for k-core and nucleus decomposition in billion-scale graphs.

Click to learn more →

Hypergraph Analytics

Efficient computation on high-order relational structures.

Click to learn more →

Distributed Systems

Spark/Flink deployment, Kubernetes orchestration for graph workloads.

Click to learn more →

[ Beyond Academia ]

Coffee-powered debugging

🎵

Lo-fi beats while writing

🎮

Strategic games enthusiast

🎹

Piano performance — just nailed my last piece

[ Get in Touch ]

Interested in collaboration, research discussions, or just saying hi?

[ About & Education ]

Sep 2025 - Present

Ph.D. in Computer Science

UNSW (University of New South Wales)

Topic: Efficient Algorithms for Large-scale Graph Analysis.

Faculty Scholarship, Top 2 Most Welcoming Demonstration
Sep 2023 - Aug 2025

MPhil in Computer Science

UNSW

Thesis: Scalable Core Decomposition in Large Networks.

Postdoctoral Writing Fellowship
Sep 2020 - Aug 2023

B.Sc. in Computer Science

UNSW

Graduated with Distinction.

Dean's List 2022

[ Publications ]

Accepted - SIGMOD 2025

Accelerating Core Decomposition in Billion-Scale Hypergraphs

First Author

Improved efficiency by 7x and reduced memory by 36x compared to state-of-the-art.

Published - ICDM Workshop 2023

Efficient Distributed Core Graph Decomposition

First Author

Optimized algorithms deployed on Spark/Flink via Kubernetes clusters.

Under Review - SIGMOD

Nucleus Decomposition Revisited: An Efficient Counting-Based Approach

Co-Author

Proposing a novel counting-based framework for dense subgraph discovery.

[ Technical Arsenal ]

Languages & Systems — C++/Rust for low-level performance.

Languages

C++LOW_LEVEL
95%
RustLOW_LEVEL
90%
Java
85%
Python
82%
SQL
88%

Systems & Tools

Apache SparkApache FlinkKubernetesDockerLinux

[ Teaching Experience ]

  • Database Systems (COMP3311/9311)Instructed 500+ students on SQL and Relational Algebra.
  • Data Analytics for Graphs (COMP9312)Taught advanced graph theory and algorithms.