Pan Peng

According to our database1, Pan Peng authored at least 35 papers between 2011 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing.
CoRR, 2019

Testable Properties in General Graphs and Random Order Streaming.
CoRR, 2019

Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs.
CoRR, 2019

Spectral concentration and greedy k-clustering.
Comput. Geom., 2019

Dynamic Graph Stream Algorithms in o(n) Space.
Algorithmica, 2019

Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Runtime analysis of randomized search heuristics for dynamic graph coloring.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

2018
Mixed-Order Spectral Clustering for Networks.
CoRR, 2018

Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty.
CoRR, 2018

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.
CoRR, 2018

Estimating Graph Parameters from Random Order Streams.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.
CoRR, 2017

Estimating Graph Parameters from Random Order Streams.
CoRR, 2017

Testable Bounded Degree Graph Properties Are Random Order Streamable.
CoRR, 2017

Improved Guarantees for Vertex Sparsification in Planar Graphs.
CoRR, 2017

Testable Bounded Degree Graph Properties Are Random Order Streamable.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Improved Guarantees for Vertex Sparsification in Planar Graphs.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Dynamic Graph Stream Algorithms in $o(n)$ Space.
CoRR, 2016

Relating two property testing models for bounded degree directed graphs.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Dynamic Graph Stream Algorithms in o(n) Space.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Testing Cluster Structure of Graphs.
CoRR, 2015

Testing Cluster Structure of Graphs.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Testing Small Set Expansion in General Graphs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs.
Proceedings of the Approximation, 2015

2014
Global core, and galaxy structure of networks.
SCIENCE CHINA Information Sciences, 2014

2013
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
The small-community phenomenon in networks.
Mathematical Structures in Computer Science, 2012

Testing Small Set Expansion in General Graphs
CoRR, 2012

Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure
CoRR, 2012

The Small Community Phenomenon in Networks: Models, Algorithms and Applications.
Proceedings of the Theory and Applications of Models of Computation, 2012

A Local Algorithm for Finding Dense Bipartite-Like Subgraphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Community Structures in Classical Network Models.
Internet Mathematics, 2011

Testing Conductance in General Graphs.
Electronic Colloquium on Computational Complexity (ECCC), 2011


  Loading...