Testing Conductance in General Graphs. - Angsheng Li; Yicheng Pan 001; Pan Peng 001 (Electron. Colloquium Comput. Complex., 2011)

Community Structures in Classical Network Models. - Angsheng Li; Pan Peng 001 (Internet Math., 2011)

A Local Algorithm for Finding Dense Bipartite-Like Subgraphs. - Pan Peng 001 (COCOON, 2012)

The Small Community Phenomenon in Networks: Models, Algorithms and Applications. - Pan Peng 001 (TAMC, 2012)

The small-community phenomenon in networks. - Angsheng Li; Pan Peng 001 (Math. Struct. Comput. Sci., 2012)

Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. - Angsheng Li; Pan Peng 001 (ISAAC, 2013)

Global core, and galaxy structure of networks. - Wei Zhang; Yicheng Pan 001; Pan Peng 001; Jiankou Li; Xuechen Li; Angsheng Li (Sci. China Inf. Sci., 2014)

On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs. - Hendrik Fichtenberger; Pan Peng 001; Christian Sohler (APPROX-RANDOM, 2015)

Testing Small Set Expansion in General Graphs. - Angsheng Li; Pan Peng 001 (STACS, 2015)

Testing Cluster Structure of Graphs. - Artur Czumaj; Pan Peng 001; Christian Sohler (STOC, 2015)

Relating two property testing models for bounded degree directed graphs. - Artur Czumaj; Pan Peng 001; Christian Sohler (STOC, 2016)

The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. - Gramoz Goranci; Monika Henzinger; Pan Peng 001 (ESA, 2017)

Testable Bounded Degree Graph Properties Are Random Order Streamable. - Morteza Monemizadeh; S. Muthukrishnan 001; Pan Peng 001; Christian Sohler (ICALP, 2017)

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. - Gramoz Goranci; Monika Henzinger; Pan Peng 001 (ESA, 2018)

Estimating Graph Parameters from Random Order Streams. - Pan Peng 001; Christian Sohler (SODA, 2018)

Mixed-Order Spectral Clustering for Networks. - Yan Ge; Haiping Lu; Pan Peng 001 (CoRR, 2018)

Runtime analysis of randomized search heuristics for dynamic graph coloring. - Jakob Bossek; Frank Neumann 001; Pan Peng 001; Dirk Sudholt (GECCO, 2019)

Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. - Hendrik Fichtenberger; Pan Peng 001; Christian Sohler (SODA, 2019)

Dynamic Graph Stream Algorithms in o(n) Space. - Zengfeng Huang; Pan Peng 001 (Algorithmica, 2019)

Spectral concentration and greedy k-clustering. - Tamal K. Dey; Pan Peng 001; Alfred Rossi; Anastasios Sidiropoulos (Comput. Geom., 2019)

Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing. - Monika Henzinger; Pan Peng 001 (CoRR, 2019)

Testable Properties in General Graphs and Random Order Streaming. - Artur Czumaj; Hendrik Fichtenberger; Pan Peng 001; Christian Sohler (APPROX-RANDOM, 2020)

Augmenting the Algebraic Connectivity of Graphs. - Bogdan-Adrian Manghiuc; Pan Peng 001; He Sun 001 (ESA, 2020)

More effective randomized search heuristics for graph coloring through dynamic optimization. - Jakob Bossek; Frank Neumann 001; Pan Peng 001; Dirk Sudholt (GECCO, 2020)

Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. - Hendrik Fichtenberger; Mingze Gao; Pan Peng 001 (ICALP, 2020)

Average Sensitivity of Spectral Clustering. - Pan Peng 001; Yuichi Yoshida (KDD, 2020)

Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. - Pan Peng 001 (SODA, 2020)

Improved Guarantees for Vertex Sparsification in Planar Graphs. - Gramoz Goranci; Monika Henzinger; Pan Peng 001 (SIAM J. Discret. Math., 2020)

GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. - Isolde Adler; Noleen Köhler; Pan Peng 001 (CCC, 2021)

Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. - Pan Peng 001; Jiapeng Zhang (COLT, 2021)

Local Algorithms for Estimating Effective Resistance. - Pan Peng 001; Daniel Lopatta; Yuichi Yoshida; Gramoz Goranci (KDD, 2021)

On Testability of First-Order Properties in Bounded-Degree Graphs. - Isolde Adler; Noleen Köhler; Pan Peng 001 (SODA, 2021)

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. - Jakob Bossek; Frank Neumann 001; Pan Peng 001; Dirk Sudholt (Algorithmica, 2021)

Constant-time dynamic weight approximation for minimum spanning forest. - Monika Henzinger; Pan Peng 001 (Inf. Comput., 2021)

Mixed-order spectral clustering for complex networks. - Yan Ge; Pan Peng 001; Haiping Lu (Pattern Recognit., 2021)

Sublinear-Time Clustering Oracle for Signed Graphs. - Stefan Neumann 003; Pan Peng 001 (ICML, 2022)

Approximately Counting Subgraphs in Data Streams. - Hendrik Fichtenberger; Pan Peng 001 (PODS, 2022)

Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders. - Pan Peng 001; Yuichi Yoshida (CoRR, 2022)

Constant-time Dynamic (Δ +1)-Coloring. - Monika Henzinger; Pan Peng 001 (ACM Trans. Algorithms, 2022)

Effective Resistances in Non-Expander Graphs. - Dongrun Cai; Xue Chen; Pan Peng 001 (ESA, 2023)

Massively Parallel Algorithms for the Stochastic Block Model. - Zelin Li; Pan Peng 001; Xianbin Zhu 002 (ESA, 2023)

An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs. - Pan Peng 001; Yuyang Wang (ICALP, 2023)

Recovering Unbalanced Communities in the Stochastic Block Model with Application to Clustering with a Faulty Oracle. - Chandra Sekhar Mukherjee; Pan Peng 001; Jiapeng Zhang (NeurIPS, 2023)

Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders. - Pan Peng 001; Yuichi Yoshida (SODA, 2023)

A Differentially Private Clustering Algorithm for Well-Clustered Graphs. - Weiqiang He; Hendrik Fichtenberger; Pan Peng 001 (ICLR, 2024)

Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. - Stefan Neumann 003; Yinhao Dong; Pan Peng 001 (WWW, 2024)

On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. - Isolde Adler; Noleen Köhler; Pan Peng 001 (SIAM J. Comput., 2024)

Testing Some First-Order Logic Properties on Sparse Graphs. - Pan Peng 001; Kefan Yu (COCOON (2), 2025)

Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts. - Pan Peng 001; Hangyu Xu (COLT, 2025)

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT. - Yinhao Dong; Pan Peng 001; Ali Vakilian (ITCS, 2025)

Average Sensitivity of Hierarchical k-Median Clustering. - Shijie Li; Weiqiang He; Ruobing Bai; Pan Peng 001 (CoRR, 2025)