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

D-Index & Metrics

Computer Science

D-Index
81
Citations
24810
World Ranking
1031
National Ranking
147

Research.com Recognitions

  • 2025 - Research.com Computer Science in Australia Leader Award
  • 2023 - Research.com Computer Science in Australia Leader Award
  • 2022 - Research.com Computer Science in Australia Leader Award
  • 2016 - IEEE Fellow For contributions to algorithmic paradigms for database technology

Overview

Xuemin Lin is affiliated with the University of New South Wales in Australia. Their primary field of study is Computer Science, with a total of 470 publications. Within this domain, they focus on several subfields including Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition, Statistical and Nonlinear Physics, and Signal Processing.

Their research topics cover a variety of areas, with notable emphasis on:

  • Complex Network Analysis Techniques
  • Advanced Graph Neural Networks
  • Graph Theory and Algorithms
  • Data Management and Algorithms
  • Caching and Content Delivery
  • Advanced Database Systems and Queries
  • Advanced Graph Theory Research

Xuemin Lin has published extensively. Some recent notable papers include:

  • Effective and efficient community search over large heterogeneous information networks, 2020, Proceedings of the VLDB Endowment
  • Maximum biclique search at billion scale, 2020, Proceedings of the VLDB Endowment
  • Efficient (α, β)-core computation in bipartite graphs, 2020, The VLDB Journal
  • Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees, 2020, Proceedings of the VLDB Endowment
  • Answering billion-scale label-constrained reachability queries within microsecond, 2020, Proceedings of the VLDB Endowment

The frequent co-authors collaborating with Xuemin Lin include:

  • Wenjie Zhang
  • Ying Zhang
  • Lu Qin
  • Kai Wang
  • Peng Cheng

The scientist's work appears primarily in several publication venues, among which the most frequent are:

  • arXiv (Cornell University)
  • Proceedings of the VLDB Endowment
  • IEEE Transactions on Knowledge and Data Engineering
  • The VLDB Journal
  • 2022 IEEE 38th International Conference on Data Engineering (ICDE)

Xuemin Lin has authored book publications through established publishers such as Springer Nature and Springer Science+Business Media. Their book titles include:

  • Cohesive Subgraph Search Over Large Heterogeneous Information Networks, 2022
  • Web Information Systems and Applications, 2020

Among notable recognitions, Xuemin Lin was named an IEEE Fellow in 2016 for contributions to algorithmic paradigms for database technology.

Best Publications

  • 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

  • Probabilistic skylines on uncertain data

    Jian Pei;Bin Jiang;Xuemin Lin;Yidong Yuan

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

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

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

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

  • Selecting Stars: The k Most Representative Skyline Operator

    Xuemin Lin;Yidong Yuan;Qing Zhang;Ying Zhang

  • Spark: top-k keyword query in relational databases

    Yi Luo;Xuemin Lin;Wei Wang;Xiaofang Zhou

  • Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement

    Wen Li;Ying Zhang;Yifang Sun;Wei Wang

  • Efficient computation of the skyline cube

    Yidong Yuan;Xuemin Lin;Qing Liu;Wei Wang

  • Stabbing the sky: efficient skyline computation over sliding windows

    Xuemin Lin;Yidong Yuan;Wei Wang;Hongjun Lu

  • Multiview Spectral Clustering via Structured Low-Rank Matrix Factorization

    Yang Wang;Lin Wu;Xuemin Lin;Junbin Gao

  • Ranking queries on uncertain data: a probabilistic threshold approach

    Ming Hua;Jian Pei;Wenjie Zhang;Xuemin Lin

  • Efficient Subgraph Matching by Postponing Cartesian Products

    Fei Bi;Lijun Chang;Xuemin Lin;Lu Qin

  • A fast and effective heuristic for the feedback arc set problem

    Peter Eades;Xuemin Lin;W. F. Smyth;W. F. Smyth

  • Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search

    Chengyuan Zhang;Ying Zhang;Wenjie Zhang;Xuemin Lin

  • A survey of community search over big graphs

    Yixiang Fang;Xin Huang;Lu Qin;Ying Zhang

  • Ed-Join: an efficient algorithm for similarity joins with edit distance constraints

    Chuan Xiao;Wei Wang;Xuemin Lin

  • Unsupervised Metric Fusion Over Multiview Data by Graph Random Walk-Based Cross-View Diffusion

    Yang Wang;Wenjie Zhang;Lin Wu;Xuemin Lin

  • Robust Subspace Clustering for Multi-View Data by Exploiting Correlation Consensus

    Yang Wang;Xuemin Lin;Lin Wu;Wenjie Zhang

  • Top-k Set Similarity Joins

    Chuan Xiao;Wei Wang;Xuemin Lin;Haichuan Shang

  • Distance-Based Representative Skyline

    Yufei Tao;Ling Ding;Xuemin Lin;Jian Pei

Frequent Co-Authors

Wenjie Zhang
Wenjie Zhang University of New South Wales
Ying Zhang
Ying Zhang University of Technology Sydney
Lu Qin
Lu Qin University of Technology Sydney
Lijun Chang
Lijun Chang University of Sydney
Jeffrey Xu Yu
Jeffrey Xu Yu Chinese University of Hong Kong
Jian Pei
Jian Pei Duke University
Xiaofang Zhou
Xiaofang Zhou Hong Kong University of Science and Technology
Peter Eades
Peter Eades University of Sydney
Maria E. Orlowska
Maria E. Orlowska Polish-Japanese Institute of Information Technology
Jingren Zhou
Jingren Zhou Alibaba Group (China)

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 computer science in the USA opens doors to a range of complementary degree options and diverse professional pathways. Many students also consider interdisciplinary routes, such as environmental science or engineering, which combine technology with real-world problem-solving.

Curious about a broader impact? Discover what can you do with an environmental science degree to see how analytical and technical skills can tackle environmental challenges. You can further broaden your career prospects by looking into online environmental engineering degree science and engineering options—ideal for those interested in sustainable solutions via remote learning.

For those seeking flexibility, an accelerated computer science degree online helps you quickly gain in-demand skills and enter the workforce faster. If you’re interested in the intersection of tech and industry, consider an online degree in mechanical engineering for opportunities in automation, robotics, and smart systems.

Each of these degree options expands your potential, offering flexible study and a vast array of future career paths.

Best Scientists Citing Xuemin Lin

Trending Scientists

Recently Published Articles