William Duckworth

According to our database, William Duckworth authored at least 26 papers between 2000 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Deblurring as a Defense against Adversarial Attacks.

William Duckworth, Weixian Liao, Wei Yu

Proceedings of the 12th IEEE International Conference on Cloud Networking, 2023

2010

Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs.

William Duckworth, Nicholas C. Wormald

Electron. J. Comb., 2010

2009

Large independent sets in random regular graphs.

William Duckworth, Michele Zito

Theor. Comput. Sci., 2009

Small maximal matchings of random cubic graphs.

Hilda Assiyatun, William Duckworth

J. Graph Theory, 2009

Connected domination of regular graphs.

William Duckworth, Bernard Mans

Discret. Math., 2009

2008

Packing vertices and edges in random regular graphs.

Mihalis Beis, William Duckworth, Michele Zito

Random Struct. Algorithms, 2008

2007

Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs.

William Duckworth, Michele Zito

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

On the Independent Domination Number of Random Regular Graphs.

William Duckworth, Nicholas C. Wormald

Comb. Probab. Comput., 2006

2005

Randomized greedy algorithms for finding small <i>k</i>-dominating sets of regular graphs.

William Duckworth, Bernard Mans

Random Struct. Algorithms, 2005

On the approximability of the maximum induced matching problem.

William Duckworth, David F. Manlove, Michele Zito

J. Discrete Algorithms, 2005

Large k-independent sets of regular graphs.

Mihalis Beis, William Duckworth, Michele Zito

Electron. Notes Discret. Math., 2005

Total domination of random regular graphs.

William Duckworth

Australas. J Comb., 2005

Large k-Separated Matchings of Random Regular Graphs.

Mihalis Beis, William Duckworth, Michele Zito

Proceedings of the Computer Science 2005, 2005

2004

Small Edge Dominating Sets of Regular Graphs.

William Duckworth

Proceedings of Computing: The Australasian Theory Symposium, 2004

2003

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations.

William Duckworth, Nicholas C. Wormald, Michele Zito

J. Discrete Algorithms, 2003

Large 2-Independent Sets of Regular Graphs.

William Duckworth, Michele Zito

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

Maximum 2-independent sets of random cubic graphs.

William Duckworth

Australas. J Comb., 2003

Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs.

William Duckworth, Bernard Mans

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Minimum independent dominating sets of random cubic graphs.

William Duckworth, Nicholas C. Wormald

Random Struct. Algorithms, 2002

Minimum Connected Dominating Sets of Random Cubic Graphs.

William Duckworth

Electron. J. Comb., 2002

Small k-Dominating Sets of Regular Graphs.

William Duckworth, Bernard Mans

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

Packing Edges in Random Regular Graphs.

Mihalis Beis, William Duckworth, Michele Zito

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

On the Connected Domination Number of Random Regular Graphs.

William Duckworth, Bernard Mans

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Leafy spanning trees in hypercubes.

William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito

Appl. Math. Lett., 2001

2000

Sparse Hypercube 3-spanners.

William Duckworth, Michele Zito

Discret. Appl. Math., 2000

Maximum Induced Matchings of Random Cubic Graphs.

William Duckworth, Nicholas C. Wormald, Michele Zito

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000