Pan Peng

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 67

Top Topics

Bounded Treewidth

Cluster Structure

Top Venues

Publications

Stefan Neumann, Yinhao Dong, Pan Peng
Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. WWW (2024)
Weiqiang He, Hendrik Fichtenberger, Pan Peng
A Differentially Private Clustering Algorithm for Well-Clustered Graphs. CoRR (2024)
Isolde Adler, Noleen Köhler, Pan Peng
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. SIAM J. Comput. 53 (4) (2024)
Stefan Neumann, Yinhao Dong, Pan Peng
Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. CoRR (2024)
Weiqiang He, Hendrik Fichtenberger, Pan Peng
A Differentially Private Clustering Algorithm for Well-Clustered Graphs. ICLR (2024)
Chandra Sekhar Mukherjee, Pan Peng, Jiapeng Zhang
Recovering Unbalanced Communities in the Stochastic Block Model with Application to Clustering with a Faulty Oracle. NeurIPS (2023)
Isolde Adler, Noleen Köhler, Pan Peng
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. CoRR (2023)
Pan Peng, Yuichi Yoshida
), and Unique Label Cover on Expanders. SODA (2023)
Zelin Li, Pan Peng, Xianbin Zhu
Massively Parallel Algorithms for the Stochastic Block Model. ESA (2023)
Dongrun Cai, Xue Chen, Pan Peng
Effective Resistances in Non-Expander Graphs. CoRR (2023)
Dongrun Cai, Xue Chen, Pan Peng
Effective Resistances in Non-Expander Graphs. ESA (2023)
Zelin Li, Pan Peng, Xianbin Zhu
Massively Parallel Algorithms for the Stochastic Block Model. CoRR (2023)
Pan Peng, Yuyang Wang
An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs. ICALP (2023)
Monika Henzinger, Pan Peng
Constant-time Dynamic (Δ +1)-Coloring. ACM Trans. Algorithms 18 (2) (2022)
Hendrik Fichtenberger, Pan Peng
Approximately Counting Subgraphs in Data Streams. CoRR (2022)
Hendrik Fichtenberger, Pan Peng
Approximately Counting Subgraphs in Data Streams. PODS (2022)
Stefan Neumann, Pan Peng
Sublinear-Time Clustering Oracle for Signed Graphs. ICML (2022)
Stefan Neumann, Pan Peng
Sublinear-Time Clustering Oracle for Signed Graphs. CoRR (2022)
Chandra Sekhar Mukherjee, Pan Peng, Jiapeng Zhang
Recovering Unbalanced Communities in the Stochastic Block Model With Application to Clustering with a Faulty Oracle. CoRR (2022)
Pan Peng, Yuichi Yoshida
Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders. CoRR (2022)
Isolde Adler, Noleen Köhler, Pan Peng
GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. Computational Complexity Conference (2021)
Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci
Local Algorithms for Estimating Effective Resistance. CoRR (2021)
Pan Peng, Jiapeng Zhang
Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. COLT (2021)
Pan Peng, Jiapeng Zhang
Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. CoRR (2021)
Yan Ge, Pan Peng, Haiping Lu
Mixed-order spectral clustering for complex networks. Pattern Recognit. 117 (2021)
Isolde Adler, Noleen Köhler, Pan Peng
GSF-locality is not sufficient for proximity-oblivious testing. CoRR (2021)
Monika Henzinger, Pan Peng
Constant-time dynamic weight approximation for minimum spanning forest. Inf. Comput. 281 (2021)
Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica 83 (10) (2021)
Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. CoRR (2021)
Isolde Adler, Noleen Köhler, Pan Peng
On Testability of First-Order Properties in Bounded-Degree Graphs. SODA (2021)
Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci
Local Algorithms for Estimating Effective Resistance. KDD (2021)
Isolde Adler, Noleen Köhler, Pan Peng
On Testability of First-Order Properties in Bounded-Degree Graphs. CoRR (2020)
Monika Henzinger, Pan Peng
Constant-Time Dynamic (Δ+1)-Coloring. STACS (2020)
Pan Peng, Yuichi Yoshida
Average Sensitivity of Spectral Clustering. KDD (2020)
Gramoz Goranci, Monika Henzinger, Pan Peng
Improved Guarantees for Vertex Sparsification in Planar Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Hendrik Fichtenberger, Mingze Gao, Pan Peng
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. CoRR (2020)
Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization. CoRR (2020)
Hendrik Fichtenberger, Mingze Gao, Pan Peng
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. ICALP (2020)
Pan Peng
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. SODA (2020)
Bogdan-Adrian Manghiuc, Pan Peng, He Sun
Augmenting the Algebraic Connectivity of Graphs. ESA (2020)
Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
More effective randomized search heuristics for graph coloring through dynamic optimization. GECCO (2020)
Pan Peng, Yuichi Yoshida
Average Sensitivity of Spectral Clustering. CoRR (2020)
Monika Henzinger, Pan Peng
Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest. CoRR (2020)
Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler
Testable Properties in General Graphs and Random Order Streaming. APPROX-RANDOM (2020)
Bogdan-Adrian Manghiuc, Pan Peng, He Sun
Augmenting the Algebraic Connectivity of Graphs. CoRR (2020)
Tamal K. Dey, Pan Peng, Alfred Rossi, Anastasios Sidiropoulos
-clustering. Comput. Geom. 76 (2019)
Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
Runtime analysis of randomized search heuristics for dynamic graph coloring. GECCO (2019)
Pan Peng
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. CoRR (2019)
Zengfeng Huang, Pan Peng
Dynamic Graph Stream Algorithms in o(n) Space. Algorithmica 81 (5) (2019)
Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler
Testable Properties in General Graphs and Random Order Streaming. CoRR (2019)
Hendrik Fichtenberger, Pan Peng, Christian Sohler
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. SODA (2019)
Monika Henzinger, Pan Peng
Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing. CoRR (2019)
Yan Ge, Haiping Lu, Pan Peng
Mixed-Order Spectral Clustering for Networks. CoRR (2018)
Pan Peng, Christian Sohler
Estimating Graph Parameters from Random Order Streams. SODA (2018)
Hendrik Fichtenberger, Pan Peng, Christian Sohler
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. CoRR (2018)
Gramoz Goranci, Monika Henzinger, Pan Peng
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. CoRR (2018)
Gramoz Goranci, Monika Henzinger, Pan Peng
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. ESA (2018)
Gramoz Goranci, Monika Henzinger, Pan Peng
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. ESA (2017)
Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler
Testable Bounded Degree Graph Properties Are Random Order Streamable. ICALP (2017)
Gramoz Goranci, Monika Henzinger, Pan Peng
Improved Guarantees for Vertex Sparsification in Planar Graphs. ESA (2017)
Pan Peng, Christian Sohler
Estimating Graph Parameters from Random Order Streams. CoRR (2017)
Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler
Testable Bounded Degree Graph Properties Are Random Order Streamable. CoRR (2017)
Gramoz Goranci, Monika Henzinger, Pan Peng
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. CoRR (2017)
Gramoz Goranci, Monika Henzinger, Pan Peng
Improved Guarantees for Vertex Sparsification in Planar Graphs. CoRR (2017)
Artur Czumaj, Pan Peng, Christian Sohler
Relating two property testing models for bounded degree directed graphs. STOC (2016)
Zengfeng Huang, Pan Peng
Dynamic Graph Stream Algorithms in o(n) Space. ICALP (2016)
Zengfeng Huang, Pan Peng
Dynamic Graph Stream Algorithms in $o(n)$ Space. CoRR (2016)
Artur Czumaj, Pan Peng, Christian Sohler
Testing Cluster Structure of Graphs. STOC (2015)
Angsheng Li, Pan Peng
Testing Small Set Expansion in General Graphs. STACS (2015)
Artur Czumaj, Pan Peng, Christian Sohler
Testing Cluster Structure of Graphs. CoRR (2015)
Hendrik Fichtenberger, Pan Peng, Christian Sohler
On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs. APPROX-RANDOM (2015)
Wei Zhang, Yicheng Pan, Pan Peng, Jiankou Li, Xuechen Li, Angsheng Li
Global core, and galaxy structure of networks. Sci. China Inf. Sci. 57 (7) (2014)
Angsheng Li, Pan Peng
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. ISAAC (2013)
Angsheng Li, Pan Peng
The small-community phenomenon in networks. Math. Struct. Comput. Sci. 22 (3) (2012)
Angsheng Li, Pan Peng
Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure CoRR (2012)
Angsheng Li, Pan Peng
Testing Small Set Expansion in General Graphs CoRR (2012)
Pan Peng
The Small Community Phenomenon in Networks: Models, Algorithms and Applications. TAMC (2012)
Pan Peng
A Local Algorithm for Finding Dense Bipartite-Like Subgraphs. COCOON (2012)
Angsheng Li, Yicheng Pan, Pan Peng
Testing Conductance in General Graphs. Electron. Colloquium Comput. Complex. 18 (2011)
Angsheng Li, Pan Peng
Community Structures in Classical Network Models. Internet Math. 7 (2) (2011)