You Peng

543 total citations
22 papers, 342 citations indexed

About

You Peng is a scholar working on Computer Vision and Pattern Recognition, Signal Processing and Computer Networks and Communications. According to data from OpenAlex, You Peng has authored 22 papers receiving a total of 342 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computer Vision and Pattern Recognition, 11 papers in Signal Processing and 10 papers in Computer Networks and Communications. Recurrent topics in You Peng's work include Data Management and Algorithms (10 papers), Graph Theory and Algorithms (9 papers) and Advanced Graph Theory Research (6 papers). You Peng is often cited by papers focused on Data Management and Algorithms (10 papers), Graph Theory and Algorithms (9 papers) and Advanced Graph Theory Research (6 papers). You Peng collaborates with scholars based in Australia, China and Hong Kong. You Peng's co-authors include Xuemin Lin, Ying Zhang, Wenjie Zhang, Lu Qin, Zhengping Qian, Jingren Zhou, Jingren Zhou, Shiyu Yang, Sibo Wang and Jeffrey Xu Yu and has published in prestigious journals such as Electronics Letters, Proceedings of the VLDB Endowment and The VLDB Journal.

In The Last Decade

You Peng

20 papers receiving 339 citations

Peers

You Peng
Can Lu Hong Kong
Zechao Shang United States
Shixuan Sun Singapore
Dong Wen Australia
Laxman Dhulipala United States
Longbin Lai Australia
Can Lu Hong Kong
You Peng
Citations per year, relative to You Peng You Peng (= 1×) peers Can Lu

Countries citing papers authored by You Peng

Since Specialization
Citations

This map shows the geographic impact of You Peng's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by You Peng with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites You Peng more than expected).

Fields of papers citing papers by You Peng

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by You Peng. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by You Peng. The network helps show where You Peng may publish in the future.

Co-authorship network of co-authors of You Peng

This figure shows the co-authorship network connecting the top 25 collaborators of You Peng. A scholar is included among the top collaborators of You Peng based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with You Peng. You Peng is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
2.
Shi, J. Y., et al.. (2024). Minimum Strongly Connected Subgraph Collection in Dynamic Graphs. Proceedings of the VLDB Endowment. 17(6). 1324–1336. 1 indexed citations
3.
Peng, You, Zhuo Ma, Wenjie Zhang, et al.. (2023). Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs. 856–868. 5 indexed citations
4.
Peng, You, Jeffrey Xu Yu, & Sibo Wang. (2023). PSPC: Efficient Parallel Shortest Path Counting on Large-Scale Graphs. 896–908. 2 indexed citations
5.
Chen, Xin, You Peng, Sibo Wang, & Jeffrey Xu Yu. (2022). DLCR. Proceedings of the VLDB Endowment. 15(8). 1645–1657. 12 indexed citations
6.
Peng, You, Peng Cheng, Han Li, et al.. (2022). Efficient $k-\text{clique}$ Listing with Set Intersection Speedup. 2022 IEEE 38th International Conference on Data Engineering (ICDE). 1955–1968. 6 indexed citations
7.
Peng, You, Song Bian, Rui Li, Sibo Wang, & Jeffrey Xu Yu. (2022). Finding Top-r Influential Communities under Aggregation Functions. 2022 IEEE 38th International Conference on Data Engineering (ICDE). 1941–1954. 2 indexed citations
8.
Peng, You, et al.. (2021). PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA. 1320–1331. 15 indexed citations
9.
Peng, You, Xuemin Lin, Ying Zhang, Wenjie Zhang, & Lu Qin. (2021). Answering reachability and K-reach queries on large graphs with label constraints. The VLDB Journal. 31(1). 101–127. 16 indexed citations
10.
Jin, Xin, Zhengyi Yang, Xuemin Lin, et al.. (2021). FAST: FPGA-based Subgraph Matching on Massive Graphs. 1452–1463. 17 indexed citations
11.
Peng, You, Xuemin Lin, Ying Zhang, et al.. (2021). Efficient Hop-constrained s-t Simple Path Enumeration. The VLDB Journal. 30(5). 799–823. 11 indexed citations
12.
Peng, You, Wenjie Zhao, Wenjie Zhang, Xuemin Lin, & Ying Zhang. (2021). DLQ. 112. 4764–4768. 7 indexed citations
13.
Peng, You, Wanling Deng, Weijing Wu, Zhi Luo, & Junkai Huang. (2020). Hybrid modelling routine for metal‐oxide TFTs based on particle swarm optimisation and artificial neural network. Electronics Letters. 56(9). 453–456. 7 indexed citations
14.
Peng, You, Ying Zhang, Xuemin Lin, Lu Qin, & Wenjie Zhang. (2020). Answering billion-scale label-constrained reachability queries within microsecond. Proceedings of the VLDB Endowment. 13(6). 812–825. 43 indexed citations
15.
Peng, You, Ying Zhang, Xuemin Lin, et al.. (2019). Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice.. Very Large Data Bases. 13. 463–476. 3 indexed citations
16.
Peng, You, et al.. (2019). Automated Music Making with Recurrent Neural Network. 183–188. 1 indexed citations
17.
Peng, You, Ying Zhang, Xuemin Lin, et al.. (2019). Towards bridging theory and practice. Proceedings of the VLDB Endowment. 13(4). 463–476. 34 indexed citations
18.
Qian, Zhengping, et al.. (2018). Real-time constrained cycle detection in large dynamic graphs. Proceedings of the VLDB Endowment. 11(12). 1876–1888. 108 indexed citations
19.
Peng, You, Ying Zhang, Wenjie Zhang, Xuemin Lin, & Lu Qin. (2018). Efficient Probabilistic K-Core Computation on Uncertain Graphs. 1192–1203. 44 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026