Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPan Peng 0001
Person information
- unicode name: 彭攀
- affiliation: University of Science and Technology of China, China
- affiliation (former): University of Sheffield, Department of Computer Science, UK
- affiliation (2016 - 2018): University of Vienna, Austria
- affiliation (2013 - 2016): TU Dortmund, Germany
- affiliation (PhD 2013): Chinese Academy of Sciences, Institute of Software, State Key Laboratory of Computer Science, Beijing, China
- not to be confused with: Pan Peng 0002
Other persons with the same name
- Pan Peng 0002 — Shanghai Institute of Satellite Engineering
- Pan Peng 0003 — Chongqing University, State Key Laboratory of Power Transmission Equipment and System Security and New Technology, China
- Pan Peng 0004 — University of Science and Technology of China, Hefei, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]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): 825-883 (2024)- [c34]Stefan Neumann, Yinhao Dong, Pan Peng:
Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. WWW 2024: 2563-2571 - [i35]Weiqiang He, Hendrik Fichtenberger, Pan Peng:
A Differentially Private Clustering Algorithm for Well-Clustered Graphs. CoRR abs/2403.14332 (2024) - [i34]Stefan Neumann, Yinhao Dong, Pan Peng:
Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. CoRR abs/2404.16464 (2024) - 2023
- [c33]Dongrun Cai, Xue Chen, Pan Peng:
Effective Resistances in Non-Expander Graphs. ESA 2023: 29:1-29:18 - [c32]Zelin Li, Pan Peng, Xianbin Zhu:
Massively Parallel Algorithms for the Stochastic Block Model. ESA 2023: 78:1-78:17 - [c31]Pan Peng, Yuyang Wang:
An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs. ICALP 2023: 96:1-96:16 - [c30]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 - [c29]Pan Peng, Yuichi Yoshida:
Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders. SODA 2023: 4936-4965 - [i33]Isolde Adler, Noleen Köhler, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. CoRR abs/2304.03810 (2023) - [i32]Pan Peng, Yuyang Wang:
An Optimal Separation between Two Property Testing Models for Bounded Degree Directed Graphs. CoRR abs/2305.13089 (2023) - [i31]Zelin Li, Pan Peng, Xianbin Zhu:
Massively Parallel Algorithms for the Stochastic Block Model. CoRR abs/2307.00530 (2023) - [i30]Dongrun Cai, Xue Chen, Pan Peng:
Effective Resistances in Non-Expander Graphs. CoRR abs/2307.01218 (2023) - 2022
- [j10]Monika Henzinger, Pan Peng:
Constant-time Dynamic (Δ +1)-Coloring. ACM Trans. Algorithms 18(2): 16:1-16:21 (2022) - [c28]Stefan Neumann, Pan Peng:
Sublinear-Time Clustering Oracle for Signed Graphs. ICML 2022: 16496-16528 - [c27]Hendrik Fichtenberger, Pan Peng:
Approximately Counting Subgraphs in Data Streams. PODS 2022: 413-425 - [i29]Chandra Sekhar Mukherjee, Pan Peng, Jiapeng Zhang:
Recovering Unbalanced Communities in the Stochastic Block Model With Application to Clustering with a Faulty Oracle. CoRR abs/2202.08522 (2022) - [i28]Hendrik Fichtenberger, Pan Peng:
Approximately Counting Subgraphs in Data Streams. CoRR abs/2203.14225 (2022) - [i27]Stefan Neumann, Pan Peng:
Sublinear-Time Clustering Oracle for Signed Graphs. CoRR abs/2206.13813 (2022) - [i26]Pan Peng, Yuichi Yoshida:
Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders. CoRR abs/2210.12601 (2022) - 2021
- [j9]Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt:
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica 83(10): 3148-3179 (2021) - [j8]Monika Henzinger, Pan Peng:
Constant-time dynamic weight approximation for minimum spanning forest. Inf. Comput. 281: 104805 (2021) - [j7]Yan Ge, Pan Peng, Haiping Lu:
Mixed-order spectral clustering for complex networks. Pattern Recognit. 117: 107964 (2021) - [c26]Isolde Adler, Noleen Köhler, Pan Peng:
GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. CCC 2021: 34:1-34:27 - [c25]Pan Peng, Jiapeng Zhang:
Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. COLT 2021: 3662-3680 - [c24]Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci:
Local Algorithms for Estimating Effective Resistance. KDD 2021: 1329-1338 - [c23]Isolde Adler, Noleen Köhler, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs. SODA 2021: 1578-1597 - [i25]Isolde Adler, Noleen Köhler, Pan Peng:
GSF-locality is not sufficient for proximity-oblivious testing. CoRR abs/2105.08490 (2021) - [i24]Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt:
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. CoRR abs/2105.12525 (2021) - [i23]Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci:
Local Algorithms for Estimating Effective Resistance. CoRR abs/2106.03476 (2021) - [i22]Pan Peng, Jiapeng Zhang:
Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. CoRR abs/2106.10374 (2021) - 2020
- [j6]Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. SIAM J. Discret. Math. 34(1): 130-162 (2020) - [c22]Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Testable Properties in General Graphs and Random Order Streaming. APPROX-RANDOM 2020: 16:1-16:20 - [c21]Bogdan-Adrian Manghiuc, Pan Peng, He Sun:
Augmenting the Algebraic Connectivity of Graphs. ESA 2020: 70:1-70:22 - [c20]Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt:
More effective randomized search heuristics for graph coloring through dynamic optimization. GECCO 2020: 1277-1285 - [c19]Hendrik Fichtenberger, Mingze Gao, Pan Peng:
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. ICALP 2020: 45:1-45:13 - [c18]Pan Peng, Yuichi Yoshida:
Average Sensitivity of Spectral Clustering. KDD 2020: 1132-1140 - [c17]Pan Peng:
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. SODA 2020: 2953-2972 - [c16]Monika Henzinger, Pan Peng:
Constant-Time Dynamic (Δ+1)-Coloring. STACS 2020: 53:1-53:18 - [i21]Hendrik Fichtenberger, Mingze Gao, Pan Peng:
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. CoRR abs/2005.01861 (2020) - [i20]Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt:
More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization. CoRR abs/2005.13825 (2020) - [i19]Pan Peng, Yuichi Yoshida:
Average Sensitivity of Spectral Clustering. CoRR abs/2006.04094 (2020) - [i18]Bogdan-Adrian Manghiuc, Pan Peng, He Sun:
Augmenting the Algebraic Connectivity of Graphs. CoRR abs/2006.14449 (2020) - [i17]Isolde Adler, Noleen Köhler, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs. CoRR abs/2008.05800 (2020) - [i16]Monika Henzinger, Pan Peng:
Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest. CoRR abs/2011.00977 (2020)
2010 – 2019
- 2019
- [j5]Zengfeng Huang, Pan Peng:
Dynamic Graph Stream Algorithms in o(n) Space. Algorithmica 81(5): 1965-1987 (2019) - [j4]Tamal K. Dey, Pan Peng, Alfred Rossi, Anastasios Sidiropoulos:
Spectral concentration and greedy k-clustering. Comput. Geom. 76: 19-32 (2019) - [c15]Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt:
Runtime analysis of randomized search heuristics for dynamic graph coloring. GECCO 2019: 1443-1451 - [c14]Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. SODA 2019: 714-726 - [i15]Pan Peng:
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs. CoRR abs/1904.09710 (2019) - [i14]Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Testable Properties in General Graphs and Random Order Streaming. CoRR abs/1905.01644 (2019) - [i13]Monika Henzinger, Pan Peng:
Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing. CoRR abs/1907.04745 (2019) - 2018
- [c13]Gramoz Goranci, Monika Henzinger, Pan Peng:
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. ESA 2018: 40:1-40:15 - [c12]Pan Peng, Christian Sohler:
Estimating Graph Parameters from Random Order Streams. SODA 2018: 2449-2466 - [i12]Gramoz Goranci, Monika Henzinger, Pan Peng:
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. CoRR abs/1802.09111 (2018) - [i11]Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. CoRR abs/1811.02937 (2018) - [i10]Yan Ge, Haiping Lu, Pan Peng:
Mixed-Order Spectral Clustering for Networks. CoRR abs/1812.10140 (2018) - 2017
- [c11]Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. ESA 2017: 44:1-44:14 - [c10]Gramoz Goranci, Monika Henzinger, Pan Peng:
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. ESA 2017: 45:1-45:14 - [c9]Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler:
Testable Bounded Degree Graph Properties Are Random Order Streamable. ICALP 2017: 131:1-131:14 - [i9]Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. CoRR abs/1702.01136 (2017) - [i8]Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler:
Testable Bounded Degree Graph Properties Are Random Order Streamable. CoRR abs/1707.07334 (2017) - [i7]Pan Peng, Christian Sohler:
Estimating Graph Parameters from Random Order Streams. CoRR abs/1711.04881 (2017) - [i6]Gramoz Goranci, Monika Henzinger, Pan Peng:
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. CoRR abs/1712.06473 (2017) - 2016
- [c8]Zengfeng Huang, Pan Peng:
Dynamic Graph Stream Algorithms in o(n) Space. ICALP 2016: 18:1-18:16 - [c7]Artur Czumaj, Pan Peng, Christian Sohler:
Relating two property testing models for bounded degree directed graphs. STOC 2016: 1033-1045 - [i5]Zengfeng Huang, Pan Peng:
Dynamic Graph Stream Algorithms in $o(n)$ Space. CoRR abs/1605.00089 (2016) - 2015
- [c6]Hendrik Fichtenberger, Pan Peng, Christian Sohler:
On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs. APPROX-RANDOM 2015: 786-799 - [c5]Angsheng Li, Pan Peng:
Testing Small Set Expansion in General Graphs. STACS 2015: 622-635 - [c4]Artur Czumaj, Pan Peng, Christian Sohler:
Testing Cluster Structure of Graphs. STOC 2015: 723-732 - [i4]Artur Czumaj, Pan Peng, Christian Sohler:
Testing Cluster Structure of Graphs. CoRR abs/1504.03294 (2015) - 2014
- [j3]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): 1-20 (2014) - 2013
- [c3]Angsheng Li, Pan Peng:
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. ISAAC 2013: 655-665 - 2012
- [j2]Angsheng Li, Pan Peng:
The small-community phenomenon in networks. Math. Struct. Comput. Sci. 22(3): 373-407 (2012) - [c2]Pan Peng:
A Local Algorithm for Finding Dense Bipartite-Like Subgraphs. COCOON 2012: 145-156 - [c1]Pan Peng:
The Small Community Phenomenon in Networks: Models, Algorithms and Applications. TAMC 2012: 40-49 - [i3]Angsheng Li, Pan Peng:
Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure. CoRR abs/1209.5045 (2012) - [i2]Angsheng Li, Pan Peng:
Testing Small Set Expansion in General Graphs. CoRR abs/1209.5052 (2012) - 2011
- [j1]Angsheng Li, Pan Peng:
Community Structures in Classical Network Models. Internet Math. 7(2): 81-106 (2011) - [i1]Angsheng Li, Yicheng Pan, Pan Peng:
Testing Conductance in General Graphs. Electron. Colloquium Comput. Complex. TR11 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 23:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
