Balanced ternary designs with holes and numbers of common triples. - Abdollah Khodkar (Australas. J Comb., 1993)

Various super-simple designs with block size four. - Abdollah Khodkar (Australas. J Comb., 1994)

Discrete Optimisation and Fast Correlation Attacks. - Jovan Dj. Golic; Mahmoud Salmasizadeh; Andrew J. Clark; Abdollah Khodkar; Ed Dawson (Cryptography: Policy and Algorithms, 1995)

Numbers of common triples in simple balanced ternary designs. - Abdollah Khodkar (Ars Comb., 1995)

The fine structure of (v, 3) directed triple systems: v = 0 or 1 (mod 3). - Abdollah Khodkar (Ars Comb., 1996)

The intersection problem for cubes. - Peter Adams 001; Darryn E. Bryant; Abdollah Khodkar; Saad I. El-Zanati (Australas. J Comb., 1997)

On the non-existence of Steiner (v, k, 2) trades with certain volumes. - Abdollah Khodkar; Dean G. Hoffman (Australas. J Comb., 1998)

On Orthogonal Double Covers of Graphs. - Darryn E. Bryant; Abdollah Khodkar (Des. Codes Cryptogr., 1998)

On minimum possible volumes of strong Steiner trades. - Nicholas Hamilton; Abdollah Khodkar (Australas. J Comb., 1999)

The fine structure of balanced ternary designs with block size three, index three and rho2 = 1, 2. - Peter Adams 001; Darryn E. Bryant; Abdollah Khodkar (Ars Comb., 2000)

The fine structure of (v, 3) directed triple systems: v = 2 (mod 3). - Peter Adams 001; Darryn E. Bryant; Abdollah Khodkar (Ars Comb., 2000)

Maximum packings of Kv - Ku with triples. - Darryn E. Bryant; Abdollah Khodkar (Ars Comb., 2000)

On Alspach's conjecture with two even cycle lengths. - Peter Adams 001; Darryn E. Bryant; Abdollah Khodkar (Discret. Math., 2000)

Smallest weak and smallest totally weak critical set in the latin squares of order at most seven. - Peter Adams 001; Abdollah Khodkar (Ars Comb., 2001)

The mu-way intersection problem for m-cycle systems. - Peter Adams 001; Elizabeth J. Billington; Darryn E. Bryant; Abdollah Khodkar (Discret. Math., 2001)

Latin Interchanges and Direct Products. - Diane M. Donovan; Rebecca A. H. Gower; Abdollah Khodkar (Ars Comb., 2002)

Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges. - Richard Bean 001; Diane M. Donovan; Abdollah Khodkar; Anne Penfold Street (Int. J. Comput. Math., 2002)

A census of critical sets in the Latin squares of order at most six. - Peter Adams 001; Richard Bean 001; Abdollah Khodkar (Ars Comb., 2003)

Doubling and Tripling Constructions for Defining Sets in Steiner Triple Systems. - Diane M. Donovan; Abdollah Khodkar; Anne Penfold Street (Graphs Comb., 2003)

Families of 2-critical sets for dihedral groups. - Abdollah Khodkar; M. A. Shahabi; Seyed Mahmoud Sheikholeslami (Australas. J Comb., 2004)

An investigation of 2-critical sets in latin squares. - Diane M. Donovan; Chin-Mei Fu; Abdollah Khodkar (Ars Comb., 2004)

On a generalization of the Oberwolfach problem. - Nicholas J. Cavenagh; Saad I. El-Zanati; Abdollah Khodkar; Charles Vanden Eynden (J. Comb. Theory A, 2004)

The defining numbers for vertex colorings of certain graphs. - Doost Ali Mojdeh; Nader Jafari Rad; Abdollah Khodkar (Australas. J Comb., 2006)

On perfect double dominating sets in grids cylinders and tori. - Abdollah Khodkar; Seyed Mahmoud Sheikholeslami (Australas. J Comb., 2007)

On The Spectrum Of Critical Sets In Back Circulant Latin Squares. - Nicholas J. Cavenagh; Diane M. Donovan; Abdollah Khodkar (Ars Comb., 2007)

The Forcing Domination Numbers Of Some Graphs. - Abdollah Khodkar; Seyed Mahmoud Sheikholeslami (Ars Comb., 2007)

Graphs K1*4, 5, K1*5, 4, K1*4, 4, K2, 3, 4, have the property M(3). - Doost Ali Mojdeh; A. Ahmadi Haji; Hossein Abdollahzadeh Ahangar; Abdollah Khodkar (Ars Comb., 2007)

Characterization of double domination subdivision number of trees. - M. Atapour; Abdollah Khodkar; Seyed Mahmoud Sheikholeslami (Discret. Appl. Math., 2007)

More on even [a, b]-factors in graphs. - Abdollah Khodkar; Rui Xu (Discuss. Math. Graph Theory, 2007)

