William Duckworth

发表

Connected domination of regular graphs

Bernard Mans, William Duckworth, B. Mans, 2009, Discret. Math..

Leafy spanning trees in hypercubes

William Duckworth, Alan Gibbons, Michele Zito, 2001, Applied Mathematics Letters.

Exploration of Machine Learning Approaches to Predict Pavement Performance

William Duckworth, Cindy Corritore, Nalini Govindarajulu, 2018 .

On the Independent Domination Number of Random Regular Graphs

William Duckworth, Nicholas C. Wormald, N. Wormald, 2006, Combinatorics, Probability and Computing.

Pavement Performance: Approaches Using Predictive Analytics

William Duckworth, Ravi Nath, 2018 .

Small Edge Dominating Sets of Regular Graphs

William Duckworth, 2004, Electron. Notes Theor. Comput. Sci..

A creative approach to music fundamentals : with CD-ROM

William Duckworth, 2004 .

An Assessment of the Models to Predict Pavement Performance

William Duckworth, Ravi Nath, Victor Ekpoke, 2018 .

On the Connected Domination Number of Random Regular Graphs

Bernard Mans, William Duckworth, 2002, COCOON.

Minimum Connected Dominating Sets of Random Cubic Graphs

William Duckworth, 2002, Electron. J. Comb..

Packing Edges in Random Regular Graphs

William Duckworth, Michele Zito, Mihalis Beis, 2002, MFCS.

Maximum Induced Matchings of Random Cubic Graphs

William Duckworth, Nicholas C. Wormald, Michele Zito, 2000, COCOON.

Small maximal matchings of random cubic graphs

William Duckworth, Hilda Assiyatun, 2009, J. Graph Theory.

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

Bernard Mans, William Duckworth, 2003, CIAC.

Large k-Separated Matchings of Random Regular Graphs

William Duckworth, Michele Zito, Mihalis Beis, 2005, ACSC.

Randomized greedy algorithms for finding small k‐dominating sets of regular graphs

Bernard Mans, William Duckworth, B. Mans, 2005, Random Struct. Algorithms.

Maximum 2-independent sets of random cubic graphs

William Duckworth, 2003, Australas. J Comb..

Sparse Hypercube 3-spanners

William Duckworth, Michele Zito, 2000, Discret. Appl. Math..

Perceptual and Structural Implications of “Virtual” Music on the Web

William Duckworth, 2003, Annals of the New York Academy of Sciences.

On the approximability of the maximum induced matching problem

David Manlove, William Duckworth, Michele Zito, 2005, J. Discrete Algorithms.

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

William Duckworth, Nicholas C. Wormald, N. Wormald, 2010, Electron. J. Comb..

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

William Duckworth, Nicholas C. Wormald, Michele Zito, 2003, J. Discrete Algorithms.

Minimum independent dominating sets of random cubic graphs

William Duckworth, Nicholas C. Wormald, N. Wormald, 2002, Random Struct. Algorithms.

Large k-independent sets of regular graphs

William Duckworth, Michele Zito, Mihalis Beis, 2005, Electron. Notes Discret. Math..

Large independent sets in random regular graphs

William Duckworth, Michele Zito, 2009, Theor. Comput. Sci..

Packing vertices and edges in random regular graphs

William Duckworth, Michele Zito, Mihalis Beis, 2008, Random Struct. Algorithms.

Large 2-Independent Sets of Regular Graphs

William Duckworth, Michele Zito, 2003, Electron. Notes Theor. Comput. Sci..

Small k-Dominating Sets of Regular Graphs

Bernard Mans, William Duckworth, 2002, RANDOM.

Virtual Music: How the Web Got Wired for Sound

William Duckworth, 2005 .

Total domination of random regular graphs

William Duckworth, 2005, Australas. J Comb..

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

William Duckworth, Michele Zito, 2007, MFCS.

Maximum induced matchings of random cubic graphs

William Duckworth, Nicholas C. Wormald, N. Wormald, 2002 .

Packing vertices and edges in random regular graphs

William Duckworth, Mihalis Beis, M. Zito, 2008 .