Gabor N Sarkozy | Worcester Polytechnic Institute

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

Star versus two stripes Ramsey numbers and a conjecture of Schelp.'' Combinatorics, Probability and Computing 21, 2012, pp. 179-186. (with András Gyárfás).

Clustered knowledge tracing.'' Proceedings of the 11th International Conference on Intelligent Tutoring Systems, LNCS 7315, pp. 407–412, 2012, Springer-Verlag Berlin Heidelberg (with Zach Pardos, Shubhendu Trivedi and Neil Heffernan).

A Practical regularity partitioning algorithm and its applications in clustering.'' Technical Report, Worcester Polytechnic Institute, Department of Computer Science, 2012, WPI-CS-TR-12-05 (with Fei Song, Endre Szemerédi and Shubhendu Trivedi).

An improved bound for vertex partitions by connected monochromatic k-regular graphs.'' Journal of Graph Theory 73, 2013, pp. 127-145. (with Stanley Selkow and Fei Song).

Monochromatic path and cycle partitions in hypergraphs.'' Electronic Journal of Combinatorics 20, 2013, P18. (with András Gyárfás).

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)

Gabor Sarkozy

Scholarly Work