Fuller Laboratories, 141
- Visiting Associate Professor, Computer Science
- Director of the Budapest Project Center
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.
- Graph theory
- Discrete mathematics
- Theoretical computer science
- BS, Eotvos University, Hungary, 1990.
- MS, Rutgers University, 1994.
- PhD, Rutgers University, 1994.
- Postdoc, University of Pennsylvania, 1994-96.
- "On cycles in the coprime graph of integers.'' Electronic Journal of Combinatorics, 4 (2), 1997, #R8 (with Paul Erdos).
- "Blow-up Lemma.'' Combinatorica, 17 (1), 1997, pp. 109-123 (with Janos Komlos, Endre Szemeredi).
- "On k-ordered Hamiltonian graphs.'' Journal of Graph Theory, 32, 1999, pp. 17-25 (with Hal Kierstead, Stanley Selkow).
- "Three color Ramsey numbers for paths.'' Combinatorica, 27 (1), 2007, pp. 35-69 (with Andras Gyarfas, Miklos Ruszinko and Endre Szemeredi).
- "Monochromatic cycle partitions of edge-colored graphs.'' Journal of Graph Theory, 66, 2011, pp. 57-64.
- Graduate School Excellence Fellowship, Rutgers University, 1991-92.
- Good Teaching Award, University of Pennsylvania, 1995.
- Doctor of the Hungarian Academy of Sciences, 2009.
- European Journal of Combinatorics, Board member, 2012.