Graphs, Maneuvers and Turnpikes. - Arthur T. Benjamin (Oper. Res., 1990)

Another Way of Counting NN. - Arthur T. Benjamin; Fritz Juhnke (SIAM J. Discret. Math., 1992)

How Do I Marry Thee? Let Me Count the Ways!. - Arthur T. Benjamin; Cherlyn Converse; Henry A. Krieger (Discret. Appl. Math., 1995)

Sensible Rules for Remembering Duals - the S-O-B Method. - Arthur T. Benjamin (SIAM Rev., 1995)

Strong chromatic index of subset graphs. - Jennifer J. Quinn; Arthur T. Benjamin (J. Graph Theory, 1997)

Paths to a Multinomial Inequality. - Arthur T. Benjamin; Jennifer J. Quinn (Ars Comb., 2000)

What's Best? - Arthur T. Benjamin; Matthew T. Fluet (Am. Math. Mon., 2000)

Random Approaches to Fibonacci Identities. - Arthur T. Benjamin; Gregory M. Levin; Karl Mahlburg; Jennifer J. Quinn (Am. Math. Mon., 2000)

Optimal Token Allocations in Solitaire Knock 'm Down. - Arthur T. Benjamin; Matthew Fluet; Mark L. Huber (Electron. J. Comb., 2001)

Composite Fermions and Integer Partitions. - Arthur T. Benjamin; Jennifer J. Quinn; John J. Quinn; Arkadiusz Wójs (J. Comb. Theory A, 2001)

Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems. - Peter G. Anderson; Arthur T. Benjamin; Jeremy A. Rouse (Am. Math. Mon., 2005)

Counting on Determinants. - Arthur T. Benjamin; Naiomi T. Cameron (Am. Math. Mon., 2005)

A combinatorial solution to intertwined recurrences. - Arthur T. Benjamin; Michael D. Hirschhorn (Australas. J Comb., 2007)

A Combinatorial Proof of Vandermonde's Determinant. - Arthur T. Benjamin; Gregory P. Dresden (Am. Math. Mon., 2007)

The 99th Fibonacci Identity. - Arthur T. Benjamin; Alex K. Eustis; Sean S. Plott (Electron. J. Comb., 2008)

The Combinatorialization of Linear Recurrences. - Arthur T. Benjamin; Halcyon Derks; Jennifer J. Quinn (Electron. J. Comb., 2011)