Asymptotic enumeration by degree sequence of graphs of high degree

Simple Markov-chain algorithms for generating bipartite graphs and tournaments

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Kolmogorov random graphs only have trivial stable colorings

Information Processing Letters

Largest planar matching in random bipartite graphs

Random Structures & Algorithms

More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs

DISC '00 Proceedings of the 14th International Conference on Distributed Computing

Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number

Combinatorics, Probability and Computing

Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree

Combinatorics, Probability and Computing

Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity

Combinatorics, Probability and Computing

Random Star Processes

Combinatorics, Probability and Computing

Distance Graphs on the Integers

Combinatorics, Probability and Computing

Lower bounds for sense of direction in regular graphs

Distributed Computing

Asymptotic enumeration of dense 0--1 matrices with specified line sums

Journal of Combinatorial Theory Series A

Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing

The probability that a random multigraph is simple

Combinatorics, Probability and Computing

A Fourier-analytic approach to counting partial Hadamard matrices

Cryptography and Communications

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence

SIAM Journal on Discrete Mathematics

Subgraphs of dense random graphs with specified degrees

Combinatorics, Probability and Computing