A combinatorial approach to the character theory of split metabelian groups. - Andrew J. Woldar (J. Comb. Theory A, 1989)

On the Maximal Cliques of the Quadratic Forms Graph in Even Characteristic. - Joe Hemmeter; Andrew J. Woldar (Eur. J. Comb., 1990)

Classification of the Maximal Cliques of Size ⩾q + 4 m the Quadratic Forms Graph in Odd Characteristic. - Joe Hemmeter; Andrew J. Woldar (Eur. J. Comb., 1990)

On the number of irregular assignments on a graph. - Gary L. Ebert; Joe Hemmeter; Felix Lazebnik; Andrew J. Woldar (Discret. Math., 1991)

New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles. - Felix Lazebnik; Vasiliy A. Ustimenko; Andrew J. Woldar (J. Comb. Theory B, 1994)

Properties of Certain Families of 2k-Cycle-Free Graphs. - Felix Lazebnik; Vasiliy A. Ustimenko; Andrew J. Woldar (J. Comb. Theory B, 1994)

The complete list of maximal cliques of Quad(n, q), q odd. - Andries E. Brouwer; Joe Hemmeter; Andrew J. Woldar (Eur. J. Comb., 1995)

Graphs of Prescribed Girth and Bi-Degree. - Zoltán Füredi; Felix Lazebnik; Ákos Seress; Vasiliy A. Ustimenko; Andrew J. Woldar (J. Comb. Theory B, 1995)

A characterization of the components of the graphs D(k, q). - Felix Lazebnik; Vasiliy A. Ustimenko; Andrew J. Woldar (Discret. Math., 1996)

New upper bounds on the order of cages. - Felix Lazebnik; Vasiliy A. Ustimenko; Andrew J. Woldar (Electron. J. Comb., 1997)

Orbital Schemes of B3(q) Acting on 2-Dimensional Totally Isotropic Subspaces. - Joe Hemmeter; Vasya J. Ustimenko; Andrew J. Woldar (Eur. J. Comb., 1998)

Polarities and 2k-cycle-free graphs. - Felix Lazebnik; Vasiliy A. Ustimenko; Andrew J. Woldar (Discret. Math., 1999)

The Complete List of Maximal Cliques of Quad(n, q), q Even. - Joe Hemmeter; Andrew J. Woldar (Eur. J. Comb., 1999)

General Properties of Some Graphs Defined by Systems of Equations. - Felix Lazebnik; Andrew J. Woldar (Electron. Notes Discret. Math., 2000)

New Lower Bounds on the Multicolor Ramsey Numbers rk(C4). - Felix Lazebnik; Andrew J. Woldar (J. Comb. Theory B, 2000)

General properties of some families of graphs defined by systems of equations. - Felix Lazebnik; Andrew J. Woldar (J. Graph Theory, 2001)

Extremal properties of regular and affine generalized m-gons as tactical configurations. - Vasiliy A. Ustimenko; Andrew J. Woldar (Eur. J. Comb., 2003)

Association schemes on 28 points as mergings of a half-homogeneous coherent configuration. - Mikhail H. Klin; Mikhail E. Muzychuk; Christian Pech; Andrew J. Woldar; Paul-Hermann Zieschang (Eur. J. Comb., 2007)

Maximum number of colorings of (2k, k2)-graphs. - Felix Lazebnik; Oleg Pikhurko; Andrew J. Woldar (J. Graph Theory, 2007)

Siamese Combinatorial Objects via Computer Algebra Experimentation. - Mikhail H. Klin; Sven Reichard; Andrew J. Woldar (Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009)

Examples of computer experimentation in algebraic combinatorics. - Mikhail H. Klin; Christian Pech; Sven Reichard; Andrew J. Woldar; Matan Ziv-Av (Ars Math. Contemp., 2010)

A geometric approach to orbital recognition in Chevalley-type coherent configurations and association schemes. - Vasyl Ustimenko; Andrew J. Woldar (Australas. J Comb., 2017)