Dominic Welsh

According to our database, Dominic Welsh authored at least 36 papers between 1966 and 2023.

Collaborative distances:

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

2023

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.

Dominic Welsh, Sergi Batalla Martinez

Proceedings of the 9th International Conference on Computer Technology Applications, 2023

2013

On the number of sparse paving matroids.

Dillon Mayhew, Dominic Welsh

Adv. Appl. Math., 2013

On properties of almost all matroids.

Lisa Lowrance, James G. Oxley, Charles Semple, Dominic Welsh

Adv. Appl. Math., 2013

2012

Corrigendum to "A linking polynomial of two matroids" [Adv. in Appl. Math. 32 (1-2) (2004) 391-419].

D. J. A. Welsh, Koko K. Kayibi

Adv. Appl. Math., 2012

2011

On the asymptotic proportion of connected matroids.

Dillon Mayhew, Mike Newman, Dominic Welsh, Geoff Whittle

Eur. J. Comb., 2011

2010

Growth constants of minor-closed classes of graphs.

Olivier Bernardi, Marc Noy, Dominic Welsh

J. Comb. Theory, Ser. B, 2010

2008

Negative Correlation in Graphs and Matroids.

Charles Semple, Dominic Welsh

Comb. Probab. Comput., 2008

Some Problems on Approximate Counting in Graphs and Matroids.

Dominic Welsh

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2006

Complexity and cryptography - an introduction.

John M. Talbot, Dominic J. A. Welsh

Cambridge University Press, ISBN: 978-0-521-61771-0, 2006

2005

Random planar graphs.

Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh

J. Comb. Theory, Ser. B, 2005

2004

A linking polynomial of two matroids.

D. J. A. Welsh, Koko K. Kayibi

Adv. Appl. Math., 2004

W.T. (Bill) Tutte - in memoriam.

Dominic Welsh

Adv. Appl. Math., 2004

Special issue on the Tutte polynomial.

Joseph P. S. Kung, Marc Noy, Dominic Welsh

Adv. Appl. Math., 2004

2002

On the Parity of Colourings and Flows.

Andrew J. Goodall, Dominic J. A. Welsh

J. Comb. Theory, Ser. B, 2002

Chromatic, Flow And Reliability Polynomials: The Complexity Of Their Coefficients.

James G. Oxley, Dominic J. A. Welsh

Comb. Probab. Comput., 2002

2000

Knot graphs.

Steven D. Noble, D. J. A. Welsh

J. Graph Theory, 2000

1999

The Tutte polynomial.

Dominic Welsh

Random Struct. Algorithms, 1999

1998

Codes and cryptography.

Dominic J. A. Welsh

Oxford University Press, ISBN: 978-0-19-853287-3, 1998

1997

Lê Numbers of Arrangements and Matroid Identities.

David B. Massey, Rodica Simion, Richard P. Stanley, Dirk L. Vertigan, Dominic J. A. Welsh, Günter M. Ziegler

J. Comb. Theory, Ser. B, 1997

1995

Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case.

Noga Alon, Alan M. Frieze, Dominic Welsh

Random Struct. Algorithms, 1995

The Markov Chain of Colourings.

J. Eric Bartels, Dominic Welsh

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case

Noga Alon, Alan M. Frieze, Dominic Welsh

Electron. Colloquium Comput. Complex., 1994

The computational complexity of knot and matroid polynomials.

D. J. A. Welsh

Discret. Math., 1994

The random cluster process.

D. J. A. Welsh

Discret. Math., 1994

Randomised Approximation in the Tutte Plane.

D. J. A. Welsh

Comb. Probab. Comput., 1994

Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs

Noga Alon, Alan M. Frieze, Dominic Welsh

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1992

Tutte polynomials computable in polynomial time.

James G. Oxley, Dominic J. A. Welsh

Discret. Math., 1992

The Compunational Complexity of the Tutte Plane: the Bipartite Case.

Dirk Vertigan, Dominic J. A. Welsh

Comb. Probab. Comput., 1992

1991

Knots and braids: Some algorithmic questions.

Dominic Welsh

Proceedings of the Graph Structure Theory, 1991

1989

A randomised 3-colouring algorithm.

A. D. Petford, D. J. A. Welsh

Discret. Math., 1989

1983

Randomised algorithms.

D. J. A. Welsh

Discret. Appl. Math., 1983

1982

Tangential 1-blocks over GF(3).

P. N. Walton, D. J. A. Welsh

Discret. Math., 1982

1973

A greedy algorithm for solving a certain class of linear programmes.

F. D. J. Dunstan, D. J. A. Welsh

Math. Program., 1973

1972

On the automorphism group of a matroid.

Frank Harary, M. J. Piff, D. J. A. Welsh

Discret. Math., 1972

1967

An upper bound for the chromatic number of a graph and its application to timetabling problems.

D. J. A. Welsh, M. B. Powell

Comput. J., 1967

1966

Letter to the Editor - Super-Critical Arcs of a PERT Network.

D. J. A. Welsh

Oper. Res., 1966