جستجوی استاد راهنمای دانشگاهی

Guillem Perarnau is an Associate Professor in the Department of Applied Mathematics at Universitat Politècnica de Catalunya (UPC), affiliated with CRM, IMTech, and BGSMath. He holds a PhD from UPC (advised by Oriol Serra) and was a CARP Postdoc Fellow at McGill University (2013–2015). From 2016 to 2019, he was a Lecturer at the University of Birmingham. His research focuses on Probabilistic and Extremal Combinatorics, Random Combinatorial Structures, and Discrete Stochastic Processes. Education: Bachelor, Master, and PhD in Mathematics at UPC. His academic journey includes postdoctoral research at McGill University and a Lecturer role at the University of Birmingham. Research interests include Percolation Theory, Random Graphs, Stochastic Processes, and Algorithmic Combinatorics. His recent work explores topics like percolation on dense graphs, random walk mixing times, and synchronization in automata. He is co-PI of the COCOA grant and coordinates the Spanish Discrete and Algorithmic Mathematics Network. He participates in the RandNET MSCA Exchange Programme. Key contributions include studies on giant components in directed graphs, phase transitions in Glauber dynamics, and extremal problems in graph colorings. His publications span top journals like Annals of Applied Probability , SIAM Journal on Discrete Mathematics , and Random Structures & Algorithms .

• Probabilistic Combinatorics
• Extremal Combinatorics
• Random Combinatorial Structures
• +۳ مورد دیگر

Maria José Serna Iglesias is a Full Professor at the Departament de Ciències de la Computació of the Universitat Politècnica de Catalunya (UPC), Barcelona Tech . She leads the research group ALBCOM (Algorithmics, Bioinformatics, Complexity and Formal Methods) and coordinates doctoral programs in Computing. Her research focuses on algorithmics, computational complexity, social network analysis, and game theory. She actively participates in conferences such as SEA 2023-2025 , CIAC , and Algorithmic Decision Theory . Teaching includes advanced algorithmics courses for undergraduate and master’s programs. Current projects include the MOTION initiative (PID2020-112581GB-C21) on large-scale data processing. Past projects involve EU initiatives like WISEBED and DELIS . Her work bridges theoretical computer science with applications in networks and social systems, emphasizing algorithmic solutions for complex problems.

• Algorithmics
• Complexity Theory
• Social Network Analysis
• +۳ مورد دیگر

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
• +۴ مورد دیگر

Patrick Morris is a postdoctoral researcher in the GAPCOMB group at Universitat Politècnica de Catalunya (UPC) in Barcelona, funded by a Marie Curie fellowship. He holds a PhD in Combinatorics and Graph Theory from Freie Universität Berlin (2021), a Master's from the same institution, and a 4-year MSci from the University of Bristol. His research focuses on Extremal and Probabilistic Combinatorics with applications to Discrete Probability, Number Theory, and Algebraic Group Theory. Notably, his work on canonical Ramsey theorems earned a Best Paper Award at LAGOS 2023. His studies often explore structural properties of graphs and hypergraphs under random perturbations, with emphasis on Hamiltonicity, bootstrap percolation, and transversal problems. Collaborations include projects with Prof. Guillem Perarnau and Prof. Tibor Szabó, yielding impactful results in combinatorial theory. Education: PhD in Mathematics (2021), Freie Universität Berlin Master's in Combinatorics & Graph Theory (Freie Universität Berlin) MSci in Mathematics (University of Bristol, 2015) Research Interests: Extremal Combinatorics Probabilistic Combinatorics Bootstrap Percolation Hypergraph Theory Random Graphs Ramsey-Turán Theory Key Contributions: Over 15 peer-reviewed papers in top journals (e.g., Random Structures & Algorithms , Journal of Combinatorial Theory ), with focus on Hamilton cycles, clique factors, and canonical Ramsey-type theorems. His work bridges combinatorial structure and probabilistic methods, often addressing open problems in graph theory.

• Extremal Combinatorics
• Probabilistic Combinatorics
• Discrete Probability
• +۶ مورد دیگر

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
• +۳ مورد دیگر

