Pan Peng - RankMe

95 papers A* 22A 12B 1C 1Misc 1Journal 54Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Four-Cycle Counting in Low-Degeneracy Graph Streams. KDD (1) Sebastian Lüderssen, Stefan Neumann, Pan Peng
2026	J	`jnl`	Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs. CoRR Pan Peng, Yuyang Wang
2026	A*	`conf`	Near-Optimal Four-Cycle Counting in Graph Streams. SODA Sebastian Lüderssen, Stefan Neumann, Pan Peng
2026	J	`jnl`	Streaming algorithms for triangle counting: adversarial robustness and the weighted case. Frontiers Comput. Sci. Jing Cao, Yicheng Pan, Pan Peng
2025	J	`jnl`	Average Sensitivity of Hierarchical CoRR Shijie Li, Weiqiang He, Ruobing Bai, Pan Peng
2025	A*	`conf`	Average Sensitivity of Hierarchical k-Median Clustering. ICML Shijie Li, Weiqiang He, Ruobing Bai, Pan Peng
2025	A*	`conf`	Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts. COLT Pan Peng, Hangyu Xu
2025	J	`jnl`	Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts. CoRR Pan Peng, Hangyu Xu
2025	A	`conf`	Learning-Augmented Streaming Algorithms for Approximating MAX-CUT. ITCS Yinhao Dong, Pan Peng, Ali Vakilian
2025	J	`jnl`	Learning-Augmented Streaming Algorithms for Correlation Clustering. CoRR Yinhao Dong, Shan Jiang, Shi Li, Pan Peng
2025	J	`jnl`	Sublinear Algorithms for Estimating Single-Linkage Clustering Costs. CoRR Pan Peng, Christian Sohler, Yi Xu
2025	J	`jnl`	Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model. CoRR Weiming Feng, Zelin Li, Pan Peng
2025	—	`conf`	Testing Some First-Order Logic Properties on Sparse Graphs. COCOON (2) Pan Peng, Kefan Yu
2024	A*	`conf`	A Differentially Private Clustering Algorithm for Well-Clustered Graphs. ICLR Weiqiang He, Hendrik Fichtenberger, Pan Peng
2024	J	`jnl`	A Differentially Private Clustering Algorithm for Well-Clustered Graphs. CoRR Weiqiang He, Hendrik Fichtenberger, Pan Peng
2024	J	`jnl`	Learning-Augmented Streaming Algorithms for Approximating MAX-CUT. CoRR Yinhao Dong, Pan Peng, Ali Vakilian
2024	J	`jnl`	On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. SIAM J. Comput. Isolde Adler, Noleen Köhler, Pan Peng
2024	A*	`conf`	Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. WWW Stefan Neumann, Yinhao Dong, Pan Peng
2024	J	`jnl`	Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. CoRR Stefan Neumann, Yinhao Dong, Pan Peng
2023	A*	`conf`	An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs. ICALP Pan Peng, Yuyang Wang
2023	J	`jnl`	An Optimal Separation between Two Property Testing Models for Bounded Degree Directed Graphs. CoRR Pan Peng, Yuyang Wang
2023	A	`conf`	Effective Resistances in Non-Expander Graphs. ESA Dongrun Cai, Xue Chen, Pan Peng
2023	J	`jnl`	Effective Resistances in Non-Expander Graphs. CoRR Dongrun Cai, Xue Chen, Pan Peng
2023	A	`conf`	Massively Parallel Algorithms for the Stochastic Block Model. ESA Zelin Li, Pan Peng, Xianbin Zhu
2023	J	`jnl`	Massively Parallel Algorithms for the Stochastic Block Model. CoRR Zelin Li, Pan Peng, Xianbin Zhu
2023	J	`jnl`	On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. CoRR Isolde Adler, Noleen Köhler, Pan Peng
2023	A*	`conf`	Recovering Unbalanced Communities in the Stochastic Block Model with Application to Clustering with a Faulty Oracle. NeurIPS Chandra Sekhar Mukherjee, Pan Peng, Jiapeng Zhang
2023	A*	`conf`	Sublinear-Time Algorithms for Max Cut, Max E2Lin( SODA Pan Peng, Yuichi Yoshida
2022	A*	`conf`	Approximately Counting Subgraphs in Data Streams. PODS Hendrik Fichtenberger, Pan Peng
2022	J	`jnl`	Approximately Counting Subgraphs in Data Streams. CoRR Hendrik Fichtenberger, Pan Peng
2022	J	`jnl`	Constant-time Dynamic (Δ +1)-Coloring. ACM Trans. Algorithms Monika Henzinger, Pan Peng
2022	J	`jnl`	Recovering Unbalanced Communities in the Stochastic Block Model With Application to Clustering with a Faulty Oracle. CoRR Chandra Sekhar Mukherjee, Pan Peng, Jiapeng Zhang
2022	J	`jnl`	Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders. CoRR Pan Peng, Yuichi Yoshida
2022	A*	`conf`	Sublinear-Time Clustering Oracle for Signed Graphs. ICML Stefan Neumann, Pan Peng
2022	J	`jnl`	Sublinear-Time Clustering Oracle for Signed Graphs. CoRR Stefan Neumann, Pan Peng
2021	J	`jnl`	Constant-time dynamic weight approximation for minimum spanning forest. Inf. Comput. Monika Henzinger, Pan Peng
2021	A	`conf`	GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. CCC Isolde Adler, Noleen Köhler, Pan Peng
2021	J	`jnl`	GSF-locality is not sufficient for proximity-oblivious testing. CoRR Isolde Adler, Noleen Köhler, Pan Peng
2021	A*	`conf`	Local Algorithms for Estimating Effective Resistance. KDD Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci
2021	J	`jnl`	Local Algorithms for Estimating Effective Resistance. CoRR Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci
2021	J	`jnl`	Mixed-order spectral clustering for complex networks. Pattern Recognit. Yan Ge, Pan Peng, Haiping Lu
2021	A*	`conf`	On Testability of First-Order Properties in Bounded-Degree Graphs. SODA Isolde Adler, Noleen Köhler, Pan Peng
2021	J	`jnl`	Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2021	J	`jnl`	Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. CoRR Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2021	A*	`conf`	Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. COLT Pan Peng, Jiapeng Zhang
2021	J	`jnl`	Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. CoRR Pan Peng, Jiapeng Zhang
2020	A	`conf`	Augmenting the Algebraic Connectivity of Graphs. ESA Bogdan-Adrian Manghiuc, Pan Peng, He Sun
2020	J	`jnl`	Augmenting the Algebraic Connectivity of Graphs. CoRR Bogdan-Adrian Manghiuc, Pan Peng, He Sun
2020	A*	`conf`	Average Sensitivity of Spectral Clustering. KDD Pan Peng, Yuichi Yoshida
2020	J	`jnl`	Average Sensitivity of Spectral Clustering. CoRR Pan Peng, Yuichi Yoshida
2020	A	`conf`	Constant-Time Dynamic (Δ+1)-Coloring. STACS Monika Henzinger, Pan Peng
2020	J	`jnl`	Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest. CoRR Monika Henzinger, Pan Peng
2020	J	`jnl`	Improved Guarantees for Vertex Sparsification in Planar Graphs. SIAM J. Discret. Math. Gramoz Goranci, Monika Henzinger, Pan Peng
2020	J	`jnl`	More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization. CoRR Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	A	`conf`	More effective randomized search heuristics for graph coloring through dynamic optimization. GECCO Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	J	`jnl`	On Testability of First-Order Properties in Bounded-Degree Graphs. CoRR Isolde Adler, Noleen Köhler, Pan Peng
2020	A*	`conf`	Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. SODA Pan Peng
2020	A*	`conf`	Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. ICALP Hendrik Fichtenberger, Mingze Gao, Pan Peng
2020	J	`jnl`	Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. CoRR Hendrik Fichtenberger, Mingze Gao, Pan Peng
2020	—	`conf`	Testable Properties in General Graphs and Random Order Streaming. APPROX-RANDOM Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler
2019	J	`jnl`	Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing. CoRR Monika Henzinger, Pan Peng
2019	J	`jnl`	Dynamic Graph Stream Algorithms in o(n) Space. Algorithmica Zengfeng Huang, Pan Peng
2019	A*	`conf`	Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. SODA Hendrik Fichtenberger, Pan Peng, Christian Sohler
2019	J	`jnl`	Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. CoRR Pan Peng
2019	A	`conf`	Runtime analysis of randomized search heuristics for dynamic graph coloring. GECCO Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2019	J	`jnl`	Spectral concentration and greedy Comput. Geom. Tamal K. Dey, Pan Peng, Alfred Rossi, Anastasios Sidiropoulos
2019	J	`jnl`	Testable Properties in General Graphs and Random Order Streaming. CoRR Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler
2018	A	`conf`	Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. ESA Gramoz Goranci, Monika Henzinger, Pan Peng
2018	J	`jnl`	Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. CoRR Gramoz Goranci, Monika Henzinger, Pan Peng
2018	A*	`conf`	Estimating Graph Parameters from Random Order Streams. SODA Pan Peng, Christian Sohler
2018	J	`jnl`	Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. CoRR Hendrik Fichtenberger, Pan Peng, Christian Sohler
2018	J	`jnl`	Mixed-Order Spectral Clustering for Networks. CoRR Yan Ge, Haiping Lu, Pan Peng
2017	J	`jnl`	Estimating Graph Parameters from Random Order Streams. CoRR Pan Peng, Christian Sohler
2017	A	`conf`	Improved Guarantees for Vertex Sparsification in Planar Graphs. ESA Gramoz Goranci, Monika Henzinger, Pan Peng
2017	J	`jnl`	Improved Guarantees for Vertex Sparsification in Planar Graphs. CoRR Gramoz Goranci, Monika Henzinger, Pan Peng
2017	A*	`conf`	Testable Bounded Degree Graph Properties Are Random Order Streamable. ICALP Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler
2017	J	`jnl`	Testable Bounded Degree Graph Properties Are Random Order Streamable. CoRR Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler
2017	A	`conf`	The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. ESA Gramoz Goranci, Monika Henzinger, Pan Peng
2017	J	`jnl`	The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. CoRR Gramoz Goranci, Monika Henzinger, Pan Peng
2016	J	`jnl`	Dynamic Graph Stream Algorithms in $o(n)$ Space. CoRR Zengfeng Huang, Pan Peng
2016	A*	`conf`	Dynamic Graph Stream Algorithms in o(n) Space. ICALP Zengfeng Huang, Pan Peng
2016	A*	`conf`	Relating two property testing models for bounded degree directed graphs. STOC Artur Czumaj, Pan Peng, Christian Sohler
2015	—	`conf`	On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs. APPROX-RANDOM Hendrik Fichtenberger, Pan Peng, Christian Sohler
2015	A*	`conf`	Testing Cluster Structure of Graphs. STOC Artur Czumaj, Pan Peng, Christian Sohler
2015	J	`jnl`	Testing Cluster Structure of Graphs. CoRR Artur Czumaj, Pan Peng, Christian Sohler
2015	A	`conf`	Testing Small Set Expansion in General Graphs. STACS Angsheng Li, Pan Peng
2014	J	`jnl`	Global core, and galaxy structure of networks. Sci. China Inf. Sci. Wei Zhang, Yicheng Pan, Pan Peng, Jiankou Li, Xuechen Li, Angsheng Li
2013	B	`conf`	Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. ISAAC Angsheng Li, Pan Peng
2012	Misc	`conf`	A Local Algorithm for Finding Dense Bipartite-Like Subgraphs. COCOON Pan Peng
2012	J	`jnl`	Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure CoRR Angsheng Li, Pan Peng
2012	J	`jnl`	Testing Small Set Expansion in General Graphs CoRR Angsheng Li, Pan Peng
2012	C	`conf`	The Small Community Phenomenon in Networks: Models, Algorithms and Applications. TAMC Pan Peng
2012	J	`jnl`	The small-community phenomenon in networks. Math. Struct. Comput. Sci. Angsheng Li, Pan Peng
2011	J	`jnl`	Community Structures in Classical Network Models. Internet Math. Angsheng Li, Pan Peng
2011	J	`jnl`	Testing Conductance in General Graphs. Electron. Colloquium Comput. Complex. Angsheng Li, Yicheng Pan, Pan Peng