Sergio Bermudo Navarrete is a Professor at the Department of Economics, Quantitative Methods and Economic History, Universidad Pablo de Olavide. His research spans combinatorics, graph theory, and operator theory. Education: PhD in Mathematics (2003, University of Seville) with thesis on functional models of operators in Hilbert spaces. Research Interests: Focus on graph theory, domination problems, topological indices, and operator theory. Publication Trends: Recent work includes vertex-degree-based indices for oriented graphs, domination parameters in product graphs, and differential analysis of line graphs. Keywords span Computer Science , Mathematical Chemistry , and Operations Research . Collaborations: Frequent co-authors: José María Sigarreta Almira, José Manuel Rodríguez García, Juan Alberto Rodríguez-Velazquez. Contact: Email sbernav@upo.es .
Professor Jelena Grbic is a distinguished mathematician serving as Professor of Mathematics within the School of Mathematical Sciences at the University of Southampton since 2012. Her academic journey began with a B.Sc. in Mathematics from the University of Belgrade, Serbia in 1997, followed by a Ph.D. in Algebraic Topology from the University of Aberdeen in 2004. Prior to her current position, she held academic appointments at the University of Manchester (2007-2012) as Lecturer and Senior Lecturer, and at the University of Aberdeen (2004-2006) as Lecturer. Professor Grbic's research spans multiple interconnected domains of pure mathematics, with a primary focus on modern homotopy theory, particularly unstable homotopy theory, and its applications across topology, algebra, and geometry. Her work centers on decompositions and exponent problems in homotopy theory, homotopy aspects of Toric Topology, Hopf algebras, and geometric problems related to cobordisms and string topology. This research bridges abstract mathematical theory with potential applications in data science and computational topology. Analysis of her recent publications (2020-2025) reveals a consistent research trajectory in algebraic topology with increasing interdisciplinary connections. Her work demonstrates sophisticated mathematical techniques applied to complex topological structures, particularly moment-angle complexes and polyhedral products. Notably, her 2022 paper 'Aspects of topological approaches for data science' indicates growing interest in applying topological methods to contemporary data analysis problems, suggesting an expanding research horizon beyond pure mathematics. Professor Grbic actively supervises PhD students, including current student Salvatore Elia in Mathematical Sciences, and teaches modules covering algebraic topology and homotopy theory. She serves as a reviewer for prestigious journals including Homology, Homotopy and Application (2019), Transactions of the London Mathematical Society (2021), and The LMS Newsletter (2017), contributing to the scholarly community through peer review and academic service.
Aise Johan de Jong is a Professor in the Department of Mathematics at Columbia University, where he teaches courses including representations of finite groups and organizes the algebraic geometry seminar. He is a leading figure in algebraic geometry with a particular focus on stacks theory and arithmetic aspects of algebraic varieties. Institution: Columbia University, Department of Mathematics Research Focus: Algebraic stacks, arithmetic geometry, moduli spaces Major Project: The Stacks Project (open-source collaborative textbook) De Jong's research primarily centers on algebraic stacks, arithmetic geometry, and the foundations of algebraic geometry. His work bridges abstract theoretical frameworks with concrete computational aspects, particularly in positive characteristic. He has made significant contributions to understanding Brauer groups, period-index problems, and the geometry of moduli spaces. His research often connects number theory with geometric structures, exploring how arithmetic properties manifest in geometric settings. His publication record shows a consistent focus on fundamental structures in algebraic geometry, with particular emphasis on stacks theory (evident in The Stacks Project), Brauer groups, rational connectivity, and arithmetic properties of algebraic varieties. The trajectory of his work demonstrates increasing sophistication in handling complex geometric structures while maintaining connections to arithmetic questions. His most recent work continues to explore the interplay between algebraic geometry and number theory, particularly through the lens of stacks and moduli spaces. De Jong actively mentors graduate students, with numerous descendants listed in the Mathematics Genealogy Project. His academic lineage includes researchers working across various subfields of algebraic geometry. He has organized multiple conferences including "Moduli spaces and moduli stacks" (2012) and "Spaces of curves and their interaction with diophantine problems" (2009), demonstrating his leadership in the field. He leads The Stacks Project, a major collaborative open-source initiative that has become an essential reference for algebraic geometers worldwide. This project provides comprehensive foundations for algebraic stacks and related concepts, with regular updates and community contributions. De Jong also maintains the Stacks Project Blog where he discusses mathematical topics related to the project and shares updates.
Kimon Fountoulakis is an Associate Professor at the University of Waterloo. His research focuses on Machine Learning on Graphs and Numerical Optimization, with a strong emphasis on algorithmic methods for graph-structured data. He holds a Ph.D. from The University of Edinburgh (2015), an M.Sc. from The University of Edinburgh (2010), and a B.Sc. from Athens University of Economics and Business (2009). His work spans theoretical foundations and practical applications in graph algorithms, optimization, and machine learning. Research interests include graph neural networks, local graph clustering algorithms, and algorithmic reasoning. His contributions address challenges in graph representation learning, message-passing architectures, and scalable optimization methods. Notable themes in his publications include improving counting abilities of vision-language models, analyzing graph convolutions, and developing flow-based clustering techniques with statistical guarantees. His work often bridges theory and practice, with applications in network analysis, pandemic containment strategies, and high-performance computing. While no specific grants or awards are listed, his research demonstrates significant contributions to graph-based machine learning and optimization. He maintains a research group at the University of Waterloo, with a focus on developing open-source tools and frameworks for graph algorithms. His lab’s work emphasizes local graph clustering methods and their scalability in real-world networks.
Prof. Peter Scholze is a leading mathematician at the Max Planck Institute for Mathematics in Bonn, specializing in algebraic geometry and arithmetic geometry. He holds the academic rank of Professor and is part of the Arbeitsgruppe Algebraische Geometrie und Darstellungstheorie. His research focuses on foundational questions in algebraic geometry, number theory, and representation theory, particularly through the lens of the Langlands program, p-adic Hodge theory, and perfectoid spaces. Scholze has pioneered geometric approaches to the local Langlands correspondence and introduced revolutionary concepts like prismatic cohomology and condensed mathematics. He actively contributes to academia through advanced courses on topics such as geometrization of the Langlands program, étale cohomology, and condensed mathematics. His work bridges algebraic geometry with representation theory, addressing fundamental problems in arithmetic geometry and p-adic analysis. Scholze’s research outputs include seminal papers on perfectoid spaces, prismatic cohomology, and the geometrization of local Langlands correspondence. He collaborates extensively with leading mathematicians globally, contributing to collaborative research initiatives like the ARGOS seminar and the Habiro ring project. His teaching engagements include advanced lectures on algebraic geometry, representation theory, and p-adic geometry, reflecting his commitment to training the next generation of researchers. Despite no explicitly listed awards in the provided text, Scholze is widely recognized as a Fields Medalist (2018) and a leading figure in modern mathematics.
Jose Miguel Abito ("Mike") is an Associate Professor in the Department of Economics at The Ohio State University (OSU), serving as Director of Undergraduate Studies. He holds a PhD from Northwestern University, with prior roles including Assistant Professor at the Wharton School, University of Pennsylvania, where he won a teaching award. His research focuses on applied microeconomics, particularly industrial organization, regulation, and environmental economics. He examines topics such as regulatory incentives, consumer misinformation effects, and antitrust methodologies in sectors like electricity, extended warranties, and infant formula. Education: PhD in Economics from Northwestern University (Evanston, IL), graduate studies in Econometrics and Mathematical Economics at Toulouse, France, and undergraduate studies in Singapore. Research Interests: Mike explores how regulatory frameworks impact market efficiency, consumer welfare, and firm behavior. Recent work analyzes renewable energy market design, electricity procurement dynamics, and demand spillovers in welfare programs like WIC. His methodologies bridge theoretical models and empirical analysis to address complex policy questions. Professional Activities: Currently serves as a University Senator (2023-2026), member of the Salmon P. Chase Center Academic Advisory Committee, and faculty advisor for the Quantitative Finance Club at OSU. Previously involved in inclusive teaching initiatives at Wharton. Awards: Recognized with a teaching award during his tenure at Wharton School. Grants & Advising: Advises on projects related to infant formula markets, wage dynamics, and environmental policy. Engaged in collaborative research on green jobs, regulatory auditing frameworks, and productivity analysis.
Anna Gottard is an Associate Professor of Statistics at the University of Florence, where she leads the Department of Statistics, Computer Science, and Applications. She directs the Florence Center for Data Science (FDS) and participates in the Technical Scientific Committee of the Tuscan Center for Big Data, Data Science, and AI (CBDAI). Her research focuses on multivariate statistical models, particularly graphical models, and extends to statistical machine learning, fair models, and directional data analysis. She is an Associate Editor for the Journal of the Royal Statistical Society Series A (JRSSA) and Statistical Methods & Applications (SMA). Her recent work includes Bayesian approaches for mixed graphical models, uncertainty-aware classification trees, and methodological advancements in latent uncertainty models. Her contributions span theoretical developments and applied research in interdisciplinary areas like biostatistics and sustainability. Her research interests emphasize bridging statistical theory with practical applications, including fairness in machine learning, interpretable models, and tree-based methodologies. She has actively contributed to open-source software, notably the Mix3Trees R package for mixed-effect tree models. Her work addresses challenges in variable selection, graphical model inference, and ethical AI practices. Current projects explore Bayesian frameworks for complex data structures and methodological improvements in graphical model interpretability. Anna has advised on interdisciplinary collaborations, such as studies on GDPR compliance in biobanking and epidemiological modeling of the SARS-CoV-2 pandemic in Tuscany. She collaborates with institutions like the CBDAI to advance data science applications in regional policy and healthcare. Her research trajectory reflects a commitment to both foundational statistical theory and real-world problem-solving across diverse domains.
Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.
Andrew Spakowitz is a Professor of Chemical Engineering, Materials Science and Engineering, and by courtesy, Applied Physics and Chemistry at Stanford University. He currently serves as the Senior Associate Dean for Research and Faculty Affairs and holds the Tang Family Foundation Chair of the Department of Chemical Engineering. His academic career at Stanford spans from Assistant Professor (2006-2014) to Associate Professor (2014-2020) and now Professor since 2020. Dr. Spakowitz earned his PhD in 2004, MS in 2001 from the California Institute of Technology, and his BS in Chemical Engineering from the University of Wisconsin, Madison in 1999. He completed postdoctoral training in Molecular and Cell Biology and Biophysics at UC Berkeley from 2004-2006. His research focuses on theoretical and computational approaches to understanding biological processes and complex materials. The Spakowitz lab addresses fundamental chemical and physical phenomena through four main research themes: chromosomal organization and dynamics, protein self-assembly, polymer membranes, and charge transport in conducting polymers. His group employs diverse theoretical and computational methods including analytical theory of semiflexible polymers, polymer field theory, continuum elastic mechanics, Brownian dynamics simulation, equilibrium and dynamic Monte Carlo simulations, and reaction-diffusion modeling. Analysis of his recent publications reveals a strong emphasis on epigenetics and chromatin dynamics, with significant work on DNA methylation patterns, nucleosome clustering, and chromosome organization. His research also extends to polymer physics applications in biological systems, particularly in respiratory diseases, water purification membranes, and bacterial phage interactions with human mucus. Tang Family Foundation Chair of the Department of Chemical Engineering Professor Spakowitz mentors several graduate students and postdoctoral scholars in the Chemical Engineering and Materials Science departments. His lab members work on diverse projects spanning from chromatin dynamics to polymer membranes for water purification. He teaches multiple courses including CHEMENG 120B (Energy and Mass Transport), CHEMENG 340 (Molecular Thermodynamics), CHEMENG 466 (Polymer Physics), and CHEMENG 467 (Physics of Biomacromolecules). The Spakowitz lab operates from Clark S295 at Stanford University, conducting theoretical and computational research that bridges chemistry, physics, biology, and engineering disciplines to address complex problems across multiple length and time scales.
Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.
Anush Tserunyan is a Professor of Mathematics at McGill University, Canada, and a Visiting Professor at the Unit of Pure and Applied Mathematics (UMPA) at École normale supérieure de Lyon from December 1, 2024, to January 31, 2025. She holds a bachelor's and master's in computer science and applied mathematics from Yerevan State University (2005–2007) and a Ph.D. in Mathematics from UCLA (2013), focusing on finite generators for group actions, equivalence relations, and recursive program complexity. Research Interests: Anush Tserunyan specializes in Ergodic Theory , Combinatorics , and Group Actions , with notable contributions to graph theory, hypergraphs, and Ramsey theory. Her work bridges combinatorial structures with analytic methods, particularly in dynamical systems and descriptive set theory. Collaborations: During her visit to UMPA, she collaborates with teams in Geometry, Groups and Dynamics , and Number Theory , alongside researchers like Benjamin Schraen and Sophie Morel. Her stay includes seminars on GGD, Number Theory, and the 'Actions!' working group. Publications: Her research spans topics like ergodic theorems, disjoint matchings in graphs, and algebraic hypergraphs, reflecting a focus on foundational mathematical structures and their applications.
Marek Pycia serves as Professor of Organizational Economics at the University of Zurich and Co-Director of the Zurich Center for Market Design. His research has driven tangible policy impacts including the U.S. kidney-transplant voucher program and school system redesigns, with publications in premier journals like American Economic Review and Econometrica . His academic foundation includes a Ph.D. in Economics from the Massachusetts Institute of Technology (MIT), complemented by prior faculty roles at UCLA, Pennsylvania State University, and Leon Koźmiński Academy of Entrepreneurship and Management, plus a visiting fellowship at Princeton University. Professor Pycia specializes in Market Design and Mechanism Design , where he bridges theoretical microeconomics with real-world applications in healthcare allocation and educational systems. His work emphasizes strategyproofness , simplicity , and efficiency in matching markets, influencing both academic frameworks and practical policy implementations globally. Recent publications (2024-2025) reveal a concentrated focus on simplifying mechanism design for discrete environments, advancing double auction theory, and optimizing information structures in trade. These works consistently apply game-theoretic principles to solve complex allocation problems across healthcare, education, and financial markets. Key recognition includes: Research Fellow at the Centre for Economic Policy Research (CEPR) Editorial board membership at Theoretical Economics , Journal of Economic Theory , and Games and Economic Behavior While specific grant details remain unmentioned, his editorial leadership and center directorship indicate active research funding. He supervises graduate work through the University of Zurich’s economics programs, though no named students appear in the source text. The Zurich Center for Market Design, which he co-directs, functions as an interdisciplinary hub connecting theoretical research with practitioners in healthcare, education, and public policy to implement novel market mechanisms.
Christopher L. Tucci is a Professor of Digital Strategy & Innovation at Imperial College London's Business School and currently serves as Interim Vice Dean of Education. He is also the Founding Dean of NEOM's College of Business & Innovation in Saudi Arabia. Previously, he held the Chair in Corporate Strategy & Innovation at École Polytechnique Fédérale de Lausanne (EPFL), where he served as Dean of the College of Management from 2013 to 2018. His academic qualifications include a PhD in Management from MIT and multiple degrees from Stanford University: an AB in Music, BS in Mathematical Sciences, and MS in Computer Science and Computer Science. His research focuses on digital strategy, innovation management, open innovation, and business model innovation, with particular emphasis on how firms transition to new technologies and organizational forms. He has pioneered work on crowdsourcing, inter-networking, and AI-driven innovation. His award-winning article 'Crowdsourcing as a Solution to Distant Search' (co-authored with Allan Afuah) has received multiple accolades, including the AMR Decade Award in 2022. Professor Tucci teaches courses such as AI Ventures, Co-Creation in AI & Robotics, and Design Thinking. He actively contributes to academic leadership roles, including serving on the Academy of Management's Board of Governors and leading initiatives like Imperial's I-X (Artificial Intelligence and Digital Innovation hub). His work integrates technology, strategy, and organizational dynamics to address modern business challenges. Educations: PhD in Management, MIT (1992–1997) SM in Technology & Policy/EECS, MIT (1989–1991) BS in Mathematical Sciences, Stanford (1978–1982) AB in Music, Stanford (1979–1983) MS in Computer Science, Stanford (1982–1984) Labs/Teams: Co-Director of Imperial's I-X initiative, focusing on AI, data science, and digital innovation.
Mohsen Ghaffari is an Associate Professor at MIT's Department of Electrical Engineering and Computer Science (EECS), holding the Steven and Renee Finn Chair. His research focuses on theoretical computer science, particularly distributed and parallel algorithms, graph theory, and network optimization. Formerly, he was a tenured CS faculty member at ETH Zurich until 2022. PhD in Computer Science from MIT (2016) His research interests include distributed algorithms, parallel computing, graph decomposition, and network congestion management. His recent work addresses coreness decomposition, spanner construction, and Euclidean k-center optimization in massive parallel computation frameworks. Notable scientific awards include the ACM Doctoral Dissertation Award (Honorable Mention), ACM-EATCS Doctoral Dissertation Award, and multiple best paper awards at FOCS, PODC, and SODA. He has advised numerous PhD and Master's students, many of whom have transitioned to academic and industry roles. He has taught courses at MIT and ETH Zurich on distributed algorithms, advanced algorithms, and massively parallel computation. His professional activities include serving on program committees for SODA, FOCS, STOC, and organizing workshops like Highlights of Algorithms (HALG) and Workshop on Local Algorithms (WOLA).
Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.
