Gabor N Sarkozy

Gabor N Sarkozy is a Professor in the Department of Computer Science at Worcester Polytechnic Institute (WPI). He holds a PhD from Rutgers University (1994) and completed a postdoc at the University of Pennsylvania (1994-1996). His research focuses on graph theory, discrete mathematics, and theoretical computer science, particularly the structure of large graphs and Ramsey-type problems.

• Education: BS, Eötvös University (1990); MS, PhD, Rutgers University (1994); Postdoc, University of Pennsylvania (1994-1996)

His scholarly work spans over 100 publications, with notable collaborations with Endre Szemerédi, János Komlós, and András Gyárfás. Key contributions include algorithmic applications of the Blow-up Lemma, monochromatic cycle partitions, and advancements in Ramsey theory for hypergraphs and planar graphs.

Professional highlights include the Good Teaching Award (1995) and the Doctor of the Hungarian Academy of Sciences (2009). He founded the Budapest Project Center, WPI's first project center in Eastern Europe, and remains actively engaged in educational data mining projects.

• Scientific Awards
  • Good Teaching Award, 1995
  • Doctor of the Hungarian Academy of Sciences, 2009

His research trends over the past two decades show a transition from classical Ramsey theory and graph decomposition (1995-2010) to interdisciplinary applications in time series analysis and educational data mining (2011-2024), while maintaining core contributions to combinatorial graph theory.

Advising and grants are not explicitly detailed in the provided texts, though his collaborative nature is evident through extensive co-authorships. He maintains active research groups at WPI and the Rényi Institute, with ongoing projects in Ramsey-type problems and algorithmic applications.