Ying Zhang

About Ying Zhang

Ying Zhang, With an exceptional h-index of 45 and a recent h-index of 37 (since 2020), a distinguished researcher at University of Technology, specializes in the field of big graph processing and analytics, similarity search, Spatial Database, DB2AI, AI2DB.

His recent articles reflect a diverse array of research interests and contributions to the field:

Scaling Up k-Clique Densest Subgraph Detection

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks

Cohesive Subgraph Discovery over Uncertain Bipartite Graphs

Efficient subhypergraph matching based on hyperedge features

Efficient processing of k-regret minimization queries with theoretical guarantees

On Scalable Computation of Graph Eccentricities

Neural Subgraph Counting with Wasserstein Estimator

Efficient shortest path counting on large road networks

Ying Zhang Information

University

Position

Professor School of Computer Science the (UTS)

Citations(all)

7430

Citations(since 2020)

4931

Cited By

3966

hIndex(all)

45

hIndex(since 2020)

37

i10Index(all)

127

i10Index(since 2020)

105

Email

University Profile Page

Google Scholar

Ying Zhang Skills & Research Interests

big graph processing and analytics

similarity search

Spatial Database

DB2AI

AI2DB

Top articles of Ying Zhang

Scaling Up k-Clique Densest Subgraph Detection

Proceedings of the ACM on Management of Data

2023/5/30

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks

The VLDB Journal

2023/11

Cohesive Subgraph Discovery over Uncertain Bipartite Graphs

IEEE Transactions on Knowledge and Data Engineering

2023/1/6

Efficient subhypergraph matching based on hyperedge features

IEEE Transactions on Knowledge and Data Engineering

2022/3/21

Efficient processing of k-regret minimization queries with theoretical guarantees

Information Sciences

2022/3/1

On Scalable Computation of Graph Eccentricities

2022/6/10

Efficient shortest path counting on large road networks

Proceedings of the VLDB Endowment

2022/1/1

Accelerated butterfly counting with vertex priority on bipartite graphs

The VLDB Journal

2022/5/16

Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching

2022/5/9

GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction

2022/5/9

Discovering hierarchy of bipartite graphs with cohesive subgraphs

2022/5/9

Efficient Computation of Cohesive Subgraphs in Uncertain Bipartite Graphs

2022/5/9

Efficient Reinforcement of Bipartite Networks at Billion Scale

2022/5/9

Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search

2022/5/9

TMN: Trajectory Matching Networks for Predicting Similarity

2022/5/9

Towards real-time counting shortest cycles on dynamic graphs: A hub labeling approach

2022/5/9

Discovering fortress-like cohesive subgraphs

Knowledge and Information Systems

2021/11/24

Span-reachability querying in large temporal graphs

The VLDB Journal

2021/11/23

See List of Professors in Ying Zhang University(University of Technology)

Co-Authors

academic-engine