---

Work Experience

• Full Professor, School of Computer Science McGill University 2001/7 - 2021/1
• Directeur de Recherche CNRS, France 2000/10 - 2018/10
• Charge de Recherche CNRS, France 1993/9 - 2000/9
• Visiting Associate Professor, Department of Mathematics Carnegie Mellon University 1993/7 - 1995/6
• Visiting Researcher, SOCS McGill University 1992/9 - 1993/6
• Von Humboldt Fellow, Institut fur Diskrete Mathematik Universitat Bonn 1991/9 - 1992/9
• Assistant Professor, Dept. of Combinatorics & Optimization University of Waterloo 1987/7 - 1991/9
• Postdoctoral Fellow, Discrete Mathematics Group Bell Communications Research 1986/9 - 1987/7

---

Awards

• Humboldt Research Prize, 2014
• CRM/Fields/PIM Prize, 2013
• Best Paper: ACM-SIAM Symposium on Discrete Mathematics, 2013
• Fields Institute Fellow, 2013
• Fellow of the Royal Society of Canada, 2009
• Canada Research Chair, 2008-2015
• Invited lecture, International Congress of Mathematics, Beijing China, 2002
• Canada Research Chair, 2001-2008

---

Research Descriptions

Dr. Reed develops and applies tools which permitthe analysis of 
and optimization on large complex 21st century networks. He is especially interested in 
probabilistic methods, random models, and structural decompositions. 

---

Selected Publications

1. (with Stein M.) "Spanning trees in graphs which have a universal vertex II: a tight result" , Journal of Graph Theory, , 797-821, 2023.
2. (with Stein M.) "Spanning trees in graphs which have a universal vertex II: a tight result" , Journal of Graph Theory , 737-783, 2023.
3. (with Pach J., Yuditsky L.) "Almost all string graphs are intersection graphs of planar convex sets" , Discrete and Computational Geometry v. 63 , 888-917, 2020.
4. (with Ken-ichi Kawarabayashi, Yusuke Kobayashi) "The disjoint paths problem in quadratic time" , Journal of Combinatorial Theory, Series B 102 (2) , 424-435, 2012.
5. (with Kaleigh Smith, Adrian Vetta) "Finding odd cycle transversals" , Operations Research Letters 32 (4) , 299-301, 2004.
6. "Graph colouring and the probabilistic method" , Springer Science & Business Media , 2002.
7. (with Michael Molloy) "Further algorithmic aspects of the local lemma" , Proceedings of the thirtieth annual ACM symposium on Theory of computing , 524-529, 1998.
8. (with Michael Molloy) "The size of the giant component of a random graph with a given degree sequence" , Combinatorics, probability and computing 7 (3) , 295-305, 1998.
9. (with Michael Molloy) "A bound on the strong chromatic index of a graph" , Journal of Combinatorial Theory, Series B 69 (2) , 103-109, 1997.
10. "Tree width and tangles: A new connectivity measure and some applications" , Surveys in combinatorics , 87-162, 1997.
11. "Paths, stars and the number three" , Combinatorics, Probability and Computing 5 (3) , 277-295, 1996.
12. (with Michael Molloy) "A critical point for random graphs with a given degree sequence" , Random structures & algorithms 6 (2‐3) , 161-180, 1995.
13. "Finding approximate separators and computing tree width quickly" , Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , 221-228, 1992.
14. (with Vašek Chvátal) "Mick gets some (the odds are on his side)(satisfiability)" , Proceedings., 33rd Annual Symposium on Foundations of Computer Science , 620-627, 1992.
15. (with Noga Alon, Colin McDiarmid) "Acyclic coloring of graphs" , Random Structures & Algorithms 2 (3) , 277-288, 1991.