| 2026 | COCOON | Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model. | Weiming Feng, Zelin Li, Pan Peng |
| 2026 | COLT | An Exponential Lower Bound for Spectral Density Estimation on Unweighted Graphs. | Pan Peng, Yuyang Wang, Joy Qiping Yang, Yichun Yang |
| 2026 | ESA | Sublinear Algorithms for Estimating Single-Linkage Clustering Costs. | Pan Peng, Christian Sohler, Yi Xu |
| 2026 | ICALP | Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs. | Pan Peng, Yuyang Wang |
| 2026 | KDD | Four-Cycle Counting in Low-Degeneracy Graph Streams. | Sebastian Lderssen, Stefan Neumann, Pan Peng |
| 2026 | SODA | Near-Optimal Four-Cycle Counting in Graph Streams. | Sebastian Lderssen, Stefan Neumann, Pan Peng |
| 2025 | COCOON | Testing Some First-Order Logic Properties on Sparse Graphs. | Pan Peng, Kefan Yu |
| 2025 | COLT | Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts. | Pan Peng, Hangyu Xu |
| 2025 | ECAI | GCQ-ViT: Group-Aware Collaborative Post-Training Quantization for Vision Transformers. | Pan Peng, Wenbin Guo, Ping Wei, Wei Zhou |
| 2025 | ICML | Average Sensitivity of Hierarchical k-Median Clustering. | Shijie Li, Weiqiang He, Ruobing Bai, Pan Peng |
| 2024 | ICLR | A Differentially Private Clustering Algorithm for Well-Clustered Graphs. | Weiqiang He, Hendrik Fichtenberger, Pan Peng |
| 2024 | WWW | Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. | Stefan Neumann, Yinhao Dong, Pan Peng |
| 2023 | ESA | Effective Resistances in Non-Expander Graphs. | Dongrun Cai, Xue Chen, Pan Peng |
| 2023 | ESA | Massively Parallel Algorithms for the Stochastic Block Model. | Zelin Li, Pan Peng, Xianbin Zhu |
| 2023 | ICALP | An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs. | Pan Peng, Yuyang Wang |
| 2023 | SODA | Sublinear-Time Algorithms for Max Cut, Max E2Lin( | Pan Peng, Yuichi Yoshida |
| 2022 | ICML | Sublinear-Time Clustering Oracle for Signed Graphs. | Stefan Neumann, Pan Peng |
| 2022 | PODS | Approximately Counting Subgraphs in Data Streams. | Hendrik Fichtenberger, Pan Peng |
| 2021 | COLT | Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. | Pan Peng, Jiapeng Zhang |
| 2021 | KDD | Local Algorithms for Estimating Effective Resistance. | Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci |
| 2021 | SODA | On Testability of First-Order Properties in Bounded-Degree Graphs. | Isolde Adler, Noleen Khler, Pan Peng |
| 2020 | ESA | Augmenting the Algebraic Connectivity of Graphs. | Bogdan-Adrian Manghiuc, Pan Peng, He Sun |
| 2020 | GECCO | More effective randomized search heuristics for graph coloring through dynamic optimization. | Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt |
| 2020 | ICALP | Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. | Hendrik Fichtenberger, Mingze Gao, Pan Peng |
| 2020 | KDD | Average Sensitivity of Spectral Clustering. | Pan Peng, Yuichi Yoshida |
| 2020 | SODA | Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. | Pan Peng |
| 2020 | STACS | Constant-Time Dynamic (Δ+1)-Coloring. | Monika Henzinger, Pan Peng |
| 2019 | GECCO | Runtime analysis of randomized search heuristics for dynamic graph coloring. | Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt |
| 2019 | GECCO | Benchmarking the region learning-based JADE on noiseless functions. | Mingcheng Zuo, Guangming Dai, Lei Peng, Maocai Wang, Pan Peng, Changchun Chen |
| 2019 | GECCO | A new mutation operator with the ability to adjust exploration and exploitation for DE algorithm. | Mingcheng Zuo, Guangming Dai, Lei Peng, Maocai Wang, Pan Peng, Changchun Chen |
| 2019 | SODA | Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. | Hendrik Fichtenberger, Pan Peng, Christian Sohler |
| 2018 | ESA | Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. | Gramoz Goranci, Monika Henzinger, Pan Peng |
| 2018 | SODA | Estimating Graph Parameters from Random Order Streams. | Pan Peng, Christian Sohler |
| 2017 | ESA | Improved Guarantees for Vertex Sparsification in Planar Graphs. | Gramoz Goranci, Monika Henzinger, Pan Peng |
| 2017 | ESA | The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. | Gramoz Goranci, Monika Henzinger, Pan Peng |
| 2017 | ICALP | Testable Bounded Degree Graph Properties Are Random Order Streamable. | Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler |
| 2016 | ICALP | Dynamic Graph Stream Algorithms in o(n) Space. | Zengfeng Huang, Pan Peng |
| 2016 | STOC | Relating two property testing models for bounded degree directed graphs. | Artur Czumaj, Pan Peng, Christian Sohler |
| 2015 | STOC | Testing Cluster Structure of Graphs. | Artur Czumaj, Pan Peng, Christian Sohler |
| 2015 | STACS | Testing Small Set Expansion in General Graphs. | Angsheng Li, Pan Peng |
| 2013 | ISAAC | Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. | Angsheng Li, Pan Peng |
| 2012 | COCOON | A Local Algorithm for Finding Dense Bipartite-Like Subgraphs. | Pan Peng |
| 2012 | TAMC | The Small Community Phenomenon in Networks: Models, Algorithms and Applications. | Pan Peng |