Browsing by Author Noble, S D

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 8 to 10 of 10 < previous 
Issue DateTitleAuthor(s)
2009k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4Eggemann, N; Havet, F; Noble, S D
2000Knot GraphsNoble, S D; Welsh, D J A
2002Optimal arrangement of data in a tree directoryLuczak, M J; Noble, S D