Juan José Rué Perna is an Associate Professor in the Department of Mathematics at Universitat Politècnica de Catalunya (UPC), where he serves in the Faculty of Mathematics and Statistics. He also holds the position of Director of CFIS (Centro de Formación Interdisciplinaria Superior) and maintains strong affiliation with the Centre de Recerca Matemàtica (CRM). His academic career spans prestigious institutions across Europe, including Freie Universität Berlin, CSIC-ICMAT in Madrid, and École Polytechnique in Paris. Licenciado en Matemáticas (5-year degree) Engineering degree in Telecommunications (5-year program) PhD in Applied Mathematics (2009), supervised by Professor Marc Noy Rué's research focuses on combinatorics and discrete mathematics, with expertise in combinatorial structures, random graphs, and enumerative problems. His work bridges theoretical mathematics with applications in computer science, particularly in structural graph theory and probabilistic methods. He has made significant contributions to the understanding of planar graphs, random discrete structures, and additive combinatorics problems. His research combines analytic techniques with combinatorial reasoning to solve challenging enumeration and structural problems. His recent publications demonstrate a consistent trajectory in combinatorial mathematics, with emphasis on planar structures, random discrete objects, and additive problems. The works span theoretical investigations of graph structures, enumeration techniques, and probabilistic approaches to combinatorial problems. His research group GAPCOMB (Geometric, Algebraic and Probabilistic Combinatorics) at UPC continues to produce influential work in these areas. Premi Albert Dou de la SCM Rué has successfully supervised multiple PhD students to completion, including Clément Requilé, Christoph Spiegel, Vasiliki Velona, and Maximilian Wötzel. His research has been supported through numerous competitive grants, including ERC projects, ExploreMaps, and participation in the Berlin Mathematical School. He has organized significant academic events such as EUROCOMB 2021 and various workshops on combinatorics and discrete mathematics. As leader of the GAPCOMB research group at UPC, Rué fosters collaboration between geometric, algebraic, and probabilistic approaches to combinatorial problems. The group maintains strong connections with international research centers including ICMAT in Madrid and institutions across Europe, contributing to the vibrant combinatorial research community in Spain and internationally.

• Combinatorics
• Discrete Mathematics
• Random Graphs
• +۴ مورد دیگر

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

Guillem Perarnau Llobet is an Associate Professor at the Department of Mathematics, Universitat Politècnica de Catalunya (UPC), affiliated with CRM (Centre de Recerca Matemàtica), IMTech (Institut de Matemàtiques de la UPC), and BGSMath (Barcelona Graduate School of Mathematics). His academic journey includes a PhD at UPC under Oriol Serra, followed by a CARP Postdoc Fellowship at McGill University with Bruce Reed and Louigi Addario-Berry (2013–2015), and a Lecturer position at the University of Birmingham (2016–2019). Current Role: Associate Professor, UPC Past Roles: Lecturer, University of Birmingham; Postdoc, McGill University Affiliations: CRM, IMTech, BGSMath Research Focus: Probabilistic and Extremal Combinatorics, Random Combinatorial Structures, Discrete Stochastic Processes, and Analysis of Randomized Algorithms. His work bridges theoretical rigor with practical algorithmic insights, particularly in graph theory and random graph dynamics. Article Trends: Recent publications emphasize algorithmic combinatorics, probabilistic methods in random graphs, and hypergraph Hamiltonicity. Key themes include mixing times, synchronization, and percolation phenomena across diverse graph models. Scientific Awards: CARP Postdoc Fellowship Grants & Collaborations: COCOA Grant (coPI) RandNET MSCA Exchange Programme Participant Spanish Discrete and Algorithmic Mathematics Network Coordinator

• Probabilistic Combinatorics
• Extremal Combinatorics
• Random Combinatorial Structures
• +۲ مورد دیگر

Julian Pfeifle is an Associate Professor in the Department of Mathematics at the Polytechnic University of Catalonia (UPC), affiliated with the Terrassa School of Industrial, Aerospace, and Audiovisual Engineering. He is part of the UPC's research group GAPCOMB (Geometric, Algebraic, and Probabilistic Combinatorics). His research focuses on combinatorics, discrete geometry, and algebraic structures, with particular emphasis on polytopes, graph theory, and geometric algorithms. Affiliations: Department of Mathematics, UPC; GAPCOMB Research Group. Education: Doctorate in Mathematics from UPC (thesis directed by G. M. Ziegler). His research interests span polytope theory, combinatorial geometry, algebraic combinatorics, and discrete optimization. Recent work includes studies on non-realizability certificates for polytopes, polynomial roots via Gale duality, and geometric constructions using the Cayley trick. He has contributed to projects funded by national and international grants, including the European Science Foundation's 'SDModels' initiative. Pfeifle has published extensively in top journals like Journal of Combinatorial Theory , Discrete & Computational Geometry , and Experimental Mathematics . His articles often explore polytopal structures, graph algorithms, and combinatorial topology. A notable award is the Richard Rado Preis (Ehrenvolle Anerkennung) for his doctoral thesis. He has advised doctoral students and contributed to research projects such as 'Geometric, Algebraic and Probabilistic Combinatorics' (AGRUPS-2023) and 'Combinatorics and Complexity of Discrete Geometric Structures' (MTM-funded). His work frequently intersects with computational geometry and combinatorial algorithms, with applications in optimization and discrete mathematics.

