Neil J. Calkin

2009
15	EE	Jessica F. Burkhart, Neil J. Calkin, Shuhong Gao, Justine C. Hyde-Volpe, Kevin James, Hiren Maharaj, Shelly Manber, Jared Ruiz, Ethan Smith: Finite field elements of high order arising from modular curves. Des. Codes Cryptography 51(3): 301-314 (2009)
2004
14		Peter Dankelmann, Neil J. Calkin: The Domatic Number of Regular Graphs. Ars Comb. 73: (2004)
2003
13	EE	Neil J. Calkin, Criel Merino, S. Noble, Marc Noy: Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. Electr. J. Comb. 10: (2003)
2000
12	EE	Neil J. Calkin, E. Rodney Canfield, Herbert S. Wilf: Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. J. Comb. Theory, Ser. A 91(1-2): 171-190 (2000)
1999
11		Neil J. Calkin, Jennifer D. Key, Marialuisa J. de Resmini: Minimum Weight and Dimension Formulas for Some Geometric Codes. Des. Codes Cryptography 17(1-3): 105-120 (1999)
1998
10		Neil J. Calkin, Peter J. Cameron: Almost Odd Random Sum-Free Sets. Combinatorics, Probability & Computing 7(1): 27-32 (1998)
9	EE	Neil J. Calkin: On the structure of a random sum-free set of positive integers. Discrete Mathematics 190(1-3): 247-257 (1998)
8	EE	Neil J. Calkin, Herbert S. Wilf: The Number of Independent Sets in a Grid Graph. SIAM J. Discrete Math. 11(1): 54-60 (1998)
1997
7		Neil J. Calkin: Dependent Sets of Constant Weight Binary Vectors. Combinatorics, Probability & Computing 6(3): 263-271 (1997)
6	EE	Neil J. Calkin, Paul Erdös, Craig A. Tovey: New Ramsey Bounds from Cyclic Graphs of Prime Order. SIAM J. Discrete Math. 10(3): 381-387 (1997)
1996
5		Neil J. Calkin: Dependent sets of constant weight vectors in GF(q). Random Struct. Algorithms 9(1-2): 49-53 (1996)
1994
4	EE	Neil J. Calkin: A curious binomial identity. Discrete Mathematics 131(1-3): 335-337 (1994)
1992
3		Neil J. Calkin, Alan M. Frieze, Brendan D. McKay: On Subgraph Sizes in Random Graphs. Combinatorics, Probability & Computing 1: 123-134 (1992)
2		Neil J. Calkin, Alan M. Frieze, Ludek Kucera: On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. Random Struct. Algorithms 3(2): 215-222 (1992)
1990
1		Neil J. Calkin, Alan M. Frieze: Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. Random Struct. Algorithms 1(1): 39-50 (1990)

Coauthor Index

1	Jessica F. Burkhart	[15]
2	Peter J. Cameron	[10]
3	E. Rodney Canfield	[12]
4	Peter Dankelmann	[14]
5	Paul Erdös	[6]
6	Alan M. Frieze	[1] [2] [3]
7	Shuhong Gao	[15]
8	Justine C. Hyde-Volpe	[15]
9	Kevin James	[15]
10	Jennifer D. Key	[11]
11	Ludek Kucera	[2]
12	Hiren Maharaj	[15]
13	Shelly Manber	[15]
14	Brendan D. McKay	[3]
15	Criel Merino	[13]
16	S. Noble	[13]
17	Marc Noy	[13]
18	Marialuisa J. de Resmini	[11]
19	Jared Ruiz	[15]
20	Ethan Smith	[15]
21	Craig A. Tovey	[6]
22	Herbert S. Wilf	[8] [12]

Colors in the list of coauthors