Papers
"Packing tree factors in random and pseudo-random graphs." Submitted. [Co-Authors: A. Frieze , M. Krivelevich , P. Loh ]
"A greedy algorithm for finding a large 2-matching on a random cubic graph." Submitted. [Co-Authors: P. Bennett , T. Bohman , A. Frieze ]
"The t-tone chromatic number of random graphs." To appear in Graphs and Combinatorics. [Co-Authors: P. Bennett , A. Dudek , A. Frieze ]
Preprint ,
Journal Version
"Packing tight Hamilton cycles in uniform hypergraphs" SIAM Journal on Discrete Mathematics 26, 2012, 435-451. [Co-Author: A. Frieze ]
Preprint ,
Journal Version
"On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching." Discrete Mathematics 311, 2011, pp 2577-2580 [Co-Authors: A. Dudek , Z. Yilma ]
"Graph Connectivity, Partial Words, and a Theorem of Fine and Wilf." Information and Computation, Vol. 206, 2008, pp 676-693 [Co-Authors: F. Blanchet-Sadri , G. Sisodia ]
Other Writings
Talks
UPCOMING:
Ottawa-Carleton Discrete Mathematics Days (May. 2013)
Canadian Discrete and Algorithmic Mathematics - CanaDAM (Jun. 2013)
54th Midwest Graph Theory Conference - MIGHTY LIV, Miami University of Ohio. "Packing Tree Factors in (Pseudo-) Random Graphs" (Apr. 2013)
Portland State University. "Random and Pseudo-Random Graphs" (Feb. 2013)
Graph Theory Seminar, Western Michigan University. "The 2-tone chromatic number of random graphs" (Jan. 2013)
Algorithms, Combinatorics and Optimization Seminar, Carnegie Mellon University. "Packing tight Hamilton cycles in uniform hypergraphs" (Jan. 2012)
ACO Graduate Student Seminar, Carnegie Mellon University ``Packing tight Hamilton cycles in hypergraphs" (Mar. 2012)
Graduate Student Seminar, Carnegie Mellon University. 5 talks:
"Random and Pseudo-Random Graphs" (2013)
"0-1 laws for random graphs" (2012)
"Normal numbers" (2012)
"The maximum number of edges in a hypergraph with a unique perfect matching"(2011)
"The probabilistic method" (2011)
Summer Undergraduate Applied Mathematics Institute, Carnegie Mellon University. "Ramsey Theory" (Jun. 2012)