Signed edge majority domination numbers in graphs. - Hossein Karami 002; Seyed Mahmoud Sheikholeslami; Abdollah Khodkar (Australas. J Comb., 2008)

When is a partial Latin square uniquely completable, but not its completable product? - Nicholas J. Cavenagh; Diane M. Donovan; Abdollah Khodkar; G. H. John van Rees (Discret. Math., 2008)

On the range of influences in back-circulant Latin squares. - Abdollah Khodkar; Warwick de Launey (Discret. Math., 2008)

Some Notes on Signed Edge Domination in Graphs. - Hossein Karami 002; Seyed Mahmoud Sheikholeslami; Abdollah Khodkar (Graphs Comb., 2008)

Signed Edge Domination Numbers In Trees. - Hossein Karami 002; Abdollah Khodkar; Seyed Mahmoud Sheikholeslami (Ars Comb., 2009)

Lower bounds on the signed domination numbers of directed graphs. - Hossein Karami 002; Seyed Mahmoud Sheikholeslami; Abdollah Khodkar (Discret. Math., 2009)

An Upper Bound for the Total Domination Subdivision Number of a Graph. - Hossein Karami 002; R. Khoeilar; Seyed Mahmoud Sheikholeslami; Abdollah Khodkar (Graphs Comb., 2009)

Super edge-graceful labelings of complete bipartite graphs. - Abdollah Khodkar; Sam Nolen; James T. Perconti (Australas. J Comb., 2010)

Signed (b, k)-Edge Covers in Graphs. - Arezoo N. Ghameshlou; Abdollah Khodkar; Reza Saei; Seyed Mahmoud Sheikholeslami (Intell. Inf. Manag., 2010)

An upper bound for total domination subdivision numbers. - Hossein Karami 002; Abdollah Khodkar; Seyed Mahmoud Sheikholeslami (Ars Comb., 2011)

The Signed Bad numbers in Graphs. - Arezoo N. Ghameshlou; Abdollah Khodkar; Seyed Mahmoud Sheikholeslami (Discret. Math. Algorithms Appl., 2011)

Identifying flaws in the security of critical sets in latin squares via triangulations. - Diane M. Donovan; James G. Lefevre; Thomas A. McCourt; Nicholas J. Cavenagh; Abdollah Khodkar (Australas. J Comb., 2012)

Signed edge majority total domination numbers in graphs. - Hossein Karami 002; Seyed Mahmoud Sheikholeslami; Abdollah Khodkar (Ars Comb., 2012)

On 3-yt-vertex critical graphs of diameter three. - Mustapha Chellali; Nader Jafari Rad; Abdollah Khodkar (Discret. Appl. Math., 2012)

Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems. - Elizabeth J. Billington; Nicholas J. Cavenagh; Abdollah Khodkar (Discret. Math., 2012)

Connected Domination Number of a Graph and its Complement. - Hossein Karami 002; Seyed Mahmoud Sheikholeslami; Abdollah Khodkar; Douglas B. West (Graphs Comb., 2012)

Roman domination subdivision number of a graph and its complement. - Abdollah Khodkar; B. P. Mobaraky; Seyed Mahmoud Sheikholeslami (Ars Comb., 2013)

Signed edge k-subdomination numbers in graphs. - Abdollah Khodkar; Reza Saei; Seyed Mahmoud Sheikholeslami (Ars Comb., 2013)

New bounds on the signed domination numbers of graphs. - S. M. Hosseini Moghaddam; Abdollah Khodkar; Babak Samadi (Australas. J Comb., 2015)

On the signed (total) k-independence number in graphs. - Abdollah Khodkar; Babak Samadi; Lutz Volkmann (Discuss. Math. Graph Theory, 2015)

Difference Covering Arrays and Pseudo-Orthogonal Latin Squares. - Fatih Demirkale; Diane M. Donovan; Joanne L. Hall; Abdollah Khodkar; Asha Rao (Graphs Comb., 2016)

Bounds on several versions of restrained domination number. - Babak Samadi; Hamid R. Golmohammadi; Abdollah Khodkar (Contributions Discret. Math., 2017)

Existence of some signed magic arrays. - Abdollah Khodkar; Christian Schulz 007; Nathan Wagner (Discret. Math., 2017)

Signed magic rectangles with three filled cells in each column. - Abdollah Khodkar; C. David Leach; Brandi Ellis (Bull. ICA, 2020)

Signed domination and Mycielski's structure in graphs. - Arezoo N. Ghameshlou; Athena Shaminezhad; Ebrahim Vatandoost; Abdollah Khodkar (RAIRO Oper. Res., 2020)

Covering Italian domination in graphs. - Abdollah Khodkar; Doost Ali Mojdeh; Babak Samadi; Ismael G. Yero (Discret. Appl. Math., 2021)