Publications of C. McDiarmid

BACK TO COATI PUBLICATION INDEX

Publications of C. McDiarmid

Books and proceedings
  1. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors. Probabilistic methods for algorithmic discrete mathematics, volume 16 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1998. [bibtex-entry]
     
Articles in journal or book's chapters
  1. C. McDiarmid and B. Reed. On the maximum degree of a random planar graph. Combinatorics, Probability and Computing, 17:591-601, 2008. [bibtex-entry]
     
  2. L. Addario-Berry, K. Dalal, C. McDiarmid, B. Reed, and A. Thomason. Vertex Colouring Edge Weightings. Combinatorica, 27:1-12, 2007. [bibtex-entry]
     
  3. C. McDiarmid and B. Reed. Concentration for self-bounding functions and an inequality of talagrand. Random Structures and Algorithms, 29:549--557, 2006. [bibtex-entry]
     
  4. C. McDiarmid and B. Reed. Channel assignment on graphs of bounded treewidth. Discrete Math., 273(1-3):183--192, 2003.
    Note: EuroComb'01 (Barcelona). [bibtex-entry]
     
  5. L. Devroye, C. McDiarmid, and B. Reed. Giant components for two expanding graph processes. In Mathematics and computer science, II (Versailles, 2002), Trends Math., pages 161--173. Birkhäuser, Basel, 2002. [bibtex-entry]
     
  6. C. McDiarmid and B. Reed. Channel assignment and weighted coloring. Networks, 36(2):114--117, 2000. [bibtex-entry]
     
  7. C. McDiarmid and B. Reed. Colouring proximity graphs in the plane. Discrete Math., 199(1-3):123--137, 1999. [bibtex-entry]
     
  8. C. McDiarmid and B. Reed. Almost every graph can be covered by $\lceil{\Delta/2}\rceil$ linear forests. Combin. Probab. Comput., 4(3):257--268, 1995. [bibtex-entry]
     
  9. C. McDiarmid, B. Reed, A. Schrijver, and B. Shepherd. Induced circuits in planar graphs. J. Combin. Theory Ser. B, 60(2):169--176, 1994. [bibtex-entry]
     
  10. C. McDiarmid and B. Reed. On total colourings of graphs. J. Combin. Theory Ser. B, 57(1):122--130, 1993. [bibtex-entry]
     
  11. N. Alon, C. McDiarmid, and B. Reed. Star arboricity. Combinatorica, 12(4):375--380, 1992. [bibtex-entry]
     
  12. A. Frieze, C. McDiarmid, and B. Reed. On a conjecture of Bondy and Fan. Ars Combin., 33:329--336, 1992. [bibtex-entry]
     
  13. B. Reed and C. McDiarmid. The strongly connected components of $1$-in, $1$-out. Combin. Probab. Comput., 1(3):265--274, 1992. [bibtex-entry]
     
  14. N. Alon, C. McDiarmid, and B. Reed. Acyclic coloring of graphs. Random Structures Algorithms, 2(3):277--288, 1991. [bibtex-entry]
     
  15. A. Frieze, C. McDiarmid, and B. Reed. Greedy matching on the line. SIAM J. Comput., 19(4):666--672, 1990. [bibtex-entry]
     
  16. C. McDiarmid and B. Reed. Linear arboricity of random regular graphs. Random Structures Algorithms, 1(4):443--445, 1990. [bibtex-entry]
     
Conference's articles
  1. F. Havet, J. van den Heuvel, C. McDiarmid, and B. Reed. List colouring squares of planar graphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007), volume 29 of Electronic Notes in Discrete Mathematics, Sevilla, Spain, pages 515-519, September 2007. [PDF ] [bibtex-entry]
     
  2. C. McDiarmid and B. Reed. Channel assignment on nearly bipartite and bounded treewidth graphs. In Comb01---Euroconference on Combinatorics, Graph Theory and Applications, volume 10 of Electron. Notes Discrete Math., Amsterdam, pages 4 pp. (electronic), 2001. Elsevier. [bibtex-entry]
     
  3. C. McDiarmid, B. Reed, A. Schrijver, and B. Shepherd. Noninterfering network flows. In Algorithm theory---SWAT '92 (Helsinki, 1992), volume 621 of Lecture Notes in Comput. Sci., Berlin, pages 245--257, 1992. Springer. [bibtex-entry]
     
Internal reports
  1. F. Havet, J. van den Heuvel, C. McDiarmid, and B. Reed. List Colouring Squares of Planar Graphs. Research Report RR-6586, INRIA, July 2008. [Abstract] [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX


Last modified: Sat Jan 29 19:00:45 2022