The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Brendan D. McKay: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  52. Computing Symmetries of Combinatorial Objects. [Citation Graph (, )][DBLP]


  53. Recursive Generation of 5-Regular Planar Graphs. [Citation Graph (, )][DBLP]


  54. Spherical-Rectangular Drawings. [Citation Graph (, )][DBLP]


  55. Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums. [Citation Graph (, )][DBLP]


  56. Rectangular-radial drawings of cubic plane graphs. [Citation Graph (, )][DBLP]


  57. Subgraphs of Random k-Edge-Coloured k-Regular Graphs. [Citation Graph (, )][DBLP]


  58. Graph structural properties of non-Yutsis graphs allowing fast recognition. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002