Pan Peng (彭攀)
Pan Peng (彭攀)
Verified email at sheffield.ac.uk - Homepage
Title
Cited by
Cited by
Year
Testing cluster structure of graphs
A Czumaj, P Peng, C Sohler
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
252015
Improved Guarantees for Vertex Sparsification in Planar Graphs
G Goranci, M Henzinger, P Peng
SIAM Journal on Discrete Mathematics, 2020
232020
The small-community phenomenon in networks
A Li, P Peng
arXiv preprint arXiv:1107.5786, 2011
202011
Relating two property testing models for bounded degree directed graphs
A Czumaj, P Peng, C Sohler
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
162016
Community structures in classical network models
A Li, P Peng
Internet Mathematics 7 (2), 81-106, 2011
162011
Dynamic effective resistances and approximate schur complement on separable graphs
G Goranci, M Henzinger, P Peng
Proceedings of the 26th European Symposium on Algorithms (ESA 2018), 2018
142018
The power of vertex sparsifiers in dynamic graph algorithms
G Goranci, M Henzinger, P Peng
25th Annual European Symposium on Algorithms (ESA 2017), 2017
132017
Dynamic Graph Stream Algorithms in o(n) Space
Z Huang, P Peng
Algorithmica 81 (5), 1965-1987, 2019
122019
Estimating graph parameters from random order streams
P Peng, C Sohler
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
82018
Testable bounded degree graph properties are random order streamable
M Monemizadeh, S Muthukrishnan, P Peng, C Sohler
44th International Colloquium on Automata, Languages, and Programming, ICALP …, 2017
72017
Testing Conductance in General Graphs.
A Li, Y Pan, P Peng
Electronic Colloquium on Computational Complexity (ECCC) 18 (101), 262, 2011
72011
Runtime analysis of randomized search heuristics for dynamic graph coloring
J Bossek, F Neumann, P Peng, D Sudholt
Proceedings of the Genetic and Evolutionary Computation Conference, 1443-1451, 2019
62019
Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty
H Fichtenberger, P Peng, C Sohler
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
52019
On constant-size graphs that preserve the local structure of high-girth graphs
H Fichtenberger, P Peng, C Sohler
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
52015
Testable properties in general graphs and random order streaming
A Czumaj, H Fichtenberger, P Peng, C Sohler
arXiv preprint arXiv:1905.01644, 2019
32019
Testing Small Set Expansion in General Graphs
A Li, P Peng
32nd International Symposium on Theoretical Aspects of Computer Science, 2015
32015
Average Sensitivity of Spectral Clustering
P Peng, Y Yoshida
arXiv preprint arXiv:2006.04094, 2020
22020
Spectral concentration and greedy k-clustering
TK Dey, P Peng, A Rossi, A Sidiropoulos
Computational Geometry 76, 19-32, 2019
22019
Detecting and characterizing small dense bipartite-like subgraphs by the bipartiteness ratio measure
A Li, P Peng
International Symposium on Algorithms and Computation, 655-665, 2013
22013
A local algorithm for finding dense bipartite-like subgraphs
P Peng
International Computing and Combinatorics Conference, 145-156, 2012
22012
The system can't perform the operation now. Try again later.
Articles 1–20