Find Academic Supervisors

Yann Ponty is a tenured CNRS Researcher at the Computer Science Department (LIX) of École Polytechnique (Institut Polytechnique de Paris, France). He leads the AMIBio team and serves as Deputy Director of LIX. His work focuses on developing bioinformatics methods at the intersection of computer science, mathematics, and molecular biology, particularly for RNA structure prediction, design, and evolution. He holds leadership roles in the ISCB Board of Directors (2025-2027) and the HDR referent for the IDIA department (CS&Interactions) at IP Paris. Research Interests: RNA folding/design/evolution, RNA-RNA/RNA-protein interactions, random generation, enumerative combinatorics, discrete algorithms, parameterized complexity, RNA visualization Key Contributions: Developed algorithms for RNA inverse folding, pseudoknot modeling, and dynamic programming optimization Collaborations: Partnerships with institutions like Simon Fraser University, Boston College, and Université Paris-Saclay His recent publications (15 most recent) span RNA structure prediction, pseudoknot partition functions, linear-time inverse folding algorithms, and parameterized sampling techniques. The work emphasizes dynamic programming, combinatorial approaches, and integration of experimental data for improving RNA modeling. Scientific awards include election to the ISCB Board of Directors (2025-2027) and leadership roles in academic networks like GdR BIM. He actively contributes to software development (VARNA, RNANR, SPARCS, IncaRNAtion, RNARedPrint) and serves as Associate Editor for Bioinformatics (OUP). Teaching engagements include graduate-level courses in combinatorial optimization, RNA bioinformatics, and algorithms at Université Paris-Saclay and École Polytechnique.

• RNA Folding
• RNA Design
• RNA Evolution
• +9 more

Lluis Vena Cros is a distinguished researcher in the Department of Mathematics at Universitat Politècnica de Catalunya - BarcelonaTech (UPC-BarcelonaTech), affiliated with the Faculty of Mathematics and Statistics. He is a core member of the GAPCOMB research group, which specializes in Geometric, Algebraic and Probabilistic Combinatorics. His research spans multiple domains within combinatorics, with particular emphasis on graph theory, algebraic combinatorics, geometric combinatorics, and probabilistic combinatorics. Vena Cros has made significant theoretical contributions to the understanding of graph homomorphisms, Tutte polynomials, Ramsey theory, and extremal combinatorial structures. His work often explores the deep connections between combinatorial objects and other mathematical disciplines such as topology, algebra, and discrete geometry. An analysis of his recent publications reveals a consistent focus on combinatorial structures with applications across multiple mathematical domains. His work on Tutte polynomials for various graph structures demonstrates a unifying approach to graph invariants, while his research in Ramsey theory explores structural properties of large combinatorial objects. The recurring theme across his publications is the investigation of extremal properties and computational aspects of combinatorial configurations. Vena Cros actively participates in multiple research projects including 'Structure, Randomness and Computational Methods in Extremal Combinatorics,' 'COntemporary COmbinatorics and Applications (COCOA),' and the 'Grup GAPCOMB de la UPC.' These projects involve collaborations with numerous researchers across Spain and internationally, reflecting his significant standing in the combinatorial mathematics community. His work has been supported by various funding bodies including the Spanish State Research Agency and the European Union's Horizon 2020 program. As a member of the GAPCOMB research group, Vena Cros contributes to a vibrant mathematical community focused on advancing combinatorial theory and its applications. The group maintains strong connections with other research centers and regularly participates in international conferences and collaborative projects, fostering the exchange of ideas across the global combinatorial mathematics community.

• Combinatorics
• Graph Theory
• Algebraic Combinatorics
• +4 more

Lluís Vena is a Research Fellow at the Polytechnic University of Catalonia (UPC), where he is a member of the GAPCOMB research group. His research focuses on extremal graph theory, Ramsey theory, graph polynomials, and additive number theory. He holds a Ph.D. from the University of Toronto (2014) and has held postdoctoral positions at institutions including Charles University in Prague and the University of Amsterdam. Education: Ph.D. in Mathematics, University of Toronto, Canada (2009–2014) Research Interests: Lluís’ work explores combinatorial structures with an emphasis on extremal problems, Ramsey-type phenomena, and algebraic approaches to graph theory. He investigates properties of graph polynomials (e.g., Tutte polynomial), hypergraphs, and additive configurations in groups. Publications: His recent work includes studies on Kruskal-Katona extremal families, graph embeddings on surfaces, and Ramsey degrees in hypergraphs. These contributions bridge discrete mathematics with topological and algebraic methods. Collaborations: He has collaborated with researchers such as O. Serra, A. Goodall, and J. Nešetřil on topics ranging from graph homomorphisms to additive combinatorics. Labs/Teams: Active member of the GAPCOMB group at UPC, focusing on combinatorics and graph theory research.

