Talks
  1. Seminar.
    Coloring a claw-free graph with Δ-1 colors.
    East China Normal University, Shanghai, China. 12 April 2013.

  2. Lecture.
    Star coloring sparse graphs.
    Zhejiang Normal University, Jinhua, China. 8 April 2013.

  3. Seminar.
    Coloring a claw-free graph with Δ-1 colors.
    Zhejiang Normal University, Jinhua, China. 7 April 2013.

  4. Applied and Computational Math Division Seminar.
    Revolutionaries and Spies in Graphs.
    National Institute of Standards and Technology. 12 March 2013.

  5. Undergrad Math Club.
    A Proof of Bertrand's Postulate.
    Virginia Commonwealth University. 5 March 2013.

  6. Math Department Colloquium.
    Revolutionaries and Spies in Graphs.
    Howard University. 22 February 2013.

  7. Discrete Math Seminar.
    Coloring a claw-free graph with Δ-1 colors.
    University of Delaware. 19 February 2013.

  8. Combinatorics, Algebra, Geometry Seminar (CAGS).
    Coloring a claw-free graph with Δ-1 colors.
    George Mason University. 15 February 2013.

  9. Discrete Math Seminar.
    Coloring a claw-free graph with Δ-1 colors.
    West Virginia University. 31 January 2013.

  10. Guest lecture in Kostochka's seminar class.
    List-coloring the square of sparse graphs.
    University of Illinois. 23 January 2013.

  11. Graph Theory and Combinatorics Seminar.
    Coloring a claw-free graph with Δ-1 colors.
    University of Illinois. 22 January 2013.

  12. Discrete Math Seminar.
    Coloring a graph with Δ-1 colors.
    Virginia Commonwealth University. 11 September 2012.

  13. SIAM Discrete Math. Minisymposium on Graph Coloring.
    Conjectures equivalent to the Borodin-Kostochka Conjecture: Coloring a graph with Δ-1 colors.
    Dalhousie University. Halifax, Nova Scotia. 18 June 2012.

  14. Math Department Colloquium.
    Revolutionaries and Spies in Graphs.
    William & Mary. 30 March 2012.

  15. Atlanta Lecture Series V.
    Overlap Number of Graphs.
    Emory. 26 February 2012.

  16. Discrete Math Seminar.
    Overlap Number of Graphs.
    Virginia Commonwealth University. 22 February 2012.

  17. Grad Student Seminar.
    A Proof of Bertrand's Postulate.
    Virginia Commonwealth University. 3 November 2011.

  18. 26th Clemson mini-conference.
    Revolutionaries and Spies.
    Clemson. 27 October 2011.

  19. Discrete Math Seminar.
    Linear Coloring of Sparse Graphs.
    Virginia Commonwealth University. 26 October 2011.

  20. Combinatorics Seminar.
    Revolutionaries and Spies.
    Louisiana State University. 6 October 2011.

  21. Student Colloquium.
    The Search for Moore Graphs: Beauty is Rare.
    Louisiana State University. 5 October 2011.

  22. Student Colloquium.
    A Proof of Bertrand's Postulate.
    Louisiana State University. 4 October 2011.

  23. AMS Sectional Conference. Special Session on Graph Theory.
    Linear List Coloring of Sparse Graphs.
    Wake Forest. 24 September 2011.

  24. Combinatorics Seminar.
    List Colorings of K5-minor-free Graphs with Special List Assignments.
    University of South Carolina. 22 September 2011.

  25. Discrete Math Seminar.
    The Search for Moore Graphs: Beauty is a Rare Thing.
    Virginia Commonwealth University. 21 September 2011.

  26. Crossing Numbers Workshop.
    Crossings, Colorings, and Cliques.
    Banff International Research Station (BIRS), Banff, Alberta. 23 August 2011.

  27. Research Experience for Graduate Students (REGS).
    Graph Ramsey Theory.
    University of Illinois. 22 June 2011.

  28. 24th Cumberland Conference.
    Spies and Revolutionaries.
    University of Louisville. 13 May 2011.

  29. Combinatorics, Algebra, and Geometry Seminar.
    Spies and Revolutionaries.
    George Mason University. 29 April 2011.

  30. SIAM Sectional Conference. Special Session on Graph Theory.
    Spies and Revolutionaries.
    UNC-Charlotte. 26 March 2011.

  31. Math Coffee.
    A Proof of Bertrand's Postulate.
    Davidson College. 25 March 2011.

  32. Discrete Math Seminar.
    Spies and Revolutionaries.
    Virginia Commonwealth University. 9 February 2011.

  33. Combinatorics Seminar.
    List Colorings of K5-minor-free Graphs with Special List Assignments.
    George Washington University. 18 November 2010.

  34. Discrete Math Seminar.
    List Colorings of K5-minor-free Graphs with Special List Assignments.
    Virginia Commonwealth University. 17 November 2010.

  35. Cycles and Colourings.
    List Colorings of K5-minor-free Graphs with Special List Assignments.
    High Tatras, Slovakia. 9 September 2010.

  36. Seminar.
    Maker-Breaker Games: Building a Big Chain in a Poset.
    West Virginia University. 22 July 2010.

  37. Research Experience for Graduate Students (REGS) Seminar.
    Maker-Breaker Games: Building a Big Chain in a Poset.
    University of Illinois. 20 July 2010.

  38. SIAM Discrete Math. Minisymposium on Graph Theory.
    List Colorings of K5-minor-free Graphs with Special List Assignments.
    Austin, Texas. June 2010.

  39. AMS Sectional Meeting. Minisymposium on Graph Theory.
    List Colorings of K5-minor-free Graphs with Special List Assignments.
    New Jersey Institute of Technology. 23 May 2010.

  40. 23rd Cumberland Conference.
    List Colorings of K5-minor-free Graphs with Special List Assignments.
    University of Mississippi. 20 May 2010.

  41. Math Department Colloquium.
    Reducibility and Discharging: An Introduction by Example.
    US Naval Academy. 28 April 2010.

  42. Discrete Math Seminar.
    Detecting a Machine Failure in a Network: Vertex Identifying Codes.
    University of Delaware. 9 April 2010.

  43. Discrete Math Seminar.
    Maker-Breaker Games: Building a Big Chain in a Poset.
    Virginia Commonwealth University. 5 March 2010.

  44. Joint Math Meetings: SIAM Minisymposium on Graph Theory
    Maker-Breaker Games: Building a Big Chain in a Poset.
    San Francisco, California. 15 January 2010.

  45. Joint Math Meetings: Special Session on Applications of Graph Theory.
    Detecting a Machine Failure in a Network: Vertex Identifying Codes.
    San Francisco, California. 13 January 2010.

  46. Discrete Math Seminar.
    A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid.
    Virginia Commonwealth University. 24 September 2009.

  47. MathFest 2009: Discrete Math Minisymposium.
    Sorting Permutations by Cut-and-Paste Moves.
    Portland, Oregon. 6 August 2009.

  48. 2009 SIAM Annual Meeting: Graph Theory and Related Topics Minisymposium.
    Injective Colorings of Sparse Graphs.
    Denver, Colorado. 9 July 2009.

  49. CanaDAM 2009: Graph Crossing Minisymposium.
    Crossings, Colorings, and Cliques.
    University of Montreal. 28 May 2009.

  50. Combinatorics Seminar.
    Crossings, Colorings, and Cliques.
    Lafayette College. 30 April 2009.

  51. Math Department Colloquium.
    Coloring and List-coloring of Graphs.
    William & Mary. 24 April 2009.

  52. Graduate Combinatorics Seminar.
    Crossings, Colorings, and Cliques.
    Rutgers University. 8 April 2009.

  53. AMS Sectional Meeting: Special Session on Graph Theory.
    Injective Colorings of Sparse Graphs.
    University of Illinois. 28 March 2009.

  54. Math Seminar.
    Coloring and List-coloring of Graphs.
    University of Louisville. 16 February 2009.

  55. Math Seminar.
    Coloring and List-coloring of Graphs.
    Duquesne University. 13 February 2009.

  56. Math Seminar.
    Coloring and List-coloring of Graphs.
    Virginia Commonwealth University. 9 February 2009.

  57. Graph Theory Minisymposium, I.
    Entire (Δ+4)-choosability of Plane Graphs with Δ≥ 8.
    Joint Meetings, Washington, D.C. 6 January 2009.

  58. Graduate Math Seminar.
    The Probabilistic Method: How to make counting easy (sometimes).
    Rutgers University. 5 December 2008.

  59. Experimental Math Seminar.
    Entire (Δ+4)-choosability of Plane Graphs with Δ≥ 8.
    Rutgers University. 30 October 2008.

  60. Discrete Math Seminar.
    Colorings, Crossings, and Cliques.
    Columbia University. 21 October 2008.

  61. Graduate Combinatorics Seminar.
    Injective Colorings of Sparse Graphs.
    Rutgers University. 17 September 2008.

  62. Fete of Combinatorics and Computer Science: An international conference on combinatorics and computer science.
    (7,2)-edge-choosability of 3-regular Graphs.
    Keszthely, Hungary. 12 August 2008.

  63. Midsummer Workshop on Combinatorics.
    (7,2)-edge-choosability of 3-regular Graphs.
    Charles University, Prague, Czech Republic. 29 July 2008.

  64. SIAM Conference on Discrete Math: Minisymposium on Graph Coloring.
    (7,2)-edge-choosability of 3-regular Graphs.
    University of Vermont, Burlington. 19 June 2008.

  65. DIMACS Research Experience for Undergraduates Seminar.
    How Not to Give a Math Talk.
    Rutgers University. 10 June 2008.

  66. 21st Cumberland Conference.
    (7,2)-edge-choosability of 3-regular Graphs.
    Vanderbilt University. 17 May 2008.

  67. SIAM Conference on Optimization: Minisymposium on Graph Coloring for the Computation of Sparse Jacobians and Hessians.
    How to Compute Jacobians More Efficiently or Coloring Highly Structured Graphs.
    Boston, Massachusetts. 10 May 2008.

  68. Computer Science Department Colloquium.
    Discharging and Reducibility: An Introduction by Example.
    Rutgers University, Camden. 9 April 2008.

  69. Graduate Math Seminar.
    The Search for Moore Graphs: Beauty is Rare.
    Rutgers University. 4 April 2008.

  70. Discrete Math Seminar.
    Discharging and Reducibility: An Introduction by Example.
    University of Delaware. 21 March 2008.

  71. Mathematics Department Seminar.
    Discharging and Reducibility: An Introduction by Example.
    Montclair State University. 12 March 2008.

  72. Discrete Math Seminar.
    Star Coloring Planar Graphs with High Girth.
    Princeton University. 6 March 2008.

  73. Graduate Combinatorics Seminar.
    (7,2)-edge-choosability of 3-regular graphs.
    Rutgers University. 5 March 2008.

  74. Combinatorics Seminar.
    Regular Bipartite Graphs are Antimagic.
    City University of New York. 13 February 2008.

  75. Math Seminar.
    Discharging and Reducibility: An Introduction by Example.
    Bell Labs, Murray Hill, N.J. 14 December 2007.

  76. Workshop on Algorithms, Combinatorics, and Geometry.
    Discharging and Reducibility: An Introduction by Example.
    University of North Texas. 29 November 2007.

  77. Experimental Math Seminar.
    Regular Bipartite Graphs are Antimagic.
    Rutgers University. 11 October 2007.

  78. AMS Regional Meeting.
    List-coloring the Square of a Subcubic Graph.
    Depaul University. 5 October 2007.

  79. DIMACS Mixer Series.
    List-coloring the Square of a Subcubic Graph.
    DIMACS Center, Rutgers University. 19 September 2007.

  80. 20th Cumberland Conference.
    Regular Bipartite Graphs are Antimagic.
    Emory University. 17 May 2007.

  81. 44th Midwestern Graph Theory Conference (MIGHTY).
    Regular Bipartite Graphs are Antimagic.
    Wright State University. 11 May 2007.

  82. Combinatorics Seminar.
    Regular Bipartite Graphs are Antimagic.
    University of Illinois at Urbana-Champaign. 1 May 2007.

  83. Seminar.
    List-coloring the Square of a Subcubic Graph.
    Bell Labs, Murray Hill, N.J. 30 March 2007.

  84. Seminar.
    List-coloring the Square of a Subcubic Graph.
    DIMACS Center, Rutgers University. 29 March 2007.

  85. Discrete Math Seminar.
    Coloring and List-coloring of Graphs.
    Iowa State University. 27 March 2007.

  86. Midwest Theory Day.
    List-coloring the Square of a Subcubic Graph.
    Purdue University. 2 December 2006.

  87. 43rd Midwestern Graph Theory Conference (MIGHTY).
    List-coloring the Square of a Subcubic Graph.
    Indiana-Purdue University at Fort Wayne. 4 November 2006.

  88. Graph Theory Seminar.
    List-coloring the Square of a Subcubic Graph.
    Georgia Institute of Technology. 12 October 2006.

  89. DiscMath Seminar.
    List-coloring the Square of a Subcubic Graph.
    Illinois State University. 5 October 2006.

  90. Combinatorics Seminar.
    List-coloring the Square of a Subcubic Graph.
    University of Illinois at Urbana-Champaign. 19 September 2006.

  91. SIAM Conference on Discrete Mathematics.
    Edge-choosability of Planar Graphs with no Two Adjacent Triangles.
    University of Victoria, British Columbia. 26 June 2006.

  92. DIMACS/DIMATIA/Renyi Combinatorial Challenges Meeting.
    Edge-choosability of Planar Graphs with no Two Adjacent Triangles.
    DIMACS Center, Rutgers University. 29 April 2006.

  93. DiscMath Seminar.
    List Edge-colorability of Planar Graphs with no Two Adjacent Triangles.
    Illinois State University. 2 March 2006.

  94. Midwest Theory Day.
    List Edge-colorability of Planar Graphs with no Two Adjacent Triangles.
    University of Wisconsin at Milwaukee. 10 December 2005.

  95. Combinatorics Seminar.
    List Edge-colorability of Planar Graphs with no Two Adjacent Triangles.
    University of Illinois at Urbana-Champaign. 15 November 2005.

  96. Graph Theory with Altitude (in honor of Joan Hutchinson's 60th Birthday).
    A Strong Edge-coloring of Graphs with Maximum Degree 4 using 22 Colors.
    University of Colorado at Denver. 16 May 2005.

  97. Midwest Theory Day.
    A Strong Edge-coloring of Graphs with Maximum Degree 4 using 22 Colors.
    University of Illinois at Urbana-Champaign. 8 May 2005.

  98. Combinatorics Seminar.
    A Cut-and-Paste Sorting Algorithm for Permutations.
    University of Illinois at Urbana-Champaign. 12 April 2005.

  99. Midwest Theory Day.
    Sorting Permutations by Shifts, Flips, and Shift-Flips.
    Depaul University. 4 December 2004.

  100. Combinatorics Seminar.
    Strong Edge-coloring of Graphs with Maximum Degree 4.
    University of Illinois at Urbana-Champaign. 28 October 2003.


Back to my homepage.