Colin McDiarmid - Concepedia

Author

Colin McDiarmid

Also Known As

C. J. H. McDIARMID, C. J. H. McDiarmid, C. J. H. Mcdiarmid, C. MCDIARMID, C. McDiarmid, C. Mcdiarmid, C.J.H McDiarmid, C.J.H. McDiarmid, COLIN J. H. MCDIARMID, COLIN McDIARMID

216

Publications

6.3K

Citations

H-Index

Concepts

All Affiliations

University of Oxford McGill University Carnegie Mellon University Centre National de la Recherche Scientifique

About

Colin McDiarmid is an author at University of Oxford specializing in engineering, discrete mathematics, and graph theory.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	27	57	2.3K
2	Education	17	22	1.2K
3	Natural Sciences	6	6	234
4	Business	2	2	50
5	Biology	1	1	61

Colin McDiarmid

Publications

3.5K

Citations

H-Index

Page 1

	Year	Citations
On colouring random graphs Geoffrey Grimmett, Colin McDiarmid Mathematical Proceedings of the Cambridge Philosophical Society EngineeringGraph TheoryRandom GraphExtremal Graph TheoryStructural Graph Theory	1975	340
Acyclic coloring of graphs Noga Alon, Colin McDiarmid, Bruce Reed Random Structures and Algorithms Geometric Graph TheoryGraph TheoryAlgebraic Graph TheoryTopological Graph TheoryVertex Coloring	1991	231
Random planar graphs Colin McDiarmid, Angelika Steger, Dominic Welsh Journal of Combinatorial Theory Series B Network ScienceGraph TheoryRandom Planar GraphsEngineeringRandom Graph	2004	149
Vertex-Colouring Edge-Weightings Louigi Addario‐Berry, Ketan Dalal, Colin McDiarmid, COMBINATORICA	2007	114
Channel assignment and weighted coloring Colin McDiarmid, Bruce Reed Networks Mathematical ProgrammingEngineeringGraph TheoryChannel Capacity EstimationCombinatory Analysis	2000	108
On integer points in polyhedra William J. Cook, Mark Hartmann, Ravi Kannan, COMBINATORICA Mathematical ProgrammingDiscrete GeometryEngineeringGeometric AlgorithmConvex Hull	1992	82
The Solution of a Timetabling Problem Colin McDiarmid IMA Journal of Applied Mathematics	1972	77
Rado's theorem for polymatroids Colin McDiarmid Mathematical Proceedings of the Cambridge Philosophical Society Matroid Theory‘ PolymatroidsPolymatroids ’Algebraic CombinatoricsDiscrete Mathematics	1975	72
Integer realizations of disk and segment graphs Colin McDiarmid, Tobias Müller Journal of Combinatorial Theory Series B Geometric Graph TheoryEngineeringGraph TheoryTopological Graph TheoryPlanar Graph	2012	71
Total colouring regular bipartite graphs is NP-hard Colin McDiarmid, Abdón Sánchez-Arroyo Discrete Mathematics EngineeringGraph TheoryExtremal Graph TheoryStructural Graph TheoryRegular Bipartite Graphs	1994	70

Page 1