1. and On the Loebl-Koml�s-S�s conjecture, Rapport de Recherche, L.R.I., Universite Paris Sud, n� 1094, 1997.
2. The Erdős-Sós conjecture for graphs of girth 5
3. and On approximating the longest path in a graph, Proceedings of the 3rd Workshop on Algorithms and Data Structures, LNCS 709 (1993), 421-432; also appeared in Algorithmica 18 (1997), 82-98.
4. and ?Szemer�di's regularity lemma and its applications in graph theory,? Combinatorics, Paul Erd?s is Eighty, Vol. 2, and (Editors), J�nos Bolyai Mathematical Society, Budapest, 1996, 295-352.