| 2006 |
|---|
| 6 | EE | S. D. Noble:
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid.
Combinatorics, Probability & Computing 15(3): 449-461 (2006) |
| 2004 |
|---|
| 5 | EE | A. E. Koller,
S. D. Noble:
Domination analysis of greedy heuristics for the frequency assignment problem.
Discrete Mathematics 275(1-3): 331-338 (2004) |
| 4 | EE | R. A. Leese,
S. D. Noble:
Cyclic Labellings with Constraints at Two Distances.
Electr. J. Comb. 11(1): (2004) |
| 3 | EE | Ilia Krasikov,
S. D. Noble:
Finding next-to-shortest paths in a graph.
Inf. Process. Lett. 92(3): 117-119 (2004) |
| 1998 |
|---|
| 2 | | S. D. Noble:
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width.
Combinatorics, Probability & Computing 7(3): 307-321 (1998) |
| 1996 |
|---|
| 1 | EE | S. D. Noble:
Recognising a partitionable simplicial complex is in NP.
Discrete Mathematics 152(1-3): 303-305 (1996) |
