Zelealem Belaineh Yilma
Carnegie Mellon University Qatar
Doha, QATAR
Email: zyilma AT qatar DOT cmu DOT edu
I am an assistant teaching professor at Carnegie Mellon Univeristy Qatar
where I teach courses in mathematics and operations research.
I completed my doctoral studies at
Carnegie Mellon University
where I was in the
ACO
(Algorithms, Combinatorics and Optimization)
program.
My advisor was Oleg Pikhurko.
I then spent one year as a postdoctoral researcher at the Laboratoire d'Informatique Algorithmique: Fondements et Applications
(LIAFA)
at Université Paris Diderot (Paris VII).
After my year in Paris, I taught for two years in the mathematics department at Addis Ababa University
before coming to my current position in Doha, Qatar.
Papers
 (with T. Jiang and O. Pikhurko)
Set Systems Without a Strong Simplex,
SIAM J Discr Math, 24 (2010) 10381045.

(with D. Bal and A. Dudek)
On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching,
Discrete Math, 311 (2011) 25772580.

(with O. Pikhurko)
The Maximum Number of K_3Free and K_4Free Edge 4Colorings,
J London Math Soc, 85 (2012) 593615.
 Antimagic Properties of Graphs with Large Maximum Degree,
J Graph Theory, 72 (2013) 367373.

(with J.S. Sereni)
A tight bound on the set chromatic number,
Discuss. Math. Graph Theory, 33 (2013) 461465.

(with Tomáš Kaiser and J.S. Sereni)
Multiple Petersen subdivisions in permutation graphs,
Electronic J. Combinatorics, 20 (2013), #P37.

(with D. Král', C.H.Liu, J.S. Sereni, and P. Whalen)
A new bound for the 2/3 conjecture,
Combinatorics, Probability and Computing, 22 (2013) 384393.

(with O. Pikhurko)
Supersaturation Problem for ColorCritical Graphs,
submitted, 21pp.