Maximum Induced Matchings of Random Cubic Graphs. - William Duckworth; Nicholas C. Wormald; Michele Zito 001 (COCOON, 2000)

Sparse Hypercube 3-spanners. - William Duckworth; Michele Zito 001 (Discret. Appl. Math., 2000)

Leafy spanning trees in hypercubes. - William Duckworth; Paul E. Dunne; Alan Gibbons; Michele Zito 001 (Appl. Math. Lett., 2001)

On the Connected Domination Number of Random Regular Graphs. - William Duckworth; Bernard Mans (COCOON, 2002)

Packing Edges in Random Regular Graphs. - Mihalis Beis; William Duckworth; Michele Zito 001 (MFCS, 2002)

Small k-Dominating Sets of Regular Graphs. - William Duckworth; Bernard Mans (RANDOM, 2002)

Minimum Connected Dominating Sets of Random Cubic Graphs. - William Duckworth (Electron. J. Comb., 2002)

Minimum independent dominating sets of random cubic graphs. - William Duckworth; Nicholas C. Wormald (Random Struct. Algorithms, 2002)

Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs. - William Duckworth; Bernard Mans (CIAC, 2003)

Maximum 2-independent sets of random cubic graphs. - William Duckworth (Australas. J Comb., 2003)

Large 2-Independent Sets of Regular Graphs. - William Duckworth; Michele Zito 001 (CATS, 2003)

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. - William Duckworth; Nicholas C. Wormald; Michele Zito 001 (J. Discrete Algorithms, 2003)

Small Edge Dominating Sets of Regular Graphs. - William Duckworth (CATS, 2004)

Large k-Separated Matchings of Random Regular Graphs. - Mihalis Beis; William Duckworth; Michele Zito 001 (ACSC, 2005)

Total domination of random regular graphs. - William Duckworth (Australas. J Comb., 2005)

Large k-independent sets of regular graphs. - Mihalis Beis; William Duckworth; Michele Zito 001 (Electron. Notes Discret. Math., 2005)

On the approximability of the maximum induced matching problem. - William Duckworth; David F. Manlove; Michele Zito 001 (J. Discrete Algorithms, 2005)

Randomized greedy algorithms for finding small k-dominating sets of regular graphs. - William Duckworth; Bernard Mans (Random Struct. Algorithms, 2005)

On the Independent Domination Number of Random Regular Graphs. - William Duckworth; Nicholas C. Wormald (Comb. Probab. Comput., 2006)

Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs. - William Duckworth; Michele Zito 001 (MFCS, 2007)

Packing vertices and edges in random regular graphs. - Mihalis Beis; William Duckworth; Michele Zito 001 (Random Struct. Algorithms, 2008)

Connected domination of regular graphs. - William Duckworth; Bernard Mans (Discret. Math., 2009)

Small maximal matchings of random cubic graphs. - Hilda Assiyatun; William Duckworth (J. Graph Theory, 2009)

Large independent sets in random regular graphs. - William Duckworth; Michele Zito 001 (Theor. Comput. Sci., 2009)

Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. - William Duckworth; Nicholas C. Wormald (Electron. J. Comb., 2010)

Deblurring as a Defense against Adversarial Attacks. - William Duckworth; Weixian Liao; Wei Yu 002 (CloudNet, 2023)