This line of research stems from my Ph. D. work which I did under the guidance and in collaboration with V. Rodl from Emory University. The thesis is on algorithmic aspect of graph and hypergraph regularity. My interests have expanded since then to include cycle-related problems in graph theory.

In collaboration with M. Hanckowiak from Adam Mickiewicz University in Poznan, Poland I am working on the local-global aspect of distributed algorithms. We are mainly interested in deterministic algorithms for graph-theoretic problems that work in the Linial's model.