AAAAAA
Results:
1-10
|
Results: 10
Authors:
MCDIARMID C
Citation: C. Mcdiarmid, A DOUBLY CYCLIC CHANNEL ASSIGNMENT PROBLEM, Discrete applied mathematics, 80(2-3), 1997, pp. 263-268
Authors:
FRIEZE A
MCDIARMID C
Citation: A. Frieze et C. Mcdiarmid, ALGORITHMIC THEORY OF RANDOM GRAPHS, Random structures & algorithms, 10(1-2), 1997, pp. 5-42
Authors:
MCDIARMID C
JOHNSON T
STONE HS
Citation: C. Mcdiarmid et al., ON FINDING A MINIMUM SPANNING TREE IN A NETWORK WITH RANDOM WEIGHTS, Random structures & algorithms, 10(1-2), 1997, pp. 187-204
Authors:
MCDIARMID C
Citation: C. Mcdiarmid, A RANDOM BIT-FLIPPING METHOD FOR SEEKING AGREEMENT, Random structures & algorithms, 8(2), 1996, pp. 121-130
Authors:
ALON N
MCDIARMID C
MOLLOY M
Citation: N. Alon et al., EDGE-DISJOINT CYCLES IN REGULAR DIRECTED-GRAPHS, Journal of graph theory, 22(3), 1996, pp. 231-237
Authors:
MCDIARMID C
STEGER A
Citation: C. Mcdiarmid et A. Steger, TIDIER EXAMPLES FOR LOWER BOUNDS ON DIAGONAL RAMSEY NUMBERS, J COMB TH A, 74(1), 1996, pp. 147-152
Authors:
MCDIARMID C
Citation: C. Mcdiarmid, COMBINATORIAL OPTIMIZATION 1992 (CO92) - PREFACE, Discrete applied mathematics, 57(2-3), 1995, pp. 91-91
Authors:
EDWARDS K
MCDIARMID C
Citation: K. Edwards et C. Mcdiarmid, THE COMPLEXITY OF HARMONIOUS COLORING FOR TREES, Discrete applied mathematics, 57(2-3), 1995, pp. 133-144
Authors:
EDWARDS K
MCDIARMID C
Citation: K. Edwards et C. Mcdiarmid, NEW UPPER-BOUNDS ON HARMONIOUS COLORINGS, Journal of graph theory, 18(3), 1994, pp. 257-267
Authors:
MCDIARMID C
REED B
SCHRIJVER A
SHEPHERD B
Citation: C. Mcdiarmid et al., INDUCED CIRCUITS IN PLANAR GRAPHS, J COMB TH B, 60(2), 1994, pp. 169-176
Risultati:
1-10
|