Mining multi-typed and dynamic graphs. Large volumes of data collected nowadays from real-world applications are often represented as graphs. The nodes and the edges of such graphs represent different types of entities and interactions, and they have time information. This project will develop algorithms that mine efficiently such multi-typed and dynamic graphs.