• Combinatorics
• Discrete Geometry
• Polytopes
• +۳ مورد دیگر

Oriol Serra is a full professor of Applied Mathematics at the Department of Mathematics of the Universitat Politècnica de Catalunya (UPC) since 1999. He holds a PhD in Mathematical Sciences from UPC (1988) and a degree in Mathematics from the Universitat de Barcelona (1983). His primary research areas include combinatorics, graph theory, and combinatorial number theory, with a focus on isoperimetric problems, Ramsey Theory, extremal and probabilistic combinatorics, and additive combinatorics. He has held leadership roles such as Chair of the Department of Mathematics (2011–2017), Vice-Dean of Research at the School of Mathematics (2007–2011), and member of the Executive Committee of the Barcelona Graduate School of Mathematics (2012–2015). He has organized and participated in numerous international conferences and workshops, including the European Conference on Combinatorics (2017, 2019) and the British Combinatorial Conference (2019). His research spans foundational topics in discrete mathematics, with contributions to additive combinatorics, graph labeling, and probabilistic methods. Recent work includes studies on random walk mixing, Sidon set systems, and discrete Brunn-Minkowski inequalities. He has advised over 20 PhD students and numerous master’s students, contributing to the training of new researchers in combinatorics and theoretical computer science. His teaching includes courses on combinatorics, graph theory, and probability at the undergraduate and graduate levels at UPC. Oriol Serra is affiliated with the research group Geometric, Algebraic, and Probabilistic Combinatorics (GAPCOMB) and has been involved in multiple funded projects, including the Marie Curie fellowship GEOSUMSETS (2010–2012) and the Spanish-funded project GEOMETRÍA DISCRETA (2018–2020).

• Combinatorics
• Graph Theory
• Combinatorial Number Theory
• +۵ مورد دیگر

Jorge Delgado Rodriguez is a researcher affiliated with the Universitat Politècnica de Catalunya (UPC-BarcelonaTech) in the Department of Mathematics at the Escola Politècnica Superior d'Enginyeria de Manresa . His work primarily focuses on geometric, algebraic, and probabilistic combinatorics, with significant contributions to algorithmic problems in free and free-abelian groups. Research Interests : Geometric and algebraic combinatorics, subgroup intersections, Stallings automata, free group extensions, algorithmic decidability. Scientific Awards : Recipient of the Borsa Ferran Sunyer i Balaguer prize. Key Publications include advancements in Stallings automata (2024), orbit problems for free-abelian-by-free groups (2024), intersection configurations (2024), and decidability of Brinkmann problems (2024). His research spans algebraic structures, automata applications, and computational methods in group theory.

• Geometric Combinatorics
• Algebraic Combinatorics
• Probabilistic Combinatorics
• +۲ مورد دیگر

Richard Johannes Lang is a Researcher in the Department of Mathematics at the Polytechnic University of Catalonia (UPC), affiliated with the Faculty of Mathematics and Statistics. He is a core member of the GAPCOMB research group specializing in Geometric, Algebraic, and Probabilistic Combinatorics, contributing to UPC's prominence in discrete mathematics. His research centers on Combinatorics with deep expertise in Extremal, Geometric, Algebraic, and Probabilistic subfields. He investigates structural graph properties, tiling problems, and combinatorial designs using probabilistic frameworks and computational methodologies, addressing fundamental theoretical challenges. Lang's recent work on perfect mixed tilings exemplifies his integrative approach, merging geometric constraints with randomness to establish new existence conditions in combinatorial structures. Scientific recognition: Ramon y Cajal Fellowship He secured competitive funding including a Ramon y Cajal Fellowship with additional grant and participation in the R&D project "Structure, Randomness and Computational Methods in Extremal Combinatorics". Lang also supervises predoctoral researchers, evidenced by his role in the Ministry of Spain Predoctoral Grant (2024) for Antonio Kaique Barroso Fernandes. Lang actively collaborates within the GAPCOMB group and internationally with researchers including Rue, Perarnau-Llobet, Serra, Hurley, and Joos, driving innovative combinatorial research at UPC.

• Combinatorics
• Extremal Combinatorics
• Geometric Combinatorics
• +۳ مورد دیگر

