Dominic J. A. Welsh

Dominic J. A. Welsh's AcademicInfluence.com Rankings

Dominic J. A. Welsh

Mathematics

#6939

World Rank

#9525

Historical Rank

Graph Theory

#88

World Rank

#96

Historical Rank

Measure Theory

#1736

World Rank

#2132

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Dominic J. A. Welsh Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Dominic J. A. Welsh's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

An upper bound for the chromatic number of a graph and its application to timetabling problems (1967) (775)
On the computational complexity of the Jones and Tutte polynomials (1990) (453)
Complexity: Knots, Colourings and Counting (1993) (381)
First-Passage Percolation, Subadditive Processes, Stochastic Networks, and Generalized Renewal Theory (1965) (365)
Codes and cryptography (1988) (294)
Percolation probabilities on the square lattice (1978) (243)
The Tutte polynomial (1999) (229)
FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE (1962) (184)
A Spectral Technique for Coloring Random 3-Colorable Graphs (1994) (164)
Random planar graphs (2005) (141)
Monte Carlo Estimates of Percolation Probabilities for Various Lattices (1962) (134)
Probability: An Introduction (1986) (114)
A weighted graph polynomial from chromatic invariants of knots (1999) (112)
The Potts model and the Tutte polynomial (2000) (94)
The Computational Complexity of the Tutte Plane: the Bipartite Case (1992) (86)
Finite particle systems and infection models (1983) (78)
On the asymptotic proportion of connected matroids (2011) (74)
Complexity and cryptography - an introduction (2006) (69)
A randomised 3-colouring algorithm (1989) (65)
A greedy algorithm for solving a certain class of linear programmes (1973) (58)
Combinatorial applications of an inequality from statistical mechanics (1975) (57)
Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case (1995) (55)
On the Vector Representation of Matroids (1970) (55)
Counting Phylogenetic Networks (2015) (52)
Percolation theory and its ramifications (1980) (46)
SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS (1971) (45)
Approximate Counting and Quantum Computation (2005) (45)
The computational complexity of matroid properties (1980) (44)
Euler and bipartite matroids (1969) (44)
Random Graphs from Planar and Other Addable Classes (2006) (43)
Matroids: fundamental concepts (1996) (42)
The Computational Complexity of Some Classical Problems from Statistical Physics (1990) (40)
Tutte polynomials computable in polynomial time (1992) (39)
Kruskal's theorem for matroids (1968) (38)
Matroids versus graphs (1969) (35)
Forests, colorings and acyclic orientations of the square lattice (1999) (34)
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients (2002) (33)
On Matroid Theorems of Edmonds and Rado (1970) (31)
A Two‐Dimensional Poisson Growth Process (1965) (28)
Graph Theory and Theoretical Physics (1970) (27)
On the Number of Combinatorial Geometries (1971) (26)
COMPLETENESS AND REDUCTION IN ALGEBRAIC COMPLEXITY THEORY (Algorithms and Computation in Mathematics 7) By PETER BÜRGISSER: 168 pp., $44.50, ISBN 3-540-66752-0 (Springer, Berlin, 2000). (2002) (25)
On the chromatic number of binary matroids (1980) (23)
A bound for the number of matroids (1969) (23)
Independence theory in combinatorics (1980) (22)
Percolation in the random cluster process and Q-state Potts model (1993) (20)
Negative Correlation in Graphs and Matroids (2008) (19)
Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs (1994) (19)
A characterisation of binary transversal structures (1972) (19)
Flow in networks with random capacities (1982) (18)
Animals, Trees and Renewal Sequences (1981) (18)
SIMULATED ANNEALING: THEORY AND APPLICATIONS (1989) (18)
Growth constants of minor-closed classes of graphs (2010) (17)
Combinatorics in pure mathematics (1996) (16)
A linking polynomial of two matroids (2004) (16)
Knots and braids: Some algorithmic questions (1991) (16)
A note on the monomer dimer problem (1966) (15)
Some Colouring Problems and their Complexity (1982) (14)
Knot graphs (2000) (14)
Arrangements, Channel Assignments, and Associated Polynomials (1999) (14)
Lê Numbers of Arrangements and Matroid Identities (1997) (14)
On the growth rate of minor-closed classes of graphs (2007) (14)
Randomised Approximation in the Tutte Plane (1994) (13)
Disorder in physical systems : a volume in honour of John M. Hammersley on the occasion of his 70th birthday (1990) (13)
Generalized versions of Hall's theorem (1971) (13)
On some percolation results of J. M. Hammersley (1979) (13)
Randomised Approximation Schemes for Tutte-Gröthendieck Invariants (1995) (13)
The Markov Chain of Colourings (1995) (13)
Knots, matroids and the Ising model (1993) (12)
The Complexity of Knots (1993) (11)
Some applications of a theorem of Rado (1968) (11)
COMPUTATIONAL COMPLEXITY (Mathematics and Its Applications Series) (1987) (10)
The computational complexity of knot and matroid polynomials (1994) (10)
THEORY OF COMPUTATIONAL COMPLEXITY (Wiley‐Interscience Series in Discrete Mathematics and Optimization) (2001) (10)
Surveys in Combinatorics: Colouring problems and matroids (1979) (10)
On the hyperplanes of a matroid (1969) (10)
On properties of almost all matroids (2013) (9)
Transversal Theory and Matroids (1969) (9)
Special issue on the Tutte polynomial (2004) (9)
One way functions (2006) (9)
On the automorphism group of a matroid (1972) (7)
The complexity of counting problems (2001) (7)
Complexity and cryptography (2016) (7)
The polytope of win vectors (1997) (7)
On the number of sparse paving matroids (2013) (6)
Tangential 1-blocks over GF(3) (1982) (6)
Correlated percolation and repulsive particle systems (1986) (5)
An upper bound for a percolation constant (1965) (5)
Percolation and the Random Cluster Model: Combinatorial and Algorithmic Problems (1998) (4)
Optimizing Phylogenetic Diversity with Ecological Constraints (2011) (4)
John Michael Hammersley. 21 March 1920 — 2 May 2004 (2007) (4)
Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures (1993) (4)
The random cluster process (1994) (4)
Matroids and block designs (1971) (3)
On Dependence in Matroids (1967) (3)
Surveys in Combinatorics, 1997: Approximate Counting (1997) (3)
Corrigendum to "A linking polynomial of two matroids" [Adv. in Appl. Math. 32 (1-2) (2004) 391-419] (2012) (3)
Animals, Trees and Renewal Sequences: Corrigendum (1982) (2)
Complexity and Cryptography: Graph theory definitions (2006) (2)
Special Issue in Honour of James Oxley (2015) (2)
Some Problems on Approximate Counting in Graphs and Matroids (2008) (2)
Complexity and Cryptography: Bibliography (2006) (1)
Combinatorics in statistical physics (1996) (1)
Combinatorial mathematics and its applications : proceedings of a conference held at the Mathematical Institute, Oxford from 7-10 July, 1969 (1971) (1)
Matroids and Combinatorial Optimisation (2010) (1)
John Michael Hammersley, FRS, 1920–2004 (2009) (1)
John Michael Hammersley (1920-2004) (2006) (1)
GRAPHS AND HYPERGRAPHS (1974) (1)
On the Parity of Colourings and Flows (2002) (1)
Special Issue in Honour of James Oxley (2015) (0)
Optimization Algorithms on Random Graphs (1982) (0)
Complexity and Cryptography: Basic mathematical background (2006) (0)
Complexity and Cryptography: Public key cryptography (2006) (0)
III.54 Matroids (2010) (0)
Complexity and Cryptography: Identification schemes (2006) (0)
Answers to selected exercises and problems (2006) (0)
Approximation and randomisation (1993) (0)
A note on matroids and block designs (1975) (0)
Complexity and Cryptography: Non-deterministic computation (2006) (0)
Complexity and Cryptography: Symmetric cryptosystems (2006) (0)
Complexity and Cryptography: Secure encryption (2006) (0)
Knots and links (1993) (0)
Complexity and Cryptography: Probabilistic computation (2006) (0)
Crispin St J. A. Nash‐Williams (1932–2001) (2003) (0)
Complexity and Cryptography: Basics of cryptography (2006) (0)
Complexity and Cryptography: Key establishment protocols (2006) (0)
Randomised algorithms (1983) (0)
The complexity of uniqueness and parity (1993) (0)
Complexity and Cryptography: Complexity theory (2006) (0)
ON THE AUTOMORPHISM GRQW OF A F. HARARY (2001) (0)
Complexity and Cryptography: Answers to selected exercises and problems (2006) (0)
The complexity of graph polynomials (1997) (0)
Matroids and complexity (2005) (0)
Complexity and Cryptography: Algebra and number theory (2006) (0)
W.T. (Bill) Tutte - in memoriam (2004) (0)
Colourings, flows and polynomials (1993) (0)
Complexity and Cryptography: Digital signatures (2006) (0)
The complexity of enumeration (1993) (0)
Combinatorics, Geometry and Probability: Randomised Approximation in the Tutte Plane (1997) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Dominic J. A. Welsh?

Dominic J. A. Welsh is affiliated with the following schools:

University of Michigan

Dominic J. A. Welsh's Academic­Influence.com Rankings

Why Is Dominic J. A. Welsh Influential?

Dominic J. A. Welsh's Published Works

Published Works

What Schools Are Affiliated With Dominic J. A. Welsh?

Dominic J. A. Welsh's AcademicInfluence.com Rankings