Differential Equations for Random Processes and Random Graphs von Wormald, Nicholas C.

Volltext

Analysis of greedy algorithms on graphs with bounded degrees von Wormald, Nicholas C.

Volltext

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations von Duckworth, William, Wormald, Nicholas C, Zito, Michele

Volltext

Random k-Sat: A Tight Threshold For Moderately Growing k von Frieze, Alan, Wormald†, Nicholas C.

Volltext

Edge crossings in drawings of bipartite graphs von Eades, Peter, Wormald, Nicholas C.

Volltext

Branching and tree indexed random walks on fractals von Telcs, András, Wormald, Nicholas C.

Volltext

Asymptotic normality determined by high moments, and submap counts of random maps von ZHICHENG GAO, WORMALD, Nicholas C

Volltext

Network modelling of underground mine layout: two case studies von Thomas, Doreen A., Brazil, Marcus, Lee, David H., Wormald, Nicholas C.

Volltext

Sharp Concentration of the Number of Submaps in Random Planar Triangulations von Gao, Zhicheng, Wormald†, Nicholas C.

Volltext

Reconstruction of rooted trees from subtrees von Ng, Meei Pyng, Wormald, Nicholas C.

Volltext

Random Hypergraph Processes with Degree Restrictions von Greenhill, Catherine, Ruciński, Andrzej, Wormald, Nicholas C.

Volltext

Permutation Pseudographs and Contiguity von GREENHILL, CATHERINE, JANSON, SVANTE, KIM, JEONG HAN, WORMALD, NICHOLAS C.

Volltext

Computation of the Bisection Width for Random d-Regular Graphs von Díaz, Josep, Serna, Maria J., Wormald, Nicholas C.

Volltext

The size of the largest components in random planar maps von ZHICHENG GAO, WORMALD, N. C

Volltext

Short Cycles in Random Regular Graphs von McKay, Brendan D., Wormald, Nicholas C., Wysocka, Beata

Volltext

The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees von Ng, Meei Pyng, Steel, Mike, Wormald, Nicholas C

Volltext

Counting connected graphs inside-out von Pittel, Boris, Wormald, Nicholas C.

Volltext

Connectedness of the Degree Bounded Star Process von GREENHILL, CATHERINE, RUCIŃSKI, ANDRZEJ, WORMALD, NICHOLAS C.

Volltext

Large forbidden trade volumes and edge packings of random graphs von Wormald, Nicholas C., Zhou, Sanming

Volltext

Corrigendum to “Counting connected graphs inside-out” [J. Combin. Theory Ser. B 93 (2005) 127–172] von Pittel, Boris, Wormald, Nicholas C.

Volltext