| Publication | Date of Publication | Type |
|---|
| The Markov chain of colourings | 2022-08-30 | Paper |
| Some Problems on Approximate Counting in Graphs and Matroids | 2017-04-07 | Paper |
| Counting phylogenetic networks | 2015-05-05 | Paper |
| Matroids and Combinatorial Optimisation | 2015-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2878266 | 2014-08-28 | Paper |
| On properties of almost all matroids | 2013-01-14 | Paper |
| On the number of sparse paving matroids | 2013-01-14 | Paper |
| Corrigendum to ``A linking polynomial of two matroids | 2012-07-04 | Paper |
| Optimizing phylogenetic diversity with ecological constraints | 2012-01-24 | Paper |
| On the asymptotic proportion of connected matroids | 2011-08-09 | Paper |
| Growth constants of minor-closed classes of graphs | 2010-06-03 | Paper |
| John Michael Hammersley, FRS, 1920-2004 | 2010-02-03 | Paper |
| Negative Correlation in Graphs and Matroids | 2008-12-11 | Paper |
| On the growth rate of minor-closed classes of graphs | 2007-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424885 | 2007-03-05 | Paper |
| Complexity and Cryptography | 2005-11-17 | Paper |
| Approximate Counting and Quantum Computation | 2005-11-14 | Paper |
| Random planar graphs | 2005-03-08 | Paper |
| W.T. (Bill) Tutte -- in memoriam | 2004-06-15 | Paper |
| A linking polynomial of two matroids | 2004-06-15 | Paper |
| CRISPIN ST J. A. NASH-WILLIAMS (1932–2001) | 2003-12-03 | Paper |
| On the parity of colourings and flows | 2002-12-10 | Paper |
| Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776272 | 2002-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4386297 | 2001-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4487078 | 2000-10-18 | Paper |
| Arrangements, channel assignments, and associated polynomials | 2000-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4704790 | 2000-04-10 | Paper |
| The polytope of win vectors | 2000-01-12 | Paper |
| A weighted graph polynomial from chromatic invariants of knots | 1999-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226452 | 1999-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871785 | 1998-02-04 | Paper |
| Lê numbers of arrangements and matroid identities | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352952 | 1997-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347915 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342027 | 1997-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871757 | 1996-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4717856 | 1996-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871789 | 1996-05-29 | Paper |
| Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case | 1996-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878672 | 1996-05-14 | Paper |
| The random cluster process | 1995-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845264 | 1995-09-11 | Paper |
| The computational complexity of knot and matroid polynomials | 1995-07-20 | Paper |
| Randomised Approximation in the Tutte Plane | 1995-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137220 | 1994-11-21 | Paper |
| Percolation in the random cluster process and Q-state Potts model | 1994-05-24 | Paper |
| The Computational Complexity of the Tutte Plane: the Bipartite Case | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273837 | 1994-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139759 | 1993-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140234 | 1993-10-26 | Paper |
| Tutte polynomials computable in polynomial time | 1993-10-14 | Paper |
| Knots, matroids and the Ising model | 1993-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3994378 | 1992-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3998239 | 1992-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972641 | 1992-06-25 | Paper |
| On the computational complexity of the Jones and Tutte polynomials | 1992-06-25 | Paper |
| A randomised 3-colouring algorithm | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801568 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3026025 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3744955 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3702260 | 1984-01-01 | Paper |
| Randomised algorithms | 1983-01-01 | Paper |
| Finite particle systems and infection models | 1983-01-01 | Paper |
| Tangential 1-blocks over GF(3) | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3332244 | 1982-01-01 | Paper |
| Animals, Trees and Renewal Sequences: Corrigendum | 1982-01-01 | Paper |
| Flow in networks with random capacities | 1982-01-01 | Paper |
| Some Colouring Problems and their Complexity | 1982-01-01 | Paper |
| Animals, Trees and Renewal Sequences | 1981-01-01 | Paper |
| On the chromatic number of binary matroids | 1980-01-01 | Paper |
| The computational complexity of matroid properties | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3898509 | 1980-01-01 | Paper |
| On some percolation results of J. M. Hammersley | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3963023 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190657 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4193283 | 1979-01-01 | Paper |
| Percolation Probabilities on the Square Lattice | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4198245 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4111952 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4181269 | 1976-01-01 | Paper |
| A note on matroids and block designs | 1975-01-01 | Paper |
| Combinatorial applications of an inequality from statistical mechanics | 1975-01-01 | Paper |
| A greedy algorithm for solving a certain class of linear programmes | 1973-01-01 | Paper |
| On the automorphism group of a matroid | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5661530 | 1971-01-01 | Paper |
| Generalized versions of Hall's theorem | 1971-01-01 | Paper |
| SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS | 1971-01-01 | Paper |
| On the Number of Combinatorial Geometries | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5641146 | 1971-01-01 | Paper |
| Matroids and block designs | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5659538 | 1971-01-01 | Paper |
| On the Vector Representation of Matroids | 1970-01-01 | Paper |
| On Matroid Theorems of Edmonds and Rado | 1970-01-01 | Paper |
| Transversal Theory and Matroids | 1969-01-01 | Paper |
| A bound for the number of matroids | 1969-01-01 | Paper |
| Euler and bipartite matroids | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5571522 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5605167 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5540285 | 1968-01-01 | Paper |
| An upper bound for the chromatic number of a graph and its application to timetabling problems | 1967-01-01 | Paper |
| On Dependence in Matroids | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5343851 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5519643 | 1965-01-01 | Paper |
| FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE | 1962-01-01 | Paper |
