Students

The following students are doing their PhD thesis in our research team:

Name researcher (advisor/s)	Research interest	Photo
Jordi Castellví (Advisors: M. Noy and C. Requilé) FPI Maria de Maeztu Scholarship (CRM)	Enumerative and analytic combinatorics
Miquel Ortega (Advisor: O. Serra) FPI Scholarship. CONTREWA project	Additive combinatorics and combinatorial number theory
Tabriz Popatia (Advisor: S. Ball) FPI-UPC Scholarship	The geometry of quantum and classical error-correction
Robin Simoens (Advisor: S. Ball)  FWO Scholarship	Finite geometry, spectral graph theory and coding theory
Sofiya Burova (Advisors: G. Lugosi, G. Perarnau)  FPI Scholarship (UPF)	Stochastic processes on random graph
Xavier Povill (Advisors: P. Morris, G. Perarnau) FPI-UPC Scholarship
Richard Coll (Advisors: G. Lugosi, J. Rué) FPU Scholarship
Antônio Kaique Barroso Fernandes (Advisor: R. Lang) FPI Scholarship. COCOA Project

(Foto of PhD student at FME-UPC: June 2017)

Past graduate students

- Juanjo Rué (2009): Enumeration and limit laws of topological graphs. Supervisor: M. Noy

- Amanda Montejano (2009): Colored combinatorial structures. Supervisor: O. Serra

- Jordi Moragas (2010):  Graph labelings and graph decompositions by partitioning sets of integers. Supervisor. A. Lladó

- Lluis Vena (2012): The removal lemma: algebraic versions and applications. Supervisor: O. Serra

- Guillem Perarnau (2013): Random combinatorial structures with low dependencies. Supervisor: O. Serra

- Arnau Padrol (2013): Neighborly and almost neighborly configurations, and their duals. Supervisor: J. Pfeifle

- Aaron Dall (2015): h-vectors, Zonotopes, and Lawrence Polytopes. Supervisor: J. Pfeifle

- Lander Ramos (2017): Graph enumeration and random graphs. Supervisor: M. Noy 

- Jordi Delgado (2017): Extensions of free groups: algebraic, geometric, and algorithmic aspects. Supervisor: E. Ventura

- Clément Requilé (2017): Asymptotic study of regular planar graphs.  Supervisor: J. Rué at Freie Universität Berlin

- Mallika Roy (2020): Algebraic and algorithmic aspects of Zm × Fn : fixed subgroups and quantification of inertia. Supervisor: E. Ventura

- Christoph Spiegel (2020): Additive structures and Randomness in Combinatorics. Supervisors: J. Rué and O. Serra

- Vasiliki Velona (2021): A study on structure recovery and the broadcasting problem. Supervisors: Gábor Lugosi at UPF and J. Rué

- Matthew Coulson (2021): Threshold phenomena involving the connected components of random graphs and digraphs. Supervisor: G. Perarnau

- Maximilian Wötzel  (2022): Probabilistic and Extremal studies in Additive Combinatorics. Supervisors. J.Rué and O. Serra

- Alberto Larrauri (2023): Logic laws on random graphs and discrete structures. Supervisor: M. Noy

- Ricard Vilar (2025): Quantum Analogues of Classical Codes. Supervisor: S. Ball