Pan Peng (彭攀)

Cited by

	All	Since 2017
Citations	318	272
h-index	12	10
i10-index	12	10

2011201220132014201520162017201820192020202120221 16 9 3 10 7 19 37 52 44 66 49

Public access

View all

19 articles

3 articles

available

not available

Based on funding mandates

Co-authors

Christian SohlerProfessor for Algorithmic Data Analysis, University of CologneVerified email at uni-koeln.de
Monika HenzingerProfessor of Computer Science, University of ViennaVerified email at univie.ac.at
Gramoz GoranciUniversity of GlasgowVerified email at glasgow.ac.uk
Hendrik FichtenbergerGoogle ResearchVerified email at google.com
Artur CzumajProfessor of Computer Science, University of Warwick, UKVerified email at warwick.ac.uk
Jakob BossekRWTH Aachen UniversityVerified email at aim.rwth-aachen.de
Dirk SudholtUniversity of Passau, GermanyVerified email at uni-passau.de
Frank NeumannOptimisation and Logistics, School of ComputerVerified email at adelaide.edu.au
Zengfeng HuangFudan UniversityVerified email at fudan.edu.cn
Morteza MonemizadehAssistant Professor at Eindhoven University of Technology, the NetherlandsVerified email at tue.nl
Haiping Lu (吕海平)Senior Lecturer in Machine Learning, Department of Computer Science, University of SheffieldVerified email at sheffield.ac.uk
Yuichi YoshidaNational Institute of InformaticsVerified email at nii.ac.jp
Tamal K. DeyProfessor Computer Science, Purdue UniversityVerified email at purdue.edu
Anastasios SidiropoulosUniversity of Illinois at ChicagoVerified email at uic.edu
Jiapeng ZhangUniversity of Southern CaliforniaVerified email at usc.edu
Yan Ge (葛岩)University of BristolVerified email at bristol.ac.uk
Chandra Sekhar MukherjeeUniversity of Southern CaliforniaVerified email at usc.edu
He SunUniversity of EdinburghVerified email at ed.ac.uk
S MuthukrishnanRutgers UnivVerified email at cs.rutgers.edu

Pan Peng (彭攀)

University of Science and Technology of China

Verified email at ustc.edu.cn - Homepage

algorithms networks


Title Sort by citations Sort by year Sort by 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	35	2015
Improved Guarantees for Vertex Sparsification in Planar Graphs G Goranci, M Henzinger, P Peng SIAM Journal on Discrete Mathematics, 2020	29	2020
Estimating graph parameters from random order streams P Peng, C Sohler Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	21	2018
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	20	2016
The small-community phenomenon in networks A Li, P Peng Mathematical Structures in Computer Science 22 (3), 373-407, 2012	20	2012
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	19	2018
Dynamic graph stream algorithms in o (n) space Z Huang, P Peng Algorithmica 81 (5), 1965-1987, 2019	17	2019
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	17	2017
Community structures in classical network models A Li, P Peng Internet Mathematics 7 (2), 81-106, 2011	17	2011
The power of vertex sparsifiers in dynamic graph algorithms G Goranci, M Henzinger, P Peng 25th Annual European Symposium on Algorithms (ESA 2017), 2017	16	2017
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	13	2019
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	13	2019
Constant-Time Dynamic -Coloring M Henzinger, P Peng The 37th International Symposium on Theoretical Aspects of Computer Science …, 2020	8	2020
Testable properties in general graphs and random order streaming A Czumaj, H Fichtenberger, P Peng, C Sohler arXiv preprint arXiv:1905.01644, 2019	8	2019
Sampling arbitrary subgraphs exactly uniformly in sublinear time H Fichtenberger, M Gao, P Peng arXiv preprint arXiv:2005.01861, 2020	7	2020
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	7	2015
Testing Conductance in General Graphs. A Li, Y Pan, P Peng Electron. Colloquium Comput. Complex. 18, 101, 2011	7	2011
Mixed-order spectral clustering for complex networks Y Ge, P Peng, H Lu Pattern Recognition 117, 107964, 2021	6	2021
Average sensitivity of spectral clustering P Peng, Y Yoshida Proceedings of the 26th ACM SIGKDD International Conference on Knowledge …, 2020	6	2020
Spectral concentration and greedy k-clustering TK Dey, P Peng, A Rossi, A Sidiropoulos Computational Geometry 76, 19-32, 2019	4	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors