| 2009 |
|---|
| 62 | EE | Mahdieh Hasheminezhad,
Brendan D. McKay,
Tristan Reeves:
Recursive Generation of 5-Regular Planar Graphs.
WALCOM 2009: 129-140 |
| 61 | EE | Mahdieh Hasheminezhad,
S. Mehdi Hashemi,
Brendan D. McKay:
Spherical-Rectangular Drawings.
WALCOM 2009: 345-356 |
| 60 | EE | Robert E. L. Aldred,
Dries Van Dyck,
Gunnar Brinkmann,
Veerle Fack,
Brendan D. McKay:
Graph structural properties of non-Yutsis graphs allowing fast recognition.
Discrete Applied Mathematics 157(2): 377-386 (2009) |
| 2008 |
|---|
| 59 | EE | Brendan D. McKay:
Graph Isomorphism.
Encyclopedia of Algorithms 2008 |
| 58 | EE | E. Rodney Canfield,
Catherine S. Greenhill,
Brendan D. McKay:
Asymptotic enumeration of dense 0-1 matrices with specified line sums.
J. Comb. Theory, Ser. A 115(1): 32-66 (2008) |
| 57 | EE | Brendan D. McKay,
Ian M. Wanless:
A Census of Small Latin Hypercubes.
SIAM J. Discrete Math. 22(2): 719-736 (2008) |
| 2007 |
|---|
| 56 | EE | Brendan D. McKay:
Computing Symmetries of Combinatorial Objects.
Graph Drawing 2007: 1 |
| 2006 |
|---|
| 55 | EE | Brendan D. McKay,
Jeanette C. McLeod,
Ian M. Wanless:
The number of transversals in a Latin square.
Des. Codes Cryptography 40(3): 269-284 (2006) |
| 54 | EE | Seok-Hee Hong,
Brendan D. McKay,
Peter Eades:
A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs.
Discrete & Computational Geometry 36(2): 283-311 (2006) |
| 53 | EE | Catherine S. Greenhill,
Brendan D. McKay,
Xiaoji Wang:
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums.
J. Comb. Theory, Ser. A 113(2): 291-324 (2006) |
| 2005 |
|---|
| 52 | EE | Dries Van Dyck,
Gunnar Brinkmann,
Veerle Fack,
Brendan D. McKay:
To be or not to be Yutsis: Algorithms for the decision problem.
Computer Physics Communications 173(1-2): 61-70 (2005) |
| 51 | EE | Gunnar Brinkmann,
Brendan D. McKay:
Construction of planar triangulations with minimum degree 5.
Discrete Mathematics 301(2-3): 147-163 (2005) |
| 50 | EE | Gunnar Brinkmann,
Sam Greenberg,
Catherine S. Greenhill,
Brendan D. McKay,
Robin Thomas,
Paul Wollan:
Generation of simple quadrangulations of the sphere.
Discrete Mathematics 305(1-3): 33-54 (2005) |
| 49 | EE | E. Rodney Canfield,
Brendan D. McKay:
Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums.
Electr. J. Comb. 12: (2005) |
| 2004 |
|---|
| 48 | | Brendan D. McKay,
Konrad Piwakowski,
Stanislaw P. Radziszowski:
Ramsey Numbers for Triangles versus Almost-Complete Graphs.
Ars Comb. 73: (2004) |
| 47 | EE | Brendan D. McKay,
Nicholas C. Wormald,
Beata Wysocka:
Short Cycles in Random Regular Graphs.
Electr. J. Comb. 11(1): (2004) |
| 2003 |
|---|
| 46 | EE | Brendan D. McKay,
Edgar M. Palmer,
Ronald C. Read,
Robert W. Robinson:
The asymptotic number of claw-free cubic graphs.
Discrete Mathematics 272(1): 107-118 (2003) |
| 2002 |
|---|
| 45 | EE | Seok-Hee Hong,
Brendan D. McKay,
Peter Eades:
Symmetric drawings of triconnected planar graphs.
SODA 2002: 356-365 |
| 44 | | Brendan D. McKay,
Ian M. Wanless,
Nicholas C. Wormald:
Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree.
Combinatorics, Probability & Computing 11(4): (2002) |
| 43 | EE | Brendan D. McKay,
Jennifer Morse,
Herbert S. Wilf:
The Distributions of the Entries of Young Tableaux.
J. Comb. Theory, Ser. A 97(1): 117-128 (2002) |
| 42 | EE | Gunnar Brinkmann,
Brendan D. McKay:
Posets on up to 16 Points.
Order 19(2): 147-179 (2002) |
| 2000 |
|---|
| 41 | | Marty J. Wolf,
Simon Easteal,
Margaret Kahn,
Brendan D. McKay,
Lars S. Jermiin:
TrExML: a maximum-likelihood approach for extensive tree-space exploration.
Bioinformatics 16(4): 383-394 (2000) |
| 40 | EE | Brendan D. McKay,
Ian M. Wanless,
Nicholas C. Wormald:
The asymptotic number of graphs with a restriction on the maximum degree.
Electronic Notes in Discrete Mathematics 5: 228-230 (2000) |
| 39 | | Zhicheng Gao,
Brendan D. McKay,
Xiaoji Wang:
Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph.
Random Struct. Algorithms 16(1): 47-57 (2000) |
| 38 | EE | Robert E. L. Aldred,
S. Bau,
Derek A. Holton,
Brendan D. McKay:
Nonhamiltonian 3-Connected Cubic Planar Graphs.
SIAM J. Discrete Math. 13(1): 25-32 (2000) |
| 1999 |
|---|
| 37 | EE | Weifa Liang,
Brendan D. McKay:
An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation.
ISPAN 1999: 290-295 |
| 36 | EE | Gunnar Brinkmann,
Brendan D. McKay:
Fast generation of some classes of planar graphs.
Electronic Notes in Discrete Mathematics 3: 28-31 (1999) |
| 35 | EE | Brendan D. McKay,
Ian M. Wanless:
Most Latin Squares Have Many Subsquares.
J. Comb. Theory, Ser. A 86(2): 323-347 (1999) |
| 1998 |
|---|
| 34 | | Brendan D. McKay,
Wendy J. Myrvold,
Jacqueline Nadon:
Fast Backtracking Principles Applied to Find New Cages.
SODA 1998: 188-191 |
| 33 | | Brendan D. McKay,
Robert W. Robinson:
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph.
Combinatorics, Probability & Computing 7(4): 437-449 (1998) |
| 32 | EE | Brendan D. McKay,
Ian M. Wanless:
Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles.
Electr. J. Comb. 5: (1998) |
| 31 | | Brendan D. McKay:
Isomorph-Free Exhaustive Generation.
J. Algorithms 26(2): 306-324 (1998) |
| 30 | EE | Brendan D. McKay,
Mirka Miller,
Jozef Sirán:
A Note on Large Graphs of Diameter Two and Given Maximum Degree, .
J. Comb. Theory, Ser. B 74(1): 110-118 (1998) |
| 1997 |
|---|
| 29 | EE | Edward A. Bender,
E. Rodney Canfield,
Brendan D. McKay:
The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices.
J. Comb. Theory, Ser. A 80(1): 124-150 (1997) |
| 28 | EE | Brendan D. McKay,
Stanislaw P. Radziszowski:
Subgraph Counting Identities and Ramsey Numbers.
J. Comb. Theory, Ser. B 69(2): 193-209 (1997) |
| 27 | | Brendan D. McKay,
Nicholas C. Wormald:
The degree sequence of a random graph. I. The models.
Random Struct. Algorithms 11(2): 97-117 (1997) |
| 1996 |
|---|
| 26 | EE | Weifa Liang,
Brendan D. McKay,
Hong Shen:
NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems.
Inf. Process. Lett. 58(3): 149-155 (1996) |
| 25 | EE | Brendan D. McKay,
Xiaoji Wang:
Asymptotic Enumeration of Tournaments with a Given Score Sequence.
J. Comb. Theory, Ser. A 73(1): 77-90 (1996) |
| 1995 |
|---|
| 24 | | Gunnar Brinkmann,
Brendan D. McKay,
Carsten Saager:
The Smallest Cubic Graphs of Girth Nine.
Combinatorics, Probability & Computing 4: 317-329 (1995) |
| 23 | EE | Brendan D. McKay,
Eric Rogoyski:
Latin Squares of Order 10.
Electr. J. Comb. 2: (1995) |
| 1994 |
|---|
| 22 | EE | Brendan D. McKay,
Stanislaw P. Radziszowski:
Linear Programming in Some Ramsey Problems.
J. Comb. Theory, Ser. B 61(1): 125-132 (1994) |
| 21 | | Alan M. Frieze,
Brendan D. McKay:
Multicolored Trees in Random Graphs.
Random Struct. Algorithms 5(1): 45-56 (1994) |
| 1992 |
|---|
| 20 | | Neil J. Calkin,
Alan M. Frieze,
Brendan D. McKay:
On Subgraph Sizes in Random Graphs.
Combinatorics, Probability & Computing 1: 123-134 (1992) |
| 19 | | Edward A. Bender,
E. Rodney Canfield,
Brendan D. McKay:
Asymptotic Properties of Labeled Connected Graphs.
Random Struct. Algorithms 3(2): 183-202 (1992) |
| 1991 |
|---|
| 18 | | Brendan D. McKay,
Stanislaw P. Radziszowski:
The First Classical Ramsey Number for Hypergraphs is Computed.
SODA 1991: 304-308 |
| 17 | | Brendan D. McKay,
Nicholas C. Wormald:
Asymptotic enumeration by degree sequence of graphs with degress o(n1/2).
Combinatorica 11(4): 369-382 (1991) |
| 16 | | Brendan D. McKay,
Jennifer Seberry,
Scott A. Vanstone:
Ralph Gordon Stanton.
Discrete Mathematics 92(1-3): 1-8 (1991) |
| 1990 |
|---|
| 15 | | Brendan D. McKay:
The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs.
Combinatorica 10(4): 367-377 (1990) |
| 14 | | Brendan D. McKay,
Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs of Moderate Degree.
J. Algorithms 11(1): 52-67 (1990) |
| 13 | EE | Chris D. Godsil,
Brendan D. McKay:
Asymptotic enumeration of Latin rectangles.
J. Comb. Theory, Ser. B 48(1): 19-44 (1990) |
| 12 | | Edward A. Bender,
E. Rodney Canfield,
Brendan D. McKay:
The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges.
Random Struct. Algorithms 1(2): 127-170 (1990) |
| 1988 |
|---|
| 11 | EE | Derek A. Holton,
Brendan D. McKay:
The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices.
J. Comb. Theory, Ser. B 45(3): 305-319 (1988) |
| 1987 |
|---|
| 10 | EE | Richard P. Brent,
Brendan D. McKay:
Determinants and ranks of random matrices over Zm.
Discrete Mathematics 66(1-2): 35-49 (1987) |
| 1986 |
|---|
| 9 | EE | Béla Bollobás,
Brendan D. McKay:
The number of matchings in random regular graphs and bipartite graphs.
J. Comb. Theory, Ser. B 41(1): 80-91 (1986) |
| 8 | | Robert Alan Wright,
L. Bruce Richmond,
Andrew M. Odlyzko,
Brendan D. McKay:
Constant Time Generation of Free Trees.
SIAM J. Comput. 15(2): 540-548 (1986) |
| 1985 |
|---|
| 7 | EE | Robert L. Hemminger,
Brendan D. McKay:
Integer sequences with proscribed differences and bounded growth rate.
Discrete Mathematics 55(3): 255-265 (1985) |
| 6 | EE | Derek A. Holton,
Bennet Manvel,
Brendan D. McKay:
Hamiltonian cycles in cubic 3-connected bipartite planar graphs.
J. Comb. Theory, Ser. B 38(3): 279-297 (1985) |
| 1984 |
|---|
| 5 | | Brendan D. McKay,
Nicholas C. Wormald:
Automorphisms of random graphs with specified vertices.
Combinatorica 4(4): 325-338 (1984) |
| 4 | | Peter Eades,
Brendan D. McKay:
An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property.
Inf. Process. Lett. 19(3): 131-133 (1984) |
| 1982 |
|---|
| 3 | | Derek A. Holton,
Brendan D. McKay,
Michael D. Plummer,
Carsten Thomassen:
A nine point theorem for 3-connected graphs.
Combinatorica 2(1): 53-62 (1982) |
| 1981 |
|---|
| 2 | EE | Chris D. Godsil,
Brendan D. McKay:
Spectral conditions for the reconstructibility of a graph.
J. Comb. Theory, Ser. B 30(3): 285-289 (1981) |
| 1980 |
|---|
| 1 | | Charles J. Colbourn,
Brendan D. McKay:
A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability.
Inf. Process. Lett. 11(2): 96-97 (1980) |
