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

Cycles in bipartite graphs and an application in Number Theory.'' Journal of Graph Theory, 19 (3), 1995, pp. 323-331.

On sums with small prime factors.'' Acta Mathematica Hungarica, 67 (4), 1995, pp. 333-345.

``Proof of a packing conjecture of Bollobas.'' Combinatorics, Probability and Computing, 4, 1995, pp. 241-255 (with János Komlós, Endre Szemerédi).

``On the square of a Hamiltonian cycle in dense graphs.'' Random Structures and Algorithms, 9, 1996, pp. 193-211 (with János Komlós, Endre Szemerédi).

``Blow-up Lemma.'' Combinatorica, 17 (1), 1997, pp. 109-123 (with János Komlós, Endre Szemerédi).

An algorithmic version of the Blow-up Lemma.'' Random Structures and Algorithms, 12, 1998, pp. 297-312 (with János Komlós, Endre Szemerédi).

Professional Highlights & Honors
Good Teaching Award, 1995
University of Pennsylvania
Doctor of the Hungarian Academy of Sciences, 2009