• Extremal Graph Theory
• Ramsey Theory
• Graph Polynomials
• +3 more

Carlos Martins da Fonseca (born 1968 in Figueira da Foz, Portugal) is a full professor at Kuwait College of Science and Technology with expertise in combinatorial matrix theory and spectral graph theory. His research spans multiple mathematical disciplines with significant interdisciplinary applications. Education: DSc in Mathematics (2016), Technical University - Sofia, Bulgaria PhD in Mathematics (1996-2000), University of Coimbra, Portugal BSc in Mathematics (1986-1991), University of Coimbra, Portugal Da Fonseca's research focuses on combinatorial matrix theory, spectral graph theory, trigonometric sums, and connections between abstract and linear algebras. His work demonstrates strong interdisciplinary applications across mathematical physics, computer science, and engineering disciplines. He serves as editor-in-chief of Special Matrices, a journal on structured matrices published by De Gruyter. Analysis of his recent publications (2023-2025) reveals a consistent research trajectory centered on matrix theory, graph spectra, and combinatorial sequences. His work frequently examines Sylvester-Kac matrices, Toeplitz structures, Fibonacci-type sequences, and their spectral properties. The research demonstrates sophisticated connections between combinatorial structures and algebraic properties. As editor-in-chief of Special Matrices, da Fonseca contributes significantly to the mathematical community through scholarly publication. His research program maintains active international collaborations, as evidenced by co-authored publications with researchers from multiple countries.

• Combinatorial Matrix Theory
• Spectral Graph Theory
• Trigonometric Sums
• +3 more

Anna De Mier Vinue is an Associate Professor at the Department of Mathematics, Universitat Politècnica de Catalunya (UPC), affiliated with the Facultat d'Informàtica de Barcelona (FIB). She leads research in combinatorics, graph theory, and matroid theory as part of the UPC's GAPCOMB research group (Geometric, Algebraic and Probabilistic Combinatorics). Her work focuses on structural combinatorics, polynomial invariants, and discrete geometry. Education: Holds a PhD in Applied Mathematics from UPC. Research Interests: Combinatorial enumeration, graph polynomials (Tutte, U-polynomials), matroid representations, non-crossing structures, and algorithmic combinatorics. Her contributions bridge algebraic methods with geometric and probabilistic approaches. Publications: Over 77 works including articles in Discrete Mathematics, European Journal of Combinatorics, and SIAM Journal on Discrete Mathematics. Recent research explores marked graphs, Tutte polynomial evaluations, and lattice approximations in clutter theory. Active in international projects like COCOA and R+D+I initiatives. Grants & Collaborations: Co-leads projects on extremal combinatorics, geometric algorithms, and mathematical education. Collaborates with researchers from BarcelonaTech and international institutions. Involved in initiatives addressing gender equality in STEM education through statistical analysis. Labs/Teams: Core member of the UPC's GAPCOMB group, contributing to interdisciplinary projects at the Institut de Matemàtiques de la UPC-BarcelonaTech. Supervises research in combinatorial geometry and algebraic structures.

• Combinatorics
• Graph Theory
• Matroid Theory
• +3 more

Jesus Salas Martinez is an Associate Professor and Deputy Director of the Gregorio Millan Barbany Institute in the Department of Mathematics at Carlos III University of Madrid. His research focuses on statistical mechanics, critical phenomena, and combinatorial algorithms. Dr. Salas Martinez investigates phase transitions in lattice models including Potts and Ising systems, develops Monte Carlo algorithms, and analyzes universality classes in critical systems. His work bridges mathematical physics, combinatorics, and computational methods. His publications demonstrate consistent focus on finite-size scaling corrections, ergodicity properties of algorithms, and exact solutions in statistical mechanical models.

• Statistical Physics
• Critical Phenomena
• Combinatorics
• +3 more

