Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominic Welsh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2006
[b2]John M. Talbot, Dominic J. A. Welsh:
Complexity and cryptography - an introduction. Cambridge University Press 2006, ISBN 978-0-521-61771-0, pp. I-XII, 1-292- 1998
- [b1]Dominic J. A. Welsh:
Codes and cryptography. Oxford University Press 1998, ISBN 978-0-19-853287-3, pp. I-IX, 1-257
Journal Articles
- 2013
- [j28]Lisa Lowrance, James G. Oxley, Charles Semple
, Dominic Welsh:
On properties of almost all matroids. Adv. Appl. Math. 50(1): 115-124 (2013) - [j27]Dillon Mayhew, Dominic Welsh:
On the number of sparse paving matroids. Adv. Appl. Math. 50(1): 125-131 (2013) - 2012
- [j26]D. J. A. Welsh, Koko K. Kayibi:
Corrigendum to "A linking polynomial of two matroids" [Adv. in Appl. Math. 32 (1-2) (2004) 391-419]. Adv. Appl. Math. 49(1): 78-79 (2012) - 2011
- [j25]Dillon Mayhew, Mike Newman, Dominic Welsh, Geoff Whittle:
On the asymptotic proportion of connected matroids. Eur. J. Comb. 32(6): 882-890 (2011) - 2010
- [j24]Olivier Bernardi, Marc Noy, Dominic Welsh:
Growth constants of minor-closed classes of graphs. J. Comb. Theory, Ser. B 100(5): 468-484 (2010) - 2008
- [j23]Charles Semple, Dominic Welsh:
Negative Correlation in Graphs and Matroids. Comb. Probab. Comput. 17(3): 423-435 (2008) - 2005
- [j22]Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh:
Random planar graphs. J. Comb. Theory, Ser. B 93(2): 187-205 (2005) - 2004
- [j21]Joseph P. S. Kung, Marc Noy, Dominic Welsh:
Special issue on the Tutte polynomial. Adv. Appl. Math. 32(1-2): 1-2 (2004) - [j20]Dominic Welsh:
W.T. (Bill) Tutte - in memoriam. Adv. Appl. Math. 32(1-2): 3-4 (2004) - [j19]D. J. A. Welsh, Koko K. Kayibi:
A linking polynomial of two matroids. Adv. Appl. Math. 32(1-2): 391-419 (2004) - 2002
- [j18]James G. Oxley, Dominic J. A. Welsh:
Chromatic, Flow And Reliability Polynomials: The Complexity Of Their Coefficients. Comb. Probab. Comput. 11(4): 403-426 (2002) - [j17]Andrew J. Goodall, Dominic J. A. Welsh:
On the Parity of Colourings and Flows. J. Comb. Theory, Ser. B 84(2): 364-365 (2002) - 2000
- [j16]Steven D. Noble, D. J. A. Welsh:
Knot graphs. J. Graph Theory 34(1): 100-111 (2000) - 1999
- [j15]Dominic Welsh:
The Tutte polynomial. Random Struct. Algorithms 15(3-4): 210-228 (1999) - 1997
- [j14]David B. Massey, Rodica Simion, Richard P. Stanley, Dirk L. Vertigan, Dominic J. A. Welsh, Günter M. Ziegler:
Lê Numbers of Arrangements and Matroid Identities. J. Comb. Theory, Ser. B 70(1): 118-133 (1997) - 1995
- [j13]Noga Alon, Alan M. Frieze, Dominic Welsh:
Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Random Struct. Algorithms 6(4): 459-478 (1995) - 1994
- [j12]D. J. A. Welsh:
Randomised Approximation in the Tutte Plane. Comb. Probab. Comput. 3: 137-143 (1994) - [j11]D. J. A. Welsh:
The computational complexity of knot and matroid polynomials. Discret. Math. 124(1-3): 251-269 (1994) - [j10]D. J. A. Welsh:
The random cluster process. Discret. Math. 136(1-3): 373-390 (1994) - 1992
- [j9]Dirk Vertigan, Dominic J. A. Welsh:
The Compunational Complexity of the Tutte Plane: the Bipartite Case. Comb. Probab. Comput. 1: 181-187 (1992) - [j8]James G. Oxley, Dominic J. A. Welsh:
Tutte polynomials computable in polynomial time. Discret. Math. 109(1-3): 185-192 (1992) - 1989
- [j7]A. D. Petford, D. J. A. Welsh:
A randomised 3-colouring algorithm. Discret. Math. 74(1-2): 253-261 (1989) - 1983
- [j6]D. J. A. Welsh:
Randomised algorithms. Discret. Appl. Math. 5(1): 133-145 (1983) - 1982
- [j5]P. N. Walton, D. J. A. Welsh:
Tangential 1-blocks over GF(3). Discret. Math. 40(2-3): 319-320 (1982) - 1973
- [j4]F. D. J. Dunstan, D. J. A. Welsh:
A greedy algorithm for solving a certain class of linear programmes. Math. Program. 5(1): 338-353 (1973) - 1972
- [j3]Frank Harary, M. J. Piff, D. J. A. Welsh:
On the automorphism group of a matroid. Discret. Math. 2(2): 163-171 (1972) - 1967
- [j2]D. J. A. Welsh, M. B. Powell:
An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10(1): 85-86 (1967) - 1966
- [j1]D. J. A. Welsh:
Letter to the Editor - Super-Critical Arcs of a PERT Network. Oper. Res. 14(1): 173-174 (1966)
Conference and Workshop Papers
- 2023
- [c5]Dominic Welsh, Sergi Batalla Martinez:
Framework for usage potential for Digital Procurement in the Construction Industry: Digital Procurement in Construction ProjectsPotential for more transparent and effective procurement of maintenance and installation services in the construction industry. ICCTA 2023: 128-136 - 2008
- [c4]Dominic Welsh:
Some Problems on Approximate Counting in Graphs and Matroids. Bonn Workshop of Combinatorial Optimization 2008: 523-544 - 1995
- [c3]J. Eric Bartels, Dominic Welsh:
The Markov Chain of Colourings. IPCO 1995: 373-387 - 1994
- [c2]Noga Alon, Alan M. Frieze, Dominic Welsh:
Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs. FOCS 1994: 24-35 - 1991
- [c1]Dominic Welsh:
Knots and braids: Some algorithmic questions. Graph Structure Theory 1991: 109-123
Informal and Other Publications
- 1994
- [i1]Noga Alon, Alan M. Frieze, Dominic Welsh:
Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Electron. Colloquium Comput. Complex. TR94 (1994)
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-25 01:50 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:
