World's Best Scientists 2026 revealed!
Award Badge
Computer Science
China
2026

D-Index & Metrics

Computer Science

D-Index
89
Citations
27113
World Ranking
646
National Ranking
93

Research.com Recognitions

  • 2026 - Research.com Computer Science in China Leader Award
  • 2025 - Research.com Computer Science in China Leader Award
  • 2023 - Research.com Computer Science in China Leader Award
  • 2022 - Research.com Computer Science in China Leader Award

Overview

Jeffrey Xu Yu is affiliated with the Chinese University of Hong Kong in China. The primary field of study is Computer Science, with numerous publications spanning this domain. Their research covers multiple subfields including Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition, Signal Processing, and Statistical and Nonlinear Physics.

The research topics Jeffrey Xu Yu has focused on include Data Management and Algorithms, Complex Network Analysis Techniques, Advanced Graph Neural Networks, Graph Theory and Algorithms, Advanced Database Systems and Queries, Caching and Content Delivery, and Semantic Web and Ontologies.

Recent papers authored or co-authored by Jeffrey Xu Yu include:

  • "Target-aware Holistic Influence Maximization in Spatial Social Networks", 2020, IEEE Transactions on Knowledge and Data Engineering
  • "Efficient algorithms for budgeted influence maximization on massive social networks", 2020, Proceedings of the VLDB Endowment
  • "Ordering heuristics for k-clique listing", 2020, Proceedings of the VLDB Endowment
  • "DLCR", 2022, Proceedings of the VLDB Endowment
  • "Distributed subgraph counting", 2020, Proceedings of the VLDB Endowment

Frequent co-authors of Jeffrey Xu Yu include Kangfei Zhao, Yu Rong, Yuanyuan Zhu, Guoren Wang, and Hao Zhang.

The scientist has frequently published in venues such as arXiv (Cornell University), Proceedings of the VLDB Endowment, IEEE Transactions on Knowledge and Data Engineering, Proceedings of the ACM on Management of Data, and The VLDB Journal.

Jeffrey Xu Yu has also contributed to book publications, notably with Springer Science+Business Media, where three editions of "Database Systems for Advanced Applications" were published in 2020.

Best Publications

  • Graph clustering based on structural/attribute similarities

    Yang Zhou;Hong Cheng;Jeffrey Xu Yu

  • Efficient similarity joins for near-duplicate detection

    Chuan Xiao;Wei Wang;Xuemin Lin;Jeffrey Xu Yu

  • Efficient similarity joins for near duplicate detection

    Chuan Xiao;Wei Wang;Xuemin Lin;Jeffrey Xu Yu

  • Taming verification hardness: an efficient algorithm for testing subgraph isomorphism

    Haichuan Shang;Ying Zhang;Xuemin Lin;Jeffrey Xu Yu

  • Querying k-truss community in large and dynamic graphs

    Xin Huang;Hong Cheng;Lu Qin;Wentao Tian

  • Finding Top-k Min-Cost Connected Trees in Databases

    Bolin Ding;J. Xu Yu;Shan Wang;Lu Qin

  • Holistic twig joins on indexed XML documents

    Haifeng Jiang;Wei Wang;Hongjun Lu;Jeffrey Xu Yu

  • Efficient computation of the skyline cube

    Yidong Yuan;Xuemin Lin;Qing Liu;Wei Wang

  • Proceedings of the 24th ACM International on Conference on Information and Knowledge Management

    James Bailey;Alistair Moffat;Charu C. Aggarwal;Maarten de Rijke

  • Finding time-dependent shortest paths over large graphs

    Bolin Ding;Jeffrey Xu Yu;Lu Qin

  • Dual Labeling: Answering Graph Reachability Queries in Constant Time

    Haixun Wang;Hao He;Jun Yang;P.S. Yu

  • Natural language question answering over RDF: a graph data driven approach

    Lei Zou;Ruizhe Huang;Haixun Wang;Jeffrey Xu Yu

  • Graph indexing: tree + delta <= graph

    Peixiang Zhao;Jeffrey Xu Yu;Philip S. Yu

  • Text classification without negative examples revisit

    Gabriel Pui Cheong Fung;J.X. Yu;Hongjun Lu;P.S. Yu

  • Condensed cube: an effective approach to reducing data cube size

    Wei Wang;Jianlin Feng;Hongjun Lu;J.X. Yu

  • Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs

    Sen Hu;Lei Zou;Jeffrey Xu Yu;Haixun Wang

  • Influential community search in large networks

    Rong-Hua Li;Lu Qin;Jeffrey Xu Yu;Rui Mao

  • Clustering Large Attributed Graphs: An Efficient Incremental Approach

    Yang Zhou;Hong Cheng;Jeffrey Xu Yu

  • False positive or false negative: mining frequent itemsets from high speed transactional data streams

    Jeffery Xu Yu;Zhihong Chong;Hongjun Lu;Aoying Zhou

  • Approximate closest community search in networks

    Xin Huang;Laks V. S. Lakshmanan;Jeffrey Xu Yu;Hong Cheng

  • Fast Graph Pattern Matching

    Jiefeng Cheng;J.X. Yu;Bolin Ding;P.S. Yu

Frequent Co-Authors

Lu Qin
Lu Qin University of Technology Sydney
Xuemin Lin
Xuemin Lin Shanghai Jiao Tong University
Lijun Chang
Lijun Chang University of Sydney
Hongjun Lu
Hongjun Lu Hong Kong University of Science and Technology
Weifa Liang
Weifa Liang City University of Hong Kong
Lei Chen
Lei Chen Hong Kong University of Science and Technology
Yiping Ke
Yiping Ke Chinese University of Hong Kong
Aoying Zhou
Aoying Zhou East China Normal University
Philip S. Yu
Philip S. Yu University of Illinois at Chicago
Nan Tang
Nan Tang Hong Kong University of Science and Technology (Guangzhou)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online associate degree programs is an excellent starting point for students interested in computer science but seeking flexibility or a faster path into the workforce. These programs can help you build a foundational skill set and open entry-level opportunities in tech.

Cost is also a crucial consideration. Fortunately, there are numerous affordable online degree programs available to help you pursue your education without incurring substantial debt. Choosing an affordable option can make higher education more accessible and less stressful for students from all backgrounds.

If your academic record is a concern, consider online colleges that accept 2.0 gpa. Many respected institutions are committed to providing second chances and support for learners with a range of GPAs, helping you take the next step in your academic journey.

As you consider your future career, it’s worth exploring the breadth of opportunities in technology and related fields. For instance, learning what can you do with an environmental studies degree can illustrate how interdisciplinary skills in computer science and environmental science are increasingly valuable in the evolving job market.

Best Scientists Citing Jeffrey Xu Yu

Trending Scientists

Recently Published Articles