Germán Rodrigo is a tenured Research Professor at the Instituto de Física Corpuscular (IFIC) , a joint centre of the Spanish National Research Council (CSIC) and the University of Valencia . After earning his PhD in 2003 under Arcadi Santamaria, he held post-doctoral positions at KIT Karlsruhe and CERN before returning to Valencia in 2008. He currently leads the quantum–phenomenology group within the theoretical physics department. His research straddles high-energy collider phenomenology and quantum computing. Rodrigo is internationally recognised for turning multi-loop Feynman integrals into causal, loop-tree-dual forms and for implementing the resulting algorithms on real quantum hardware. Key achievements include the first quantum calculation of loop integrals, quantum jet clustering at the LHC, and quantum amplitude estimation with error mitigation. Recent work (2022-2025) focuses on: Quantum integration of decay rates and fragmentation functions Graph-based quantum algorithms for causal multi-loop configurations Adaptive importance sampling on quantum annealers and gate-based devices Factorisation-breaking studies in triple-collinear splitting with massive partons He advises three doctoral students and is PI on a national Spanish grant supporting the group’s quantum-technologies programme. No personal e-mail is publicly listed; contact is handled through the IFIC secretariat.

• High-energy particle phenomenology
• Quantum computing for scattering amplitudes
• Loop-tree duality
• +3 more

Simeon Ball is a Senior Lecturer (Profesor Agregat) at the Universitat Politècnica de Catalunya (UPC), affiliated with the Department of Mathematics and the School of Telecommunication and Aerospace Engineering. His research focuses on classical and quantum error-correcting codes, finite geometries, semifields, and graph theory, with a strong emphasis on applying geometrical and linear algebra methods. He has held academic positions at UPC since 2007, previously holding research roles at institutions like the Technical University of Eindhoven and Queen Mary College, University of London. Ball holds a PhD from the University of Sussex (1994) and a Bachelor of Arts in Mathematics from the University of Cambridge (1989). He has authored three influential books, including Finite Geometry and Combinatorial Applications (2015) and A Course in Combinatorics and Graphs (2024). His work has been supported by grants from the Spanish Ministry of Science, including projects on combinatorics and applications. Ball actively supervises doctoral students and advises master’s theses, focusing on topics like quantum LDPC codes, Hilbert spaces, and geometric quasi-cyclic codes. He teaches courses on quantum computation, linear algebra, and coding theory. Ball is also an editorial board member of the Journal of Geometry and Journal of Combinatorial Theory, Series A . His research contributions span over 150 publications, including seminal works on MDS codes, finite geometries, and quantum error correction. Key achievements include proving the MDS conjecture over prime fields and developing geometric approaches to stabilizer codes.

• Classical Error-Correcting Codes
• Quantum Error-Correcting Codes
• Finite Geometries
• +5 more

Enrique Benavent López is an Associate Professor at the Universitat de València, affiliated with the Department of Statistics and Operations Research. His academic career has been dedicated to operations research, particularly in the area of arc routing and combinatorial optimization. Research Interests: Operations Research and Mathematical Programming Capacitated Arc Routing Problem (CARP) Rural Postman Problem (RPP) and its variants Vehicle Routing with Turn Penalties Integer Programming and Polyhedral Combinatorics Heuristic and Metaheuristic Algorithms His research spans theoretical algorithm development and practical applications in logistics and transportation. He has made significant contributions to the formulation and solution of hard optimization problems on networks, particularly through cutting-plane methods and branch-and-cut algorithms. Publication Trends: His work over the past four decades shows a consistent focus on arc routing problems. Early work addressed the quadratic assignment problem and basic postman problems, while later research concentrated on capacitated, windy, and mixed variants with additional constraints. The publications demonstrate a shift from exact methods to hybrid heuristics, reflecting broader trends in the field. His most cited works involve lower bounds, cutting planes, and branch-and-cut for CARP. Scientific Contributions: Developed foundational lower bounds for the Capacitated Arc Routing Problem Introduced exact algorithms based on cutting planes and branch-and-cut Contributed to the polyhedral analysis of arc routing problems Advanced heuristic methods for windy and mixed networks Pioneered work on turn penalties in directed rural postman problems Collaborations and Advising: He has collaborated extensively with leading researchers such as Ángel Corberán, José María Sanchis, and José-Manuel Belenguer. While specific students are not listed, his long-standing research activity suggests he has supervised PhD and Master's students in operations research. He has contributed to major reference works in arc routing and is frequently cited in the literature. Laboratories and Research Groups: He is part of a strong research group in combinatorial optimization at the Universitat de València, focusing on routing and scheduling problems. This group has produced influential work in both theoretical and applied aspects of operations research.

• Operations Research
• Mathematical Programming
• Combinatorial Optimization
• +6 more

