World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
34
Citations
4167
World Ranking
12275
National Ranking
374

Lijun Chang publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Lijun Chang sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 99 publications — 8th percentile

8% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Lijun Chang D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Lijun Chang sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 34 D-Index — 16th percentile

16% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Lijun Chang is affiliated with the University of Sydney in Australia, focusing primarily on research within the field of Computer Science.

Their work spans several subfields, including:

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Statistical and Nonlinear Physics

Chang's main topics of research cover multiple areas related to graph theory and algorithms and advanced computational methods. These include:

  • Graph Theory and Algorithms
  • Advanced Graph Neural Networks
  • Data Management and Algorithms
  • Complex Network Analysis Techniques
  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Machine Learning and Algorithms

The scientist has published extensively, with frequent contributions to several reputable venues. The top publication venues for Chang include:

  • Proceedings of the VLDB Endowment
  • IEEE Transactions on Knowledge and Data Engineering
  • The VLDB Journal
  • Proceedings of the ACM on Management of Data
  • Proceedings of the 2022 International Conference on Management of Data

Representative recent papers authored or coauthored by Lijun Chang include:

  • "Efficient maximum clique computation and enumeration over large sparse graphs" (2020), The VLDB Journal
  • "Efficient maximum k-plex computation over large sparse graphs" (2022), Proceedings of the VLDB Endowment

Other notable papers involving frequent collaborators include:

  • "Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees" (2020), Proceedings of the VLDB Endowment
  • "Efficient size-bounded community search over large networks" (2021), Proceedings of the VLDB Endowment
  • "Shortest-path queries on complex networks" (2022), Proceedings of the VLDB Endowment

Lijun Chang has collaborated with a range of researchers, with the most frequent coauthors being:

  • Lu Qin
  • Ying Zhang
  • Kai Yao
  • Xuemin Lin
  • Dong Wen

Best Publications

  • Efficient Subgraph Matching by Postponing Cartesian Products

    Fei Bi;Lijun Chang;Xuemin Lin;Lu Qin

  • Diversified top-k clique search

    Long Yuan;Lu Qin;Xuemin Lin;Lijun Chang

  • Keyword search in databases: the power of RDBMS

    Lu Qin;Jeffrey Xu Yu;Lijun Chang

  • Keyword Search in Relational Databases: A Survey.

    Jeffrey Xu Yu;Lu Qin;Lijun Chang

  • Querying Communities in Relational Databases

    Lu Qin;Jeffrey Xu Yu;Lijun Chang;Yufei Tao

  • Diversifying top-k results

    Lu Qin;Jeffrey Xu Yu;Lijun Chang

  • Efficiently computing k-edge connected components via graph decomposition

    Lijun Chang;Jeffrey Xu Yu;Lu Qin;Xuemin Lin

  • Index-Based Densest Clique Percolation Community Search in Networks

    Long Yuan;Lu Qin;Wenjie Zhang;Lijun Chang

  • Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme

    Miao Qiao;Hong Cheng;Lijun Chang;Jeffrey Xu Yu

  • Keyword Search in Databases

    Jeffrey Xu Yu;Lu Qin;Lijun Chang

  • When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks

    Dian Ouyang;Lu Qin;Lijun Chang;Xuemin Lin

  • Scalable distributed subgraph enumeration

    Longbin Lai;Lu Qin;Xuemin Lin;Ying Zhang

  • Scalable big graph processing in MapReduce

    Lu Qin;Jeffrey Xu Yu;Lijun Chang;Hong Cheng

  • Scalable subgraph enumeration in MapReduce

    Longbin Lai;Lu Qin;Xuemin Lin;Lijun Chang

  • Locally Densest Subgraph Discovery

    Lu Qin;Rong-Hua Li;Lijun Chang;Chengqi Zhang

  • pSCAN: Fast and exact structural graph clustering

    Lijun Chang;Wei Li;Xuemin Lin;Lu Qin

  • Fast Maximal Cliques Enumeration in Sparse Graphs

    Lijun Chang;Jeffrey Xu Yu;Lu Qin

  • The exact distance to destination in undirected world

    Lijun Chang;Jeffrey Xu Yu;Lu Qin;Hong Cheng

  • More is simpler: effectively and efficiently assessing node-pair similarities based on hyperlinks

    Weiren Yu;Xuemin Lin;Wenjie Zhang;Lijun Chang

  • Efficient Maximum Clique Computation over Large Sparse Graphs

    Lijun Chang

  • Scaling Distance Labeling on Small-World Networks

    Wentao Li;Miao Qiao;Lu Qin;Ying Zhang

Frequent Co-Authors

Lu Qin
Lu Qin University of Technology Sydney
Xuemin Lin
Xuemin Lin Shanghai Jiao Tong University
Jeffrey Xu Yu
Jeffrey Xu Yu Chinese University of Hong Kong
Wenjie Zhang
Wenjie Zhang University of New South Wales
Ying Zhang
Ying Zhang University of Technology Sydney
Hong Cheng
Hong Cheng Chinese University of Hong Kong
Jian Pei
Jian Pei Duke University
Yufei Tao
Yufei Tao Chinese University of Hong Kong
Chengqi Zhang
Chengqi Zhang Hong Kong Polytechnic University
Philip S. Yu
Philip S. Yu University of Illinois at Chicago

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

When considering a Computer Science degree in the USA, it's useful to explore other STEM fields that offer flexible, affordable online study options and diverse career outcomes. Many students interested in technology or engineering often look into the cheapest online mechanical engineering degree programs for a strong foundation in problem-solving and design.

Another popular option is earning your physics degree online, which is ideal for those who want a broad scientific background and critical thinking skills that can be applied to a wide range of industries, including tech and research.

For students interested in fields with high growth and earning potential, pursuing a data science degree online is an excellent choice. Data science combines programming, mathematics, and analytics to solve real-world problems—skills that are in high demand.

Lastly, if you are interested in electronics or hardware, researching the online electrical engineering career outcomes can provide insights into roles in energy, robotics, and technology development.

Best Scientists Citing Lijun Chang

Trending Scientists

Recently Published Articles