Size and connectivity of the k-core of a random graph

Optimal construction of edge-disjoint paths in random graphs

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Almost all graphs with average degree 4 are 3-colorable

Journal of Computer and System Sciences - STOC 2002

The pure literal rule threshold and cores in random hypergraphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Survey: The cook-book approach to the differential equation method

Computer Science Review

Visual exploration of collaboration networks based on graph degeneracy

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining

Discovery of top-k dense subgraphs in dynamic graph collections

SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management

Streaming algorithms for k-core decomposition

Proceedings of the VLDB Endowment