Fuller Labs 134
+1 (508) 8315408
BS Eotvos University 1990
MS Rutgers University 1994
PhD Rutgers University 1994
Postdoc University of Pennsylvania 1994-96

My research interests are in graph theory, discrete mathematics, and theoretical computer science. I am especially interested in studying the structure of very large graphs,; an area that is getting more and more important these days. I enjoy teaching at WPI; in particular, I enjoy the project experience. I am the founder and director of the Budapest Project Center, the first and only WPI Project Center in Eastern Europe. I love sports, especially tennis and soccer.

Scholarly Work

Proof of the Seymour conjecture for large graphs.'' Annals of Combinatorics, 1, 1998, pp. 43-60 (with János Komlós, Endre Szemerédi).
An application of the Regularity Lemma in generalized Ramsey theory.'' Journal of Graph Theory 44, 2003, pp. 39-49 (with Stanley Selkow)
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.'' Journal of Combinatorial Theory, Ser. B 98, 2008, pp. 342-358 (with András Gyárfás, Jeno Lehel and Richard Schelp).
Stability of the path-path Ramsey number.'' Discrete Mathematics 309, 2009, pp. 4590-4595 (with András Gyárfás and Endre Szemerédi).
Long rainbow cycles in proper edge-colorings of complete graphs.'' Australasian Journal of Combinatorics 50, 2011, pp. 45-53 (with András Gyárfás, Miklós Ruszinkó and Richard Schelp)
Applying Clustering to the Problem of Predicting Retention within an ITS: Comparing Regularity Clustering with Traditional Methods.'' Proceedings of the 26th International FLAIRS Conference, 2013, pp. 527-532. (with Fei Song, Shubhendu Trivedi, Yutao Wang and Neil Heffernan)
Professional Highlights & Honors
Good Teaching Award
University of Pennsylvania
Doctor of the Hungarian Academy of Sciences