PhD students

Jordi Castellví (in progress). Enumeration of chordal graphs and related classes of graphs. 

Alberto Larrauri (2023). First order logic of sparse random structures. Currently postdoctoral researcher at U. Oxford.

Lander Ramos (2107). Graph enumeration and random graphs. Currently Engineer at Google, Dublin. 

Juanjo Rué (2009). Enumeration and limit laws of topological graphs. Currently Associate Professor at UPC.

Omer Giménez (2005). Enumerative aspects and Tutte polynomials of graphs and matroids. Currently Engineer at Google, Palo Alto, CA.

Sergi Elizalde (2004). Consecutive patterns and statistics on restricted permutations. Currently Full Professor at Dartmouth College, NH.

Anna de Mier (2003). Graphs and matroids determined by their Tutte polynomials. Currently Associate Professor at UPC.

Master's students

Eduard Gonzalvo (2020). Enumeration of planar maps using generating functions.

Alberto Larrauri (2019). First order logic of sparse hypergraphs. Currently PhD student at UPC.

Thomas Lesgourgues (2019). Largest components in random graphs with given degree sequence. Currently  PhD student at UNSW Sidney.

Ivan Geffner (2014).  Enumeration and random generation of planar maps. Currently PhD student at Cornell U. 

Katerina Bohmova (2011). Characterizations of classes of graphs by forbidden minors. PhD in Computer Science, ETH Zürich (2016).