Clemens Huemer is a professor affiliated with the Department of Mathematics at the Escola d'Enginyeria de Telecomunicació i Aeroespacial de Castelldefels (EETAC), part of the Universitat Politècnica de Catalunya (UPC). He is a key member of the DCCG (Discrete, Combinational, and Computational Geometry) research group, where he contributes extensively to theoretical and applied geometric research. His work spans computational, discrete, and combinatorial geometry with strong ties to graph theory and combinatorics. His primary research interests include computational geometry, discrete and combinatorial geometry, Voronoi diagrams (especially higher-order variants), geometric graphs, point set configurations, and algorithmic geometry. He investigates structural properties of geometric objects, combinatorial configurations, and optimization problems in discrete settings. His recent publications emphasize Voronoi constructions, matching problems in colored point sets, spectral properties of token graphs, and production matrices for enumerating geometric graphs. The trends in his recent articles (2021–2024) reflect a deep focus on higher-order Voronoi diagrams, geometric matching, and combinatorial properties of point sets and graphs. His work combines theoretical depth with algorithmic insights, often involving polynomial representations, spectral analysis, and geometric enumeration. The recurring themes include structural analysis of geometric arrangements, extremal problems in point sets, and algebraic-combinatorial methods in geometry. Clemens Huemer has been involved in multiple competitive R&D projects, including those funded under the Spanish State Research Plans and Horizon 2020, often in collaboration with leading researchers in computational geometry. He has served on scientific committees of conferences such as the Workshop on Geometric Networks and the Intensive Research Program on Discrete, Combinatorial and Computational Geometry, indicating leadership in the academic community. He advises and collaborates with numerous researchers and students, though specific advisees are not listed in the provided data. His research is supported through national and European grants, and he actively contributes to the dissemination of results via conference presentations and journal publications in top venues such as Discrete and Computational Geometry , Computational Geometry: Theory and Applications , and European Workshop on Computational Geometry . Clemens Huemer is based at the Baix Llobregat campus of UPC and is deeply embedded in the UPC research network, with extensive collaborations across institutions in Spain and internationally. His work is central to the DCCG group’s efforts in advancing the theoretical foundations of discrete and computational geometry.

• Computational Geometry
• Discrete Geometry
• Combinatorial Geometry
• +7 more

Oriol Serra Albo is a Professor in the Department of Mathematics at Universitat Politècnica de Catalunya (UPC), affiliated with the Institute of Mathematics of UPC-BarcelonaTech (IMTech) and the Faculty of Mathematics and Statistics (FME). He leads the research group GAPCOMB (Geometric, Algebraic and Probabilistic Combinatorics) and maintains collaborations with the Barcelona Graduate School of Mathematics. Research Focus: Serra's work spans three interconnected domains: Combinatorics : Developing novel frameworks for discrete structure analysis Additive Number Theory : Investigating sumset properties in algebraic structures Graph Theory : Exploring coloring problems and structural graph properties Publication Trends: His recent articles (2021-2024) demonstrate a focus on extremal problems in additive combinatorics, structural properties of random graphs, and algebraic methods in discrete mathematics. Common themes include product-free sets in non-abelian groups, vertex bisection in random regular graphs, and probabilistic approaches to combinatorial optimization. Research Leadership: Serra coordinates multiple competitive research projects including: Structure, Randomness and Computational Methods in Extremal Combinatorics Contemporary Combinatorics and Applications (COCOA) Geometric, Algebraic and Probabilistic Combinatorics Combinatoria: nuevas tendencias y aplicaciones Academic Service: Regularly serves on scientific committees for international conferences including the European Conference on Combinatorics and French Combinatorial Conference.

• Combinatorics
• Additive Number Theory
• Graph Theory

Fabian Reiter is an associate professor in theoretical computer science at Gustave Eiffel University (formerly University of Paris-Est Marne-la-Vallée). He is affiliated with the BAAM team at the Gaspard Monge Laboratory of Computer Science (LIGM). His academic journey includes postdoctoral positions at Technical University of Munich (TUM), LSV (University of Paris-Saclay), and a PhD at Paris Diderot University under Olivier Carton, focusing on distributed automata and logic. His Master's thesis at the University of Freiburg explored algorithmic and computational logic under Fabian Kuhn and Andreas Podelski. Reiter's research centers on logic and formal models of distributed computing, particularly extending descriptive complexity theory to distributed systems. He investigates equivalences between distributed algorithm classes and logical formulae, aiming to characterize computational power via logical frameworks. Key contributions include foundational work on distributed automata, modal μ-calculus, and the interplay between algorithmic expressiveness and logical expressiveness. His publications span venues like PODC, CONCUR, FOSSACS, and LICS, addressing topics such as polynomial hierarchy in distributed systems, asynchronous models, and automata-logic equivalences. His PhD thesis, “Distributed Automata and Logic” , explores logical characterizations of distributed automata variants, including nonlocal and asynchronous models. Current research emphasizes bridging distributed computing with descriptive complexity to develop machine-independent computational characterizations. Reiter’s work is supported by grants from the Simons Foundation and ERC projects (e.g., PaVeS and EQualIS). He actively contributes to conferences through talks at venues like PODC 2024 and CONCUR 2020, and his findings are accessible via dblp, arXiv, and institutional repositories.

