Person:1227010

Available identifiers

zbMath Open mcdiarmid.colinMaRDI QIDQ1227010

List of research outcomes

Publication	Date of Publication	Type
Pendant appearances and components in random graphs from structured classes	2024-07-08	Paper
Modularity and Graph Expansion	2023-12-12	Paper
Modularity of nearly complete graphs and bipartite graphs	2023-11-12	Paper
The component structure of dense random subgraphs of the hypercube	2023-10-12	Paper
Classes of graphs embeddable in order-dependent surfaces	2023-03-31	Paper
Random graphs from structured classes	2022-09-21	Paper
Random graphs embeddable in order-dependent surfaces	2021-08-17	Paper
Pendant appearances and components in random graphs from structured classes	2021-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q4993553	2021-06-15	Paper
Modularity of regular and treelike graphs	2021-05-07	Paper
Learning random points from geometric graphs or orderings	2020-11-30	Paper
Modularity of Erdős‐Rényi random graphs	2020-09-16	Paper
Connectivity for an unlabelled bridge-addable graph class	2020-01-15	Paper
Clique coloring of binomial random graphs	2019-08-14	Paper
Extremal distances for subtree transfer operations in binary trees	2019-06-14	Paper
Recognition of unipolar and generalised split graphs	2019-03-26	Paper
Clique colourings of geometric graphs	2019-03-05	Paper
Random perfect graphs	2019-02-20	Paper
On the purity of minor-closed classes of graphs	2019-02-08	Paper
On the critical densities of minor-closed classes	2018-11-15	Paper
Linear extensions and comparable pairs in partial orders	2018-10-09	Paper
Edge-Maximal Graphs on Surfaces	2018-08-30	Paper
Hamilton Cycles, Minimum Degree, and Bipartite Holes	2017-12-01	Paper
Bridge-Addability, Edge-Expansion and Connectivity	2017-10-10	Paper
On random graphs from a minor-closed class	2017-07-24	Paper
Uniform multicommodity flows in the hypercube with random edge‐capacities	2017-06-02	Paper
https://portal.mardi4nfdi.de/entity/Q2822597	2016-09-30	Paper
Random graphs from a block-stable class	2016-08-16	Paper
Connectivity for bridge-alterable graph classes	2016-05-11	Paper
Balanced routing of random calls	2015-05-29	Paper
Counting phylogenetic networks	2015-05-05	Paper
For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set	2014-11-17	Paper
For most graphs H , most H -free graphs have a linear homogeneous set	2014-11-17	Paper
https://portal.mardi4nfdi.de/entity/Q2921770	2014-10-13	Paper
Random graphs from a weighted minor-closed class	2014-08-14	Paper
On the Spread of Random Graphs	2014-08-06	Paper
Largest sparse subgraphs of random graphs	2014-07-29	Paper
The number of disk graphs	2014-07-29	Paper
Random graphs containing few disjoint excluded minors	2014-04-15	Paper
Relatively Bridge-Addable Classes of Graphs	2014-03-31	Paper
On Independent Sets in Graphs with Given Minimum Degree	2014-02-24	Paper
https://portal.mardi4nfdi.de/entity/Q2857370	2013-11-01	Paper
https://portal.mardi4nfdi.de/entity/Q2857418	2013-11-01	Paper
Connectivity for random graphs from a weighted bridge-addable class	2013-06-07	Paper
Integer realizations of disk and segment graphs	2013-01-18	Paper
Connectivity for Bridge-Addable Monotone Graph Classes	2012-10-31	Paper
On the chromatic number of random geometric graphs	2012-02-13	Paper
Random Graphs with Few Disjoint Cycles	2011-12-08	Paper
On graphs with few disjoint \(t\)-star minors	2011-11-29	Paper
Random unlabelled graphs containing few disjoint cycles	2011-01-17	Paper
The Number of Bits Needed to Represent a Unit Disk Graph	2010-11-16	Paper
https://portal.mardi4nfdi.de/entity/Q3576649	2010-07-30	Paper
The \(t\)-stability number of a random graph	2010-06-16	Paper
The t-Improper Chromatic Number of Random Graphs	2010-04-23	Paper
Random Graphs from a Minor-Closed Class	2010-04-22	Paper
Acyclic improper colourings of graphs with bounded maximum degree	2010-03-29	Paper
Uniform multicommodity flow through the complete graph with random edge-capacities	2009-11-17	Paper
On the Maximum Degree of a Random Planar Graph	2008-09-29	Paper
Random graphs on surfaces	2008-07-24	Paper
The t-improper chromatic number of random graphs	2008-06-05	Paper
List Colouring Squares of Planar Graphs	2008-06-05	Paper
Vertex-colouring edge-weightings	2008-01-14	Paper
Asymptotic distributions and chaos for the supermarket model	2007-11-23	Paper
On the span of a random channel assignment problem	2007-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q3447281	2007-06-28	Paper
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs	2007-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q3424885	2007-03-05	Paper
Concentration for self-bounding functions and an inequality of Talagrand	2007-02-07	Paper
Random cubic planar graphs	2007-02-07	Paper
On the maximum queue length in the supermarket model	2006-07-26	Paper
On the power of two choices: balls and bins in continuous time	2005-11-08	Paper
Random planar graphs	2005-03-08	Paper
Graph Imperfection with a Co-Site Constraint	2005-02-28	Paper
On the Number of Edges in Random Planar Graphs	2004-09-24	Paper
Channel assignment on graphs of bounded treewidth	2004-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q4428907	2003-09-22	Paper
Frequency-distance constraints with large distances	2003-07-29	Paper
On-line routing of random calls in networks	2003-07-08	Paper
On the span in channel assignment problems: Bounds, computing and counting	2003-06-09	Paper
https://portal.mardi4nfdi.de/entity/Q4483917	2003-05-27	Paper
Concentration for locally acting permutations	2003-05-25	Paper
Random channel assignment in the plane	2003-04-03	Paper
https://portal.mardi4nfdi.de/entity/Q4407445	2003-01-01	Paper
Concentration for Independent Permutations	2002-12-15	Paper
Graph imperfection. II	2002-12-11	Paper
Graph imperfection. I	2002-12-10	Paper
On the divisibility of graphs	2002-06-24	Paper
Channel assignment with large demands	2002-06-09	Paper
https://portal.mardi4nfdi.de/entity/Q2758339	2002-03-25	Paper
https://portal.mardi4nfdi.de/entity/Q4949883	2001-05-08	Paper
Bisecting sparse random graphs	2001-02-11	Paper
Channel assignment and weighted coloring	2000-12-03	Paper
Pattern minimisation in cutting stock problems	2000-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q4226453	1999-12-13	Paper
Colouring proximity graphs in the plane	1999-11-03	Paper
Random minimum length spanning trees in regular graphs	1999-05-18	Paper
A doubly cyclic channel assignment problem	1998-09-07	Paper
On finding a minimum spanning tree in a network with random weights	1997-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q3122905	1997-08-19	Paper
Hypergraph colouring and the Lovász local lemma	1997-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4347910	1997-08-11	Paper
Centering Sequences with Bounded Differences	1997-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4342028	1997-07-01	Paper
Tidier examples for lower bounds on diagonal Ramsey numbers	1996-07-09	Paper
https://portal.mardi4nfdi.de/entity/Q4870536	1996-03-20	Paper
Almost Every Graph can be Covered by Linear Forests	1996-02-12	Paper
On the bandwidth of triangulated triangles	1995-10-23	Paper
Minimal positions in a branching random walk	1995-08-10	Paper
The complexity of harmonious colouring for trees	1995-04-10	Paper
New upper bounds on harmonious colorings	1994-09-15	Paper
Total colouring regular bipartite graphs is NP-hard	1994-06-28	Paper
The Strongly Connected Components of 1-in, 1-out	1994-05-05	Paper
On a Correlation Inequality of Farr	1994-05-05	Paper
Sharing jugs of wine	1994-05-05	Paper
A Random Recolouring Method for Graphs and Hypergraphs	1994-04-28	Paper
An upper bound for total colouring of graphs	1994-04-25	Paper
Star arboricity	1993-03-10	Paper
Probability Modelling and Optimal Location of a Travelling Salesman	1993-01-16	Paper
On total colourings of graphs	1993-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4014322	1992-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q4012185	1992-09-27	Paper
Volumes Spanned by Random Points in the Hypercube	1992-06-28	Paper
Upper bounds for harmonious colorings	1992-06-27	Paper
Expected numbers at hitting times	1992-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q3973370	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3972640	1992-06-25	Paper
Acyclic coloring of graphs	1992-06-25	Paper
On the chromatic number of random graphs	1992-06-25	Paper
Linear arboricity of random regular graphs	1992-06-25	Paper
Lattice bandwidth of random graphs	1991-01-01	Paper
On the improvement per iteration in Karmarkar's algorithm for linear programming	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3035309	1990-01-01	Paper
Greedy Matching on the Line	1990-01-01	Paper
Building heaps fast	1989-01-01	Paper
On random minimum length spanning trees	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3496342	1989-01-01	Paper
Edge-colouring random graphs	1988-01-01	Paper
Average-Case Lower Bounds for Searching	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3803129	1987-01-01	Paper
On the greedy algorithm with random costs	1986-01-01	Paper
On linear programs with random costs	1986-01-01	Paper
The complexity of counting homeomorphs	1985-01-01	Paper
On some conditioning results in the probabilistic analysis of algorithms	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3716814	1985-01-01	Paper
Partitioning heuristics for two geometric maximization problems	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3826581	1984-01-01	Paper
Integral decomposition in polyhedra	1983-01-01	Paper
General first-passage percolation	1983-01-01	Paper
On the chromatic forcing number of a random graph	1983-01-01	Paper
Achromatic numbers of random graphs	1982-01-01	Paper
General percolation and random graphs	1981-01-01	Paper
Percolation on subsets of the square lattice	1980-01-01	Paper
Clutter percolation and random graphs	1980-01-01	Paper
Determining the Chromatic Number of a Graph	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3884128	1979-01-01	Paper
Blocking, antiblocking, and pairs of matroids and polymatroids	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4090365	1976-01-01	Paper
Disjoint Common Transversals and Exchange Structures	1976-01-01	Paper
On the number of systems of distinct representatives in an independence structure	1976-01-01	Paper
An Exchange Theorem for Independence Structures	1975-01-01	Paper
On colouring random graphs	1975-01-01	Paper
EXTENSIONS OF MENGER'S THEOREM	1975-01-01	Paper
Rado's theorem for polymatroids	1975-01-01	Paper
Bi-submodular functions, distributive valuations, and distance functions in lattices	1975-01-01	Paper
Path-Partition Structures of Graphs and Digraphs	1974-01-01	Paper
Independence Structures and Submodular Functions	1973-01-01	Paper
A Note on a Theorem of R. Rado on Independent Transversals	1973-01-01	Paper
An application of a reduction method of R. Rado to the study of common transversals	1973-01-01	Paper
The Solution of a Timetabling Problem	1972-01-01	Paper
Strict Gammoids and Rank Functions	1972-01-01	Paper
Random graphs embeddable in order-dependent surfaces	0001-01-03	Paper
Modularity and partially observed graphs	N/A	Paper

Research outcomes over time

This page was built for person: Colin J. H. McDiarmid