Pancyclicity of connected circulant graphs. - Zbigniew R. Bogdanowicz (J. Graph Theory, 1996)

Efficient Methodology and Robust Infrastructure for Assigning Weapons to Targets. - Zbigniew R. Bogdanowicz; Norman P. Coleman (MSV/AMCS, 2004)

Analysis of backup route reoptimization algorithms for optical shared mesh networks. - Zbigniew R. Bogdanowicz; Somdip Datta (Math. Comput. Model., 2004)

Hamiltonian Circuits in Sparse Circulant Digraphs. - Zbigniew R. Bogdanowicz (Ars Comb., 2005)

Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks. - Zbigniew R. Bogdanowicz (Electron. Notes Discret. Math., 2005)

New Algorithm for Optimization of Effect-Based Weapon-Target Pairings. - Zbigniew R. Bogdanowicz; Norman P. Coleman (CSC, 2008)

A new efficient algorithm for optimal assignment of smart weapons to targets. - Zbigniew R. Bogdanowicz (Comput. Math. Appl., 2009)

Hamilton cycles in circulant digraphs with prescribed number of distinct jumps. - Zbigniew R. Bogdanowicz (Discret. Math., 2009)

Undirected simple connected graphs with minimum number of spanning trees. - Zbigniew R. Bogdanowicz (Discret. Math., 2009)

On arc reversal in balanced digraphs. - Zbigniew R. Bogdanowicz (Discret. Math., 2011)

Advanced Input Generating Algorithm for Effect-Based Weapon-Target Pairing Optimization. - Zbigniew R. Bogdanowicz (IEEE Trans. Syst. Man Cybern. Part A, 2012)

On Properties of Working Paths in Optimal Set of Survivable Paths. - Zbigniew R. Bogdanowicz (Ars Comb., 2013)

Cubic Graphs with Minimum Number of Spanning Trees. - Zbigniew R. Bogdanowicz (Ars Comb., 2013)

Arc-Disjoint and Edge-Disjoint Hamilton Cycles in Circulants with Two Jumps. - Zbigniew R. Bogdanowicz (Graphs Comb., 2013)

On Family of Graphs with Minimum Number of Spanning Trees. - Zbigniew R. Bogdanowicz (Graphs Comb., 2013)

Optimization of Weapon-Target Pairings Based on Kill Probabilities. - Zbigniew R. Bogdanowicz; Antony Tolano; Ketula Patel; Norman P. Coleman (IEEE Trans. Cybern., 2013)

Antidirected Hamilton cycles in the Cartesian product of directed cycles. - Zbigniew R. Bogdanowicz (Ars Comb., 2014)

Chordal 2-Connected Graphs and Spanning Trees. - Zbigniew R. Bogdanowicz (J. Graph Theory, 2014)

Decomposition of circulant digraphs with two jumps into cycles of equal lengths. - Zbigniew R. Bogdanowicz (Discret. Appl. Math., 2015)

On isomorphism between circulant and Cartesian product of 2 cycles. - Zbigniew R. Bogdanowicz (Discret. Appl. Math., 2015)

Quick Collateral Damage Estimation Based on Weapons Assigned to Targets. - Zbigniew R. Bogdanowicz; Ketula Patel (IEEE Trans. Syst. Man Cybern. Syst., 2015)

Isomorphism between circulants and Cartesian products of cycles. - Zbigniew R. Bogdanowicz (Discret. Appl. Math., 2017)

On decomposition of the Cartesian product of directed cycles into cycles of equal lengths. - Zbigniew R. Bogdanowicz (Discret. Appl. Math., 2017)

Flying Swarm of Drones Over Circulant Digraph. - Zbigniew R. Bogdanowicz (IEEE Trans. Aerosp. Electron. Syst., 2017)

Identifying Hamilton cycles in the Cartesian product of directed cycles. - Zbigniew R. Bogdanowicz (AKCE Int. J. Graphs Comb., 2020)

On the minimum number of spanning trees in cubic multigraphs. - Zbigniew R. Bogdanowicz (Discuss. Math. Graph Theory, 2020)

Hyper-Hamiltonian circulants. - Zbigniew R. Bogdanowicz (Electron. J. Graph Theory Appl., 2021)

On q-connected chordal graphs with minimum number of spanning trees. - Zbigniew R. Bogdanowicz (Discuss. Math. Graph Theory, 2023)