default search action
William Duckworth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c10]William Duckworth, Weixian Liao, Wei Yu:
Deblurring as a Defense against Adversarial Attacks. CloudNet 2023: 61-67
2010 – 2019
- 2010
- [j16]William Duckworth, Nicholas C. Wormald:
Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j15]William Duckworth, Bernard Mans
:
Connected domination of regular graphs. Discret. Math. 309(8): 2305-2322 (2009) - [j14]Hilda Assiyatun
Small maximal matchings of random cubic graphs. J. Graph Theory 62(4): 293-323 (2009) - [j13]William Duckworth, Michele Zito:
Large independent sets in random regular graphs. Theor. Comput. Sci. 410(50): 5236-5243 (2009) - 2008
- [j12]Mihalis Beis, William Duckworth, Michele Zito:
Packing vertices and edges in random regular graphs. Random Struct. Algorithms 32(1): 20-37 (2008) - 2007
- [c9]William Duckworth, Michele Zito:
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs. MFCS 2007: 56-66 - 2006
- [j11]William Duckworth, Nicholas C. Wormald:
On the Independent Domination Number of Random Regular Graphs. Comb. Probab. Comput. 15(4): 513-522 (2006) - 2005
- [j10]William Duckworth:
Total domination of random regular graphs. Australas. J Comb. 33: 279-290 (2005) - [j9]Mihalis Beis, William Duckworth, Michele Zito:
Large k-independent sets of regular graphs. Electron. Notes Discret. Math. 19: 321-327 (2005) - [j8]William Duckworth, David F. Manlove
On the approximability of the maximum induced matching problem. J. Discrete Algorithms 3(1): 79-91 (2005) - [j7]William Duckworth, Bernard Mans
Randomized greedy algorithms for finding small k-dominating sets of regular graphs. Random Struct. Algorithms 27(3): 401-412 (2005) - [c8]Mihalis Beis, William Duckworth, Michele Zito:
Large k-Separated Matchings of Random Regular Graphs. ACSC 2005: 175-182 - 2004
- [c7]William Duckworth:
Small Edge Dominating Sets of Regular Graphs. CATS 2004: 43-55 - 2003
- [j6]William Duckworth:
Maximum 2-independent sets of random cubic graphs. Australas. J Comb. 27: 63-80 (2003) - [j5]William Duckworth, Nicholas C. Wormald, Michele Zito:
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. J. Discrete Algorithms 1(1): 67-76 (2003) - [c6]William Duckworth, Bernard Mans
Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs. CIAC 2003: 83-95 - [c5]William Duckworth, Michele Zito:
Large 2-Independent Sets of Regular Graphs. CATS 2003: 223-235 - 2002
- [j4]William Duckworth:
Minimum Connected Dominating Sets of Random Cubic Graphs. Electron. J. Comb. 9(1) (2002) - [j3]William Duckworth, Nicholas C. Wormald:
Minimum independent dominating sets of random cubic graphs. Random Struct. Algorithms 21(2): 147-161 (2002) - [c4]William Duckworth, Bernard Mans
On the Connected Domination Number of Random Regular Graphs. COCOON 2002: 210-219 - [c3]Mihalis Beis, William Duckworth, Michele Zito:
Packing Edges in Random Regular Graphs. MFCS 2002: 118-130 - [c2]William Duckworth, Bernard Mans
Small k-Dominating Sets of Regular Graphs. RANDOM 2002: 126-138 - 2001
- [j2]William Duckworth, Paul E. Dunne
Leafy spanning trees in hypercubes. Appl. Math. Lett. 14(7): 801-804 (2001) - 2000
- [j1]William Duckworth, Michele Zito:
Sparse Hypercube 3-spanners. Discret. Appl. Math. 103(1-3): 289-295 (2000) - [c1]William Duckworth, Nicholas C. Wormald, Michele Zito:
Maximum Induced Matchings of Random Cubic Graphs. COCOON 2000: 34-43
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-29 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: