


\newcommand\cl[1]{\smallskip\goodbreak\centerline{#1}\nobreak\smallskip\nobreak}


\begin{thebibliography}{1001}
%\normalsize
\cl{1962}
\bibitem{NMR0139535}
J.~M. Hammersley and D.~J.~A. Welsh.
\newblock Further results on the rate of convergence to the connective constant
  of the hypercubical lattice.
\newblock {\em Quart. J. Math. Oxford Ser. (2)}, 13:108--110, 1962.

\cl{1964}
\bibitem{NMRDPhil-thesis}
D.~J.~A. Welsh.
\newblock {\em Topics in Stochastic Processes with special reference to First Passage Percolation Theory}.
\newblock D.Phil.\ Thesis, University of Oxford, 1964, 131 pp.

\cl{1965}
\bibitem{NMR0198576}
J.~M. Hammersley and D.~J.~A. Welsh.
\newblock First-passage percolation, subadditive processes, stochastic
  networks, and generalized renewal theory.
\newblock In {\em Bernoulli, Bayes, Laplace Anniversary Volume}, pages 61--110. Springer, New York,
  1965.

\bibitem{NMR0193695}
R.~W. Morgan and D.~J.~A. Welsh.
\newblock A two-dimensional {P}oisson growth process.
\newblock {\em J. Roy. Statist. Soc. Ser. B}, 27:497--504, 1965.

\bibitem{NMRpert1}
D.~J.~A. Welsh.
\newblock  Letter to the Editor: Errors introduced by a PERT assumption. 
\newblock {\em Operat. Res.}, {13}:141--143, 1965.

\cl{1966}
\bibitem{NMRpert2}
D.~J.~A. Welsh.
\newblock Letter to the Editor: Super-critical arcs of a PERT network.
\newblock  {\em Operat. Res.} {14}:173--174, 1966.

\bibitem{NMR0204112}
J.~A. Bondy and D.~J.~A. Welsh.
\newblock A note on the monomer dimer problem.
\newblock {\em Proc. Cambridge Philos. Soc.}, 62:503--505, 1966.

\cl{1967}
\bibitem{NMR0225676}
D.~J.~A. Welsh.
\newblock On dependence in matroids.
\newblock {\em Canad. Math. Bull.}, 10:599--603, 1967.

\bibitem{NMRwp}
D.~J.~A. Welsh and M.~B. Powell. 
\newblock An upper bound for the chromatic number
  of a graph and its application to timetabling problems.
\newblock {\em The Computer J.}, 10:85--86, 1967.



\cl{1968}
\bibitem{NMR0238713}
D.~J.~A. Welsh.
\newblock Some applications of a theorem of {R}ado.
\newblock {\em Mathematika}, 15:199--203, 1968.

\bibitem{NMR0227038}
D.~J.~A. Welsh.
\newblock Kruskal's theorem for matroids.
\newblock {\em Proc. Cambridge Philos. Soc.}, 64:3--4, 1968.

\cl{1969}
\bibitem{NMR0263666}
F. Harary and D.~J.~A. Welsh.
\newblock Matroids versus graphs.
\newblock In {\em The {M}any {F}acets of {G}raph {T}heory ({P}roc. {C}onf.,
  {W}estern {M}ich. {U}niv., {K}alamazoo, {M}ich., 1968)}, 
  Lecture Notes in Math., volume 110, pages 155--170. Springer, New York,
  1969.

\bibitem{NMR0252249}
D.~J.~A. Welsh.
\newblock Transversal theory and matroids.
\newblock {\em Canadian J. Math.}, 21:1323--1330, 1969.

\bibitem{NMR0238723}
D.~ J.~A. Welsh.
\newblock A bound for the number of matroids.
\newblock {\em J. Combin. Theory}, 6:313--316, 1969.

\bibitem{NMR0237368}
D.~J.~A. Welsh.
\newblock Euler and bipartite matroids.
\newblock {\em J. Combin. Theory}, 6:375--377, 1969.

\bibitem{NMR0236042}
D.~J.~A. Welsh.
\newblock On the hyperplanes of a matroid.
\newblock {\em Proc. Cambridge Philos. Soc.}, 65:11--18, 1969.

\cl{1970}
\bibitem{NMR0285450}
B.~Manvel, P.~K. Stockmeyer, and D.~J.~A. Welsh.
\newblock On removing a point of a digraph.
\newblock {\em Studia Sci. Math. Hungar.}, 5:299--301, 1970.

\bibitem{NMR0260049}
D.~J.~A. Welsh.
\newblock Probability theory and its applications.
\newblock In {\em Mathematics {A}pplied to {P}hysics}, pages 465--561.
  Springer, New York,  1970.

\bibitem{NMR0258663}
D.~J.~A. Welsh.
\newblock On matroid theorems of {E}dmonds and {R}ado.
\newblock {\em J. London Math. Soc. (2)}, 2:251--256, 1970.

\bibitem{NMR0258662}
M.~J. Piff and D.~J.~A. Welsh.
\newblock On the vector representation of matroids.
\newblock {\em J. London Math. Soc. (2)}, 2:284--288, 1970.

\cl{1971}
\bibitem{NMR0325414}
D.~J.~A. Welsh.
\newblock Matroids and block designs.
\newblock In {\em Th\'{e}orie des Matro\"{\i}des ({R}encontre
  {F}ranco-{B}ritannique, {B}rest, 1970)}, Lecture
  Notes in Math., volume 211, pages 95--106. Springer, Berlin, 1971.

\bibitem{NMR0304213}
D.~J.~A. Welsh.
\newblock Related classes of set functions.
\newblock In {\em Studies in {P}ure {M}athematics ({P}resented to {R}ichard
  {R}ado)}, pages 261--269. Academic Press, London, 1971.

\bibitem{NMR0286690}
J.~A. Bondy and D.~J.~A. Welsh.
\newblock Some results on transversal matroids and constructions for
  identically self-dual matroids.
\newblock {\em Quart. J. Math. Oxford Ser. (2)}, 22:435--451, 1971.

\bibitem{NMR0285403}
D.~J.~A. Welsh.
\newblock Generalized versions of {H}all's theorem.
\newblock {\em J. Combin. Theory Ser. B}, 10:95--101, 1971.

\bibitem{NMR0282867}
M.~J. Piff and D.~J.~A. Welsh.
\newblock The number of combinatorial geometries.
\newblock {\em Bull. London Math. Soc.}, 3:55--56, 1971.

\bibitem{NMRox1971}
D.~J.~A. Welsh (ed.).
\newblock {\em Combinatorial {M}athematics and its {A}pplications ({P}roc.
  {C}onf., {O}xford, 1969)}.
 \newblock Academic Press, London,  1971.

\bibitem{NMR0278975}
D.~J.~A. Welsh.
\newblock Combinatorial problems in matroid theory.
\newblock In {\em Combinatorial {M}athematics and its {A}pplications ({P}roc.
  {C}onf., {O}xford, 1969)}, pages 291--306. Academic Press, London,
  1971.
  
  \cl{1972}
\bibitem{NMR0340057}
F.~D.~J. Dunstan, A.~W. Ingleton, and D.~J.~A. Welsh.
\newblock Supermatroids.
\newblock In {\em Combinatorics ({P}roc. {C}onf., {O}xford, 1972)}, pages 72--122. Inst. Math. Appl.,
  Southend-on-Sea, 1972.

\bibitem{NMR0317974}
J.~de~Sousa and D.~J.~A. Welsh.
\newblock A characterisation of binary transversal structures.
\newblock {\em J. Math. Anal. Appl.}, 40:55--59, 1972.

\bibitem{NMR0297639}
F.~Harary, M.~J. Piff, and D.~J.~A. Welsh.
\newblock On the automorphism group of a matroid.
\newblock {\em Discrete Math.}, 2:163--171, 1972.

\bibitem{NMRox1973}
D.~J.~A. Welsh and D.~R. Woodall  (eds.).
\newblock {\em Combinatorics ({P}roc.
  {C}onf., {O}xford, 1972)}.
\newblock Institute of Mathematics and its Applications, Southend-on-Sea, 1972.


\cl{1973}
\bibitem{NMR0335311}
F.~D.~J. Dunstan and D.~J.~A. Welsh.
\newblock A greedy algorithm for solving a certain class of linear programmes.
\newblock {\em Math. Programming}, 5:338--353, 1973.

\cl{1975}
\bibitem{NMR0409215}
R.~A. Main and D.~J.~A. Welsh.
\newblock A note on matroids and block designs.
\newblock {\em J. Austral. Math. Soc.}, 20:54--58, 1975.

\bibitem{NMR0376378}
P.~D. Seymour and D.~J.~A. Welsh.
\newblock Combinatorial applications of an inequality from statistical
  mechanics.
\newblock {\em Math. Proc. Cambridge Philos. Soc.}, 77:485--495, 1975.

\cl{1976}
\bibitem{NMR0459007}
E.~C. Milner and D.~J.~A. Welsh.
\newblock On the computational complexity of graph theoretical properties.
\newblock In {\em Proceedings of the {F}ifth {B}ritish {C}ombinatorial
  {C}onference ({U}niv. {A}berdeen, {A}berdeen, 1975)}, 
  Congress. Numer., volume XV, pages 471--487, 1976.

\bibitem{NMR0427112}
D.~J.~A. Welsh.
\newblock {\em Matroid Theory}. Lond. Math. Soc.  Monographs, volume 8,
\newblock Academic Press, London, 1976.

\cl{1978}
\bibitem{NMR0494572}
P.~D. Seymour and D.~J.~A. Welsh.
\newblock Percolation probabilities on the square lattice.
\newblock {\em Ann. Discrete Math.}, 3:227--245, 1978.


\cl{1979}
\bibitem{NMR0561312}
D.~J.~A. Welsh.
\newblock Colouring problems and matroids.
\newblock In {\em Surveys in Combinatorics ({P}roc. {S}eventh {B}ritish
  {C}ombinatorial {C}onf., {C}ambridge, 1979)}, London Math.
  Soc. Lecture Note Ser., volume 38, pages 229--257. Cambridge Univ. Press, Cambridge, 1979.

\bibitem{NMR0540790}
J.~G. Oxley and D.~J.~A. Welsh.
\newblock On some percolation results of {J}. {M}. {H}ammersley.
\newblock {\em J. Appl. Probab.}, 16:526--540, 1979.

\bibitem{NMR0538059}
J.~G. Oxley and D.~J.~A. Welsh.
\newblock The {T}utte polynomial and percolation.
\newblock In {\em Graph Theory and Related Topics ({P}roc. {C}onf., {U}niv.
  {W}aterloo, {W}aterloo, {O}nt., 1977)}, pages 329--339. Academic Press, New
  York-London, 1979.

\cl{1980}
\bibitem{NMR0582924}
D.~J.~A. Welsh.
\newblock Colourings, flows and projective geometry.
\newblock {\em Nieuw Arch. Wisk. (3)}, 28:159--176, 1980.

\bibitem{NMR0581990}
P.~N. Walton and D.~J.~A. Welsh.
\newblock On the chromatic number of binary matroids.
\newblock {\em Mathematika}, 27:1--9, 1980.

\bibitem{NMR0549295}
G.~C. Robinson and D.~J.~A. Welsh.
\newblock The computational complexity of matroid properties.
\newblock {\em Math. Proc. Cambridge Philos. Soc.}, 87:29--45, 1980.

\cl{1981}
\bibitem{NMR0614797}
B.~M.~I. Rands and D.~J.~A. Welsh.
\newblock Animals, trees and renewal sequences.
\newblock {\em IMA J. Appl. Math.}, 27:1--17, 1981.

\cl{1982}
\bibitem{NMR0863014}
D.~J.~A. Welsh.
\newblock Matroids and combinatorial optimisation.
\newblock In {\em Matroid Theory and its Applications}, pages 323--416.
  Liguori, Naples, 1982.

\bibitem{NMR0677510}
D.~J.~A. Welsh.
\newblock Problems in computational complexity.
\newblock {\em Shiva Math. Ser.}, 6:75--85, 1982.

\bibitem{NMR0676736}
P.~N. Walton and D.~J.~A. Welsh.
\newblock Tangential {$1$}-blocks over {${\rm GF}(3)$}.
\newblock {\em Discrete Math.}, 40:319--320, 1982.

\bibitem{NMR0671913}
A.~J. Mansfield and D.~J.~A. Welsh.
\newblock Some colouring problems and their complexity.
\newblock {\em Ann. Discrete Math.}, 13:159--170, 1982.

\bibitem{NMR0667311}
G.~R. Grimmett and D.~J.~A. Welsh.
\newblock Flow in networks with random capacities.
\newblock {\em Stochastics}, 7:205--229, 1982.

\bibitem{NMR0648705}
B.~M.~I. Rands and D.~J.~A. Welsh.
\newblock Corrigendum: ``{A}nimals, trees and renewal sequences''
[IMA {J}.
  {A}ppl. {M}ath. 27:1--17, 1981].
\newblock {\em IMA J. Appl. Math.}, 28:107, 1982.

\cl{1983}
\bibitem{NMR0704809}
P.~J.  Donnelly and D.~J.~A. Welsh.
\newblock Finite particle systems and infection models.
\newblock {\em Math. Proc. Cambridge Philos. Soc.}, 94:167--182, 1983.

\bibitem{NMR0678823}
D.~J.~A. Welsh.
\newblock Randomised algorithms.
\newblock {\em Discrete Appl. Math.}, 5:133--145, 1983.

\cl{1984}
\bibitem{NMR0777170}
P.~J. Donnelly and D.~J.~A. Welsh.
\newblock The antivoter problem: random {$2$}-colourings of graphs.
\newblock In {\em Graph Theory and Combinatorics ({C}ambridge, 1983)}, pages
  133--144. Academic Press, London, 1984.
  
  \cl{1986}
\bibitem{NMR0877782}
D.~J.~A. Welsh.
\newblock Correlated percolation and repulsive particle systems.
\newblock In {\em Stochastic Spatial Processes ({H}eidelberg, 1984)},
 Lecture Notes in Math., volume 1212, pages 300--311. Springer, Berlin, 1986.

\bibitem{NMR0869591}
G.~R. Grimmett and D.~J.~A. Welsh.
\newblock {\em Probability, an Introduction}.
\newblock Clarendon Press, Oxford, 1986.
  
\cl{1988}
 \bibitem{NMR1205396}
D.~J.~A. Welsh.
\newblock Matroids and their applications.
\newblock In {\em Selected Topics in Graph Theory, 3}, pages 43--70. Academic
  Press, San Diego, CA, 1988.

\bibitem{NMR0959137}
D.~J.~A. Welsh.
\newblock {\em Codes and Cryptography}.
\newblock Clarendon Press, Oxford, 1988.

\cl{1989}
\bibitem{NMR0989138}
A.~D. Petford and D.~J.~A. Welsh.
\newblock A randomised {$3$}-colouring algorithm.
\newblock {\em Discrete Math.}, 74: 253--261, 1989.

\cl{1990}
\bibitem{NMRJMH-vol}
G.~R. Grimmett  and D.~J.~A. Welsh (eds.).
\newblock {\em Disorder in Physical Systems,  A Volume in Honour of J.~ M. Hammersley}.
\newblock Clarendon Press, Oxford, 1990.

\bibitem{NMR1064568}
D.~J.~A. Welsh.
\newblock The computational complexity of some classical problems from
  statistical physics.
\newblock In {\em Disorder in Physical Systems,  A Volume in Honour of J.~ M. Hammersley}, pages
  307--321. Clarendon Press, Oxford, 1990.

\bibitem{NMR1049758}
F.~Jaeger, D.~L. Vertigan, and D.~J.~A. Welsh.
\newblock On the computational complexity of the {J}ones and {T}utte
  polynomials.
\newblock {\em Math. Proc. Cambridge Philos. Soc.}, 108:35--53, 1990.

\cl{1991}
\bibitem{NMR1242597}
D.~J.~A. Welsh.
\newblock Colouring and knot polynomials.
\newblock In {\em Recent Developments and Applications in Mathematics and
  Computer Science ({T}rieste, 1990)}, pages 112--131. World Sci. Publ., River
  Edge, NJ, 1991.
  
  \cl{1992}
  \bibitem{NMR1218230}
D.~J.~A. Welsh.
\newblock On the number of knots and links.
\newblock In {\em Sets, Graphs and Numbers ({B}udapest, 1991)},
  Colloq. Math. Soc. J\'{a}nos Bolyai, volume 60, pages 713--718. North-Holland,
  Amsterdam, 1992.

\bibitem{NMR1192381}
J.~G. Oxley and D.~J.~A. Welsh.
\newblock Tutte polynomials computable in polynomial time.
\newblock {\em Discrete Math.}, 109:185--192, 1992.


\bibitem{NMR1179248}
D.~L. Vertigan and D.~J.~A. Welsh.
\newblock The computational complexity of the {T}utte plane: the bipartite
  case.
\newblock {\em Combin. Probab. Comput.}, 1:181--187, 1992.

\cl{1993}
\bibitem{NMR1245272}
D.~J.~A. Welsh.
\newblock {\em Complexity: Knots, Colourings and Counting}.  London Math. Soc. Lecture Note Series, 
volume 186.
\newblock Cambridge Univ. Press, Cambridge, 1993.

\bibitem{NMR1234408}
D.~J.~A. Welsh.
\newblock Percolation in the random cluster process and {$Q$}-state {P}otts
  model.
\newblock {\em J. Phys. A}, 26:2471--2483, 1993.

\bibitem{NMR1224698}
D.~J.~A. Welsh.
\newblock Knots and braids: some algorithmic questions.
\newblock In {\em Graph Structure Theory ({S}eattle, {WA}, 1991)}, 
Contemp. Math., volume 147, pages 109--123. Amer. Math. Soc., Providence, RI,
  1993.

\bibitem{NMR1217989}
D.~J.~A. Welsh.
\newblock The complexity of knots.
\newblock {\em Ann. Discrete
  Math.}, 55:159--171, 1993.

\bibitem{NMR1188822}
W. Schw\"{a}rzler and D.~J.~A. Welsh.
\newblock Knots, matroids and the {I}sing model.
\newblock {\em Math. Proc. Cambridge Philos. Soc.}, 113:107--139, 1993.

\cl{1994}
\bibitem{NMR1258858}
D.~J.~A. Welsh.
\newblock The computational complexity of knot and matroid polynomials.
\newblock {\em Discrete Math.}, 124:251--269, 1994.

\bibitem{NMR1489239}
N. Alon, A. Frieze, and D.~J.~A. Welsh.
\newblock Polynomial time randomised approximation schemes for the {T}utte
  polynomial of dense graphs.
\newblock In {\em 35th {A}nnual {S}ymposium on {F}oundations of {C}omputer
  {S}cience ({S}anta {F}e, {NM}, 1994)}, pages 24--35. IEEE Comput. Soc. Press,
  Los Alamitos, CA, 1994.

\bibitem{NMR1320742}
D.~J.~A. Welsh.
\newblock Random generation of polymer configurations.
\newblock In {\em Probability, Statistics and Optimisation}, pages 65--77. Wiley, Chichester, 1994.

\bibitem{NMR1313294}
D.~J.~A. Welsh.
\newblock The random cluster process.
\newblock {\em Discrete Math.}, 136:373--390. 1994.

\bibitem{NMR1285695}
D.~J.~A. Welsh.
\newblock Randomised approximation in the {T}utte plane.
\newblock {\em Combin. Probab. Comput.}, 3:137--143, 1994.

\cl{1995}
\bibitem{NMR1380526}
D.~J.~A. Welsh.
\newblock Randomised approximation schemes for {T}utte-{G}r\"{o}thendieck
  invariants.
\newblock In {\em Discrete Probability and Algorithms ({M}inneapolis, {MN},
  1993)}, IMA Vol. Math. Appl., volume 72, pages 133--148. Springer,
  New York, 1995.

\bibitem{NMR1373697}
L.~Lov\'{a}sz, L.~Pyber, D.~J.~A. Welsh, and G.~M. Ziegler.
\newblock Combinatorics in pure mathematics.
\newblock In {\em Handbook of Combinatorics, {V}ol. 1, 2}, pages 2039--2082.
  Elsevier, Amsterdam, 1995.

\bibitem{NMR1373693}
C.~D. Godsil, M.~Gr\"{o}tschel, and D.~J.~A. Welsh.
\newblock Combinatorics in statistical physics.
\newblock In {\em Handbook of Combinatorics, {V}ol. 1, 2}, pages 1925--1954.
  Elsevier, Amsterdam, 1995.

\bibitem{NMR1373665}
D.~J.~A. Welsh.
\newblock Matroids: fundamental concepts.
\newblock In {\em Handbook of Combinatorics, {V}ol. 1, 2}, pages 481--526.
  Elsevier, Amsterdam, 1995.

\bibitem{NMR1368847}
N. Alon, A. Frieze, and D.~J.~A. Welsh.
\newblock Polynomial time randomized approximation schemes for
  {T}utte-{G}r\"{o}thendieck invariants: the dense case.
\newblock {\em Random Structures Algorithms}, 6:459--478, 1995.

\bibitem{NMR1367996}
J.~E. Bartels and D.~J.~A. Welsh.
\newblock The {M}arkov chain of colourings.
\newblock In {\em Integer Programming and Combinatorial Optimization
  ({C}openhagen, 1995)}, Lecture Notes in Comput. Sci., volume 920,
  pages 373--387. Springer, Berlin, 1995.
  
  \cl{1996}
  \bibitem{NMR1411698}
L. Ch\'{a}vez~Lomel\'{\i} and D.~J.~A. Welsh.
\newblock Randomised approximation of the number of bases.
\newblock In {\em Matroid Theory ({S}eattle, {WA}, 1995)}, 
  Contemp. Math., volume 197, pages 371--376. Amer. Math. Soc., Providence, RI, 1996.

\bibitem{NMR1395871}
D.~J.~A. Welsh.
\newblock Counting colourings and flows in random graphs.
\newblock In {\em Combinatorics, {P}aul {E}rd\H{o}s is Eighty, {V}ol. 2
  ({K}eszthely, 1993)}, Bolyai Soc. Math. Stud., volume 2, pages
  491--505. J\'{a}nos Bolyai Math. Soc., Budapest, 1996.

\bibitem{NMR1393702}
A. Denise, M. Vasconcellos, and D.~J.~A. Welsh.
\newblock The random planar graph.
\newblock {\em Congr. Math.}, 113:61--79. 1996
\newblock (Festschrift for C. St. J. A. Nash-Williams).

\cl{1997}
\bibitem{NMR1634554}
D.~J.~A. Welsh.
\newblock Knots.
\newblock In {\em Graph Connections}, Oxford Lecture Ser.
  Math. Appl., volume 5, pages 176--193. Oxford Univ. Press, Oxford, 1997.

\bibitem{NMR1477750}
D.~J.~A. Welsh.
\newblock Approximate counting.
\newblock In {\em Surveys in Combinatorics, 1997 ({L}ondon)}, 
  London Math. Soc. Lecture Note Ser., volume 241, pages 287--323. Cambridge Univ.
  Press, Cambridge, 1997.

\bibitem{NMR1476472}
D.~J.~A. Welsh.
\newblock Randomised approximation in the {T}utte plane.
\newblock In {\em Combinatorics, Geometry and Probability ({C}ambridge, 1993)},
  pages 549--555. Cambridge Univ. Press, Cambridge, 1997.

\bibitem{NMR1474797}
J.~E. Bartels, J.~Mount, and D.~J.~A. Welsh.
\newblock The polytope of win vectors.
\newblock {\em Ann. Comb.}, 1:1--15, 1997.

\bibitem{NMR1441262}
D.~B. Massey, R. Simion, R.~P. Stanley, D. Vertigan, 
D.~J.~A. Welsh, and G.~M. Ziegler.
\newblock L\^{e} numbers of arrangements and matroid identities.
\newblock {\em J. Combin. Theory Ser. B}, 70:118--133, 1997.

\cl{1998}
\bibitem{NMR1678574}
D.~J.~A. Welsh.
\newblock Percolation and the random cluster model: combinatorial and
  algorithmic problems.
\newblock {\em Algorithms Combin.}, 16:166--194, 1998.
  
\cl{1999}
  \bibitem{NMR1772357}
C.~Merino and D.~J.~A. Welsh.
\newblock Forests, colorings and acyclic orientations of the square lattice.
\newblock {\em Ann. Comb.}, 3:417--429. 1999.

\bibitem{NMR1733134}
D.~J.~A. Welsh and G.~P. Whittle.
\newblock Arrangements, channel assignments, and associated polynomials.
\newblock {\em Adv. in Appl. Math.}, 23:375--406, 1999.

\bibitem{NMR1716762}
D.~J.~A. Welsh.
\newblock The {T}utte polynomial.
\newblock {\em Random Struct. Alg.}, 15:210--228. 1999.


\bibitem{NMR1703438}
S.~D. Noble and D.~J.~A. Welsh.
\newblock A weighted graph polynomial from chromatic invariants of knots.
\newblock {\em Ann. Inst. Fourier (Grenoble)}, 49:1057--1087. 1999.

\cl{2000}
\bibitem{NMR1757953}
D.~J.~A. Welsh and C.~Merino.
\newblock The {P}otts model and the {T}utte polynomial.
\newblock {\em J. Math. Phys.}, 41:1127--1152. 2000.

\bibitem{NMR1753070}
S.~D. Noble and D.~J.~A. Welsh.
\newblock Knot graphs.
\newblock {\em J. Graph Theory}, 34:100--111, 2000.

\cl{2001}
\bibitem{NMR1884264}
D.~J.~A. Welsh and A. Gale.
\newblock The complexity of counting problems.
\newblock In {\em Aspects of Complexity ({K}aikoura, 2000)}, 
  De Gruyter Ser. Log. Appl., volume 4, pages 115--153. De Gruyter, Berlin, 2001.
  
  \cl{2002}
  \bibitem{NMR1918725}
J.~G. Oxley and D.~J.~A. Welsh.
\newblock Chromatic, flow and reliability polynomials: the complexity of their
  coefficients.
\newblock {\em Combin. Probab. Comput.}, 11:403--426, 2002.

\bibitem{NMR1889264}
A.~J. Goodall and D.~J.~A. Welsh.
\newblock On the parity of colourings and flows.
\newblock {\em J. Combin. Theory Ser. B}, 84:364--365, 2002.

\cl{2003}
\bibitem{NMR2000032}
D.~J.~A. Welsh.
\newblock Crispin {S}t. {J}. {A}. {N}ash-{W}illiams (1932--2001).
\newblock {\em Bull. London Math. Soc.}, 35:829--844, 2003.

\cl{2004}
\bibitem{NMR2037638}
D.~J.~A. Welsh and K.~K. Kayibi.
\newblock A linking polynomial of two matroids.
\newblock {\em Adv. in Appl. Math.}, 32:391--419. 2004.

\bibitem{NMR2037139}
D.~J.~A. Welsh.
\newblock W. {T}. ({B}ill) {T}utte---in memoriam.
\newblock {\em Adv. in Appl. Math.}, 32:3--4. 2004.

\cl{2005}
\bibitem{NMR2174653}
M. Bordewich, M. Freedman, L. Lov\'{a}sz, and D.~J.~A. Welsh.
\newblock Approximate counting and quantum computation.
\newblock {\em Combin. Probab. Comput.}, 14:737--754, 2005.

\bibitem{NMR2117936}
C.~J.~H. McDiarmid, A. Steger, and D.~J.~A. Welsh.
\newblock Random planar graphs.
\newblock {\em J. Combin. Theory Ser. B}, 93:187--205, 2005.

\cl{2006}
\bibitem{NMR2249274}
C.~ J.~H. McDiarmid, A. Steger, and D.~J.~A. Welsh.
\newblock Random graphs from planar and other addable classes.
\newblock {\em Algorithms
  Combin.}, 26:231--246, 2006.

\bibitem{NMR2221458}
J. Talbot and D.~J.~A. Welsh.
\newblock {\em Complexity and Cryptography}.
\newblock Cambridge Univ. Press, Cambridge, 2006.

\cl{2007}
\bibitem{NMR2575343}
G.~R. Grimmett and D.~J.~A. Welsh.
\newblock {J}ohn {M}ichael {H}ammersley, 21 March 1920--2 May 2004.
\newblock {\em Biogr. Mems Fell. R. Soc.}, 53:163--183, 2007.
\newblock Reprinted in {\em Bull. London Math. Soc.}, 41(6):1125--1143, 2009.

\cl{2008}
\bibitem{NMR2410396}
C. Semple and D.~J.~A. Welsh.
\newblock Negative correlation in graphs and matroids.
\newblock {\em Combin. Probab. Comput.}, 17:423--435, 2008.

\cl{2009}
\bibitem{NMR2513330}
D.~J.~A. Welsh.
\newblock Some problems on approximate counting in graphs and matroids.
\newblock In {\em Research Trends in Combinatorial Optimization}, pages
  523--544. Springer, Berlin, 2009.

\cl{2010}
\bibitem{NMR2768788}
D.~J.~A. Welsh.
\newblock Matroids and combinatorial optimisation.
\newblock In {\em Matroid Theory and its Applications},   
C.I.M.E. Summer Sch., volume 83, pages 323--416. Springer, Heidelberg, 2010.

\bibitem{NMR2644234}
O. Bernardi, M. Noy, and D.~J.~A. Welsh.
\newblock Growth constants of minor-closed classes of graphs.
\newblock {\em J. Combin. Theory Ser. B}, 100:468--484, 2010.

\cl{2011}
\bibitem{NMR2821559}
D. Mayhew, M. Newman, D.~J.~A. Welsh, and G. Whittle.
\newblock On the asymptotic proportion of connected matroids.
\newblock {\em European J. Combin.}, 32:882--890, 2011.

\bibitem{NMR2813514}
B. Faller, C. Semple, and D.~J.~A. Welsh.
\newblock Optimizing phylogenetic diversity with ecological constraints.
\newblock {\em Ann. Comb.}, 15:255--266, 2011.

\cl{2012}
\bibitem{NMR2925928}
D.~J.~A. Welsh and K.~K. Kayibi.
\newblock Corrigendum to ``{A} linking polynomial of two matroids'' [{A}dv. in
  {A}ppl. {M}ath. 32:391--419, 2004].
\newblock {\em Adv. in Appl. Math.}, 49:78--79, 2012.

\cl{2013}
\bibitem{NMR2996387}
D. Mayhew and D.~J.~A. Welsh.
\newblock On the number of sparse paving matroids.
\newblock {\em Adv. in Appl. Math.}, 50:125--131, 2013.

\bibitem{NMR2996386}
L. Lowrance, J.~G. Oxley, C. Semple, and D.~J.~A. Welsh.
\newblock On properties of almost all matroids.
\newblock {\em Adv. in Appl. Math.}, 50:115--124, 2013.

\cl{2014}
\bibitem{NMR3243603}
G.~R. Grimmett and D.~J.~A. Welsh.
\newblock {\em Probability, an Introduction}.
\newblock Oxford Univ. Press, Oxford, 2nd edition, 2014.

\cl{2015}
\bibitem{NMR3319869}
C.~J.~H. McDiarmid, C. Semple, and D.~J.~A. Welsh.
\newblock Counting phylogenetic networks.
\newblock {\em Ann. Comb.}, 19:205--224, 2015.


\bibitem{NMR3319858}
C. Semple, D.~J.~A. Welsh, and G. Whittle.
\newblock Special issue in honour of {J}ames {O}xley.
\newblock {\em Ann. Comb.}, 19:1--5, 2015.

\end{thebibliography}