Julian Thoralf Pfeifle is a Professor in the Department of Mathematics at Universitat Politècnica de Catalunya (UPC), affiliated with the School of Industrial, Aerospace and Audiovisual Engineering of Terrassa (ESEIAAT). He leads the GAPCOMB research group focused on Geometric, Algebraic and Probabilistic Combinatorics, and maintains strong connections with the Faculty of Mathematics and Statistics (FME). Dr. Pfeifle's research spans combinatorial geometry, polytope theory, and discrete structures with emphasis on the interplay between geometric configurations and algebraic methods. His work explores fundamental questions about realizability of combinatorial structures, symmetry in polytopes, and connections between graph theory and geometric representations. He employs both theoretical approaches and computational techniques to investigate lattice points in polytopes, Ehrhart polynomials, and triangulations of point configurations. Analysis of his recent publications reveals a sustained focus on Plücker relations, non-realizability certificates, and symmetry properties in polytopes. His research demonstrates consistent theoretical depth while maintaining connections to computational applications. The interdisciplinary nature of his work bridges pure combinatorics with practical computational geometry problems. Dr. Pfeifle has received the Richard Rado Preis, a significant recognition in combinatorial mathematics. His research has been supported by multiple competitive grants including projects under Spain's Plan Estatal de Investigación Científica. As an academic advisor, Dr. Pfeifle has supervised doctoral students including Dall, A. (Matroids: h-vectors, zonotopes, and Lawrence polytopes) and Padrol, A. (Neighborly and almost neighborly configurations, and their duals). He has also been involved in educational innovation projects such as the development of interactive learning tools for mathematics education and served on conference committees including FPSAC 2010. Leading the GAPCOMB research group, Dr. Pfeifle coordinates a collaborative team investigating the intersections of geometric, algebraic, and probabilistic approaches to combinatorial structures. The group's work continues to advance understanding of discrete mathematical objects and their applications across multiple domains.

• Combinatorics
• Discrete Geometry
• Computational Geometry
• +۴ مورد دیگر

Ilario Bonacina is a Lecturer at the Department of Computer Science within the College of Computer Science of Barcelona (FIB) at the Polytechnic University of Catalonia . His research focuses on Proof Complexity , Computational Complexity , and Algorithmics , particularly in Polynomial Calculus and MaxSAT Optimization . Education: Laurea in Mathematics, Laurea Specialistica in Mathematics, and Doctorate from UPC. Research Interests include proof systems (Sherali-Adams, Nullstellensatz), algebraic methods, and theoretical computer science. Recent publications analyze complexity bounds and optimization algorithms. Scientific Awards include recognition for Best Italian PhD Theses in Theoretical Computer Science. He participates in competitive R+D+i projects like the State Plan for Scientific Research and Innovation.

• Proof Complexity
• Computational Complexity
• Algorithmics
• +۵ مورد دیگر

Juan José Rue Perna is an Associate Professor in the Department of Mathematics at Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Mathematics and Statistics (FME) and the Institute of Mathematics of UPC-BarcelonaTech. He also serves as Director of CFIS (Centre de Formació Interdisciplinària Superior) and maintains strong connections with the Centre de Recerca Matemàtica (CRM). His research focuses on combinatorial mathematics, particularly in the areas of random graphs, discrete mathematics, enumerative combinatorics, and additive combinatorics. Rue Perna has made significant contributions to the understanding of planar maps, extremal combinatorics, and probabilistic methods in discrete structures. His work often bridges theoretical mathematics with practical applications in computer science and network analysis. Rue Perna's recent publications demonstrate consistent research output across multiple high-impact journals in combinatorics and discrete mathematics. His work spans theoretical investigations of graph structures, enumeration problems, and applications to number theory. The research trends show a strong emphasis on probabilistic methods, asymptotic analysis, and connections between algebraic structures and combinatorial phenomena. Premi Albert Dou de la SCM Rue Perna has successfully advised multiple PhD students to completion, including Clément Requilé, Christoph Spiegel, Vasiliki Velona, and Maximilian Wötzel. His research has been supported by numerous competitive grants including projects from the Spanish Ministry of Science, European Research Council (ERC), and the Berlin Mathematical School. He has organized several significant academic events including EUROCOMB 2021 in Barcelona and various workshops on combinatorics and discrete mathematics. He is an active member of the GAPCOMB research group (Geometric, Algebraic and Probabilistic Combinatorics) at UPC, collaborating extensively with researchers across Europe. Rue Perna also contributes to the mathematical community through editorial work for journals including the Journal of Number Theory, European Journal of Combinatorics, and Integers: electronic journal of combinatorial number theory.

• Combinatorics
• Random Graphs
• Discrete Mathematics
• +۵ مورد دیگر