• Theoretical Computer Science
• Distributed Computing
• Formal Models
• +5 more

Josep Alvarez Montaner is a Professor in the Department of Mathematics at Universitat Politècnica de Catalunya (UPC), affiliated with the Facultat de Matemàtiques i Estadística (FME). He is a member of the GEOMVAP research group (Geometry of Varieties and Applications). His work focuses on algebraic geometry, commutative algebra, D-modules, and singularity theory. He has supervised PhD students including Ferran Dachs Cadefau and Roger Gómez-López, and has been awarded the Premi Extraordinari de Doctorat twice. Education & Research: PhD in Mathematics from UPC, with extensive contributions to local cohomology, multiplier ideals, and D-module theory. His research bridges algebraic structures with geometric and combinatorial methods. Grants & Projects: Co-led multiple competitive projects like 'Interacciones de Geometría con Álgebra y aplicaciones' (2022–2024) and 'Geomatría algebraica, simpléctica, aritmética y aplicaciones' (2010–2013). Active in grant acquisition under RIS3CAT and Spanish national programs. Publications: Over 170 publications, including articles in Journal of Algebra , Advances in Mathematics , and International Mathematics Research Notices . Key topics include Lyubeznik numbers, Bernstein-Sato polynomials, and Frobenius algebras. Labs/Teams: Core member of the GEOMVAP group, collaborating with researchers like Maria Alberich and Marta Casanellas on geometric and algebraic applications.

• Algebraic Geometry
• Commutative Algebra
• D-modules
• +3 more

Josep Gonzalez Rovira is a Professor at the Universitat Politècnica de Catalunya (UPC), affiliated with the Departament de Matemàtiques at the Escola Politècnica Superior d'Enginyeria de Vilanova i la Geltrú (EPSEVG). His research focuses on Number Theory, Algebraic Geometry, and computational aspects of modular forms and curves. He is a core member of the STNB (Seminari de Teoria de Nombres de Barcelona) research group, contributing to projects like 'Aritmética de funciones L y estructuras de Galois' and 'Técnicas computacionales en teoría de números.' Key research interests include modular curves, elliptic curves, Q-curves, automorphism groups, and applications to cryptography. He has authored over 80 publications, including studies on division polynomials, bielliptic curves, and Frobenius distributions. His work often intersects computational methods, as seen in projects involving SageMath and collaborations on hyperelliptic curves. Josep has advised doctoral students like Santiago Molina (2011) and contributed to grants funded by Spain's Plan Nacional and Catalan agencies. His academic contributions include editorial roles in journals like Experimental Mathematics and Publicacions Matemàtiques , reflecting his leadership in advancing algebraic number theory and arithmetic geometry.

• Number Theory
• Algebraic Geometry
• Modular Forms
• +3 more

Yamileth del Carmen Quintana Mato is an Associate Professor at the Department of Mathematics, Carlos III University of Madrid, and a member of the Instituto de Ciencias Matemáticas (ICMAT). Previously, she held a Full Professor position at the Department of Pure and Applied Mathematics, Universidad Simón Bolívar. Her roles include serving as Secretary of the Mathematics Department at UC3M. Education & Professional History: Current: Associate Professor, UC3M (since unspecified) Former: Full Professor, Universidad Simón Bolívar Research Focus: Her research spans: Extension of approximation theory results to Sobolev spaces Algebraic/analytic properties of special functions (hypergeometric Bernoulli/Euler polynomials, generalized Bernoulli-Gegenbauer polynomials) Innovative methods: operational matrices, quadrature formulae Molecular graph analysis via topological index bounds in fractional calculus contexts Advising & Grants: No specific grants or advised students listed in available texts. Labs/Teams: Active member of the Instituto de Ciencias Matemáticas (ICMAT) .

• Mathematical Analysis
• Special Functions
• Orthogonal Polynomials
• +7 more