Find Academic Supervisors

Chaitanya SwamyView profile

Professor

• Theoretical Computer Science
• Combinatorial Optimization
• Approximation Algorithms
• +5 more

Chaitanya Swamy is a Professor at the Department of Combinatorics & Optimization , University of Waterloo , and holds the University Research Chair. He earned his PhD in Computer Science from Cornell University in 2004, with David Shmoys as his advisor, and completed postdoctoral work at Caltech . His research focuses on theoretical computer science , particularly combinatorial optimization , approximation algorithms , algorithmic game theory , and stochastic optimization . Education: B. Tech. in Computer Science, Indian Institute of Technology, Delhi PhD in Computer Science, Cornell University Swamy's research interests include algorithm design for optimization problems with uncertainty, network design, scheduling, and game-theoretic models. His recent work explores minimum-norm optimization , regret-bounded vehicle routing , and stochastic programming , with applications in logistics and mechanism design. His publications span top conferences like STOC, FOCS, SODA, ICALP, and IPCO, with a focus on approximation guarantees and algorithmic frameworks for complex optimization. Scientific Awards: University of Waterloo Alumni Gold Medal Outstanding Achievement for Graduate Studies (Ph.D) award, Faculty of Mathematics, Waterloo Best Student Paper Award at SODA 2004 Honorable Mention research paper citation Swamy has advised numerous PhD and Master’s students , including David Aleman Espinosa , Sharat Ibrahimpur , and Andre Linhares , many of whom hold prominent positions in academia and industry. He has served on program committees of leading conferences and as Associate Editor for SIAM Journal on Computing and Discrete Optimization .

Seth PettieView profile

Professor

• Algorithms
• Graph Theory
• Distributed Computing
• +3 more

Seth Pettie is a faculty member in the Department of Electrical Engineering and Computer Science (EECS) at the University of Michigan. His research focuses on algorithms, graph theory, distributed computing, and data structures, with significant contributions to problems like minimum spanning trees, Davenport-Schinzel sequences, and energy complexity in radio networks. Research Interests : Algorithms, graph theory, distributed systems, combinatorics, and computational complexity. Students : Mentored numerous PhD students and postdocs, including Dingyu Wang, Shang-En Huang, and Yi-Jun Chang, some of whom have won prestigious awards like the Principles of Distributed Computing Doctoral Dissertation Award. Scientific Contributions : Authored over 15 recent articles (2021–2025) on topics spanning connectivity labeling, fraud detection, extremal combinatorics, and energy-efficient distributed algorithms. His work often bridges theoretical insights with practical applications in databases and network optimization. Awards : Recipient of the Outstanding Dissertation Award (2004) and Best Student Paper Award at ICALP 2002. His students have also received recognition for their work. Professional Service : Organized workshops (e.g., Dagstuhl, Bertinoro) and served on steering/editorial/program committees for major conferences like SODA, STOC, and PODC.

• Algorithms
• Counting and Sampling
• Random Structures
• +7 more

Mary Cryan is a Senior Lecturer in the School of Informatics at the University of Edinburgh, where she has been a faculty member since July 2003. She is affiliated with the Laboratory for Foundations of Computer Science (LFCS) and conducts research in theoretical computer science, with a focus on algorithms, counting and sampling, random structures, learning theory, and pseudorandom generators. Her educational background includes a joint undergraduate degree in Computer Science and Mathematics from University College Dublin (1993), an MSc by research at UCD (1995), and a PhD from the University of Warwick (awarded 2000) under the supervision of Leslie Ann Goldberg. She held postdoctoral positions at BRICS, University of Aarhus (1999–2001), and the University of Leeds (2001–2003) working with Martin Dyer. PhD, University of Warwick (2000) MSc, University College Dublin (1995) BSc (Joint Hons), Computer Science and Mathematics, University College Dublin (1993) Her research interests lie in the design and analysis of algorithms, particularly randomized algorithms for counting and sampling combinatorial structures. She has made significant contributions to the understanding of Markov chains for sampling matchings, contingency tables, Euler tours, and phylogenetic trees. Her work often bridges theoretical computer science with probability and discrete mathematics. The trend in her publications shows a sustained focus on fundamental algorithmic problems involving random structures and probabilistic methods. Her work spans exact and approximate counting, mixing times of Markov chains, and learning models in phylogenetics. Recent work includes analyzing log-Sobolev inequalities for log-concave distributions and exact counting on bounded-treewidth graphs. She has supervised several PhD students, including Veselin Blagoev ("Counting and Sampling Acyclic Orientations", 2018), Páidí Creed ("Counting and Sampling problems on Eulerian graphs", 2010), and James Matthews (co-supervised, "Markov chains for sampling matchings", 2008). She has also been active in academic service, serving as Deputy Director of the Informatics Graduate School since August 2020. Her research has been published in top-tier venues such as FOCS, STOC, SIAM Journal on Computing, and Journal of the ACM. She regularly lectures courses such as "Informatics 2 - Introduction to Algorithms and Data Structures".

Quaid MorrisView profile

Assistant Professor

• Cancer Genomics
• Post-transcriptional Regulation
• RNA-binding proteins
• +5 more

Quaid Morris is an Assistant Professor at Weill Cornell Medicine's Graduate School of Medical Sciences, where he leads a research laboratory focused on applying computational approaches to biomedical problems. His lab is affiliated with the Physiology, Biophysics & Systems Biology program and has strong ties to the Sloan Kettering Institute. Dr. Morris's research spans multiple areas of computational biology with a particular emphasis on cancer genomics and post-transcriptional regulation. His work integrates machine learning with biological data to address fundamental questions in tumor evolution, RNA-binding protein specificity, and genotype-phenotype relationships. His laboratory develops innovative computational methods to reconstruct tumor evolutionary histories, predict RNA-binding protein targets, and integrate diverse biological data sources. Analysis of Dr. Morris's recent publications (2021-2023) reveals a strong focus on cancer genomics, particularly in tumor evolution and mutational signature analysis, alongside continued work on RNA-binding proteins and their regulatory roles. His research demonstrates a consistent pattern of developing computational tools (such as Pairtree and TrackSig) that address specific challenges in analyzing complex biological data, with applications spanning basic science to clinical translation. Dr. Morris has mentored numerous graduate students, postdoctoral fellows, and undergraduate researchers who contribute to his diverse research portfolio. His laboratory maintains active development of open-source software tools that have been widely adopted by the computational biology community. The Morris lab actively collaborates with experimental biologists to validate computational predictions and translate findings into biological insights. Current research directions include applying machine learning to electronic medical records for clinical prediction, developing methods for single-cell data analysis, and exploring the role of RNA-binding proteins in disease mechanisms.

• Software Engineering
• Formal Methods
• Verification and Validation
• +5 more

Professor Wolfgang Reif serves as Director of the Institute for Software & Systems Engineering at the University of Augsburg's Faculty of Applied Computer Science. His research spans multiple domains where formal methods meet practical engineering applications, particularly in software engineering, robotics, and self-organizing systems. Prof. Reif's research interests focus on applying formal verification techniques to complex systems engineering challenges. His work bridges theoretical computer science with practical applications in robotics, manufacturing, and autonomous systems. He has developed approaches for verification of concurrent systems, self-organizing production cells, and human-robot collaboration frameworks. His research demonstrates a consistent pattern of translating theoretical formal methods into practical engineering solutions for real-world problems. The recent publications reveal a strong trend toward integrating artificial intelligence with traditional engineering domains. His team has been particularly active in applying machine learning techniques to robotics, manufacturing processes, and verification problems. The publications show increasing focus on practical implementations of self-organizing systems, with applications in drone swarms, production automation, and composite material manufacturing. The work consistently demonstrates how formal verification can be applied to increasingly complex systems involving AI components. Prof. Reif leads a substantial research group with numerous PhD students and collaborators. His team operates within the Institute for Software & Systems Engineering, where they maintain active collaborations with both academic and industrial partners. The research environment supports work across multiple domains including formal verification, robotics, manufacturing systems, and AI applications. The team has developed several notable frameworks including PROTEASE for swarm robotics, SensorClouds for multi-modal sensor processing, and various verification tools built around the KIV system.

• Set Theory
• Boolean Algebras
• Ramsey Theory
• +5 more

PD Dr. Stefan Geschke is a researcher in the Department of Mathematics at the University of Hamburg, affiliated with the MIN-Faculty. His work spans set theory, Boolean algebras, Ramsey theory, convex geometry, and topological spaces. He has taught courses including Discrete Mathematics, Mathematical Logic, and Set Theory at the University of Hamburg and the University of Bonn. PhD in Mathematics (FU Berlin, 2000) Habilitation in Mathematics (FU Berlin, 2005) His research focuses on infinite combinatorics, topological dynamics, and the structure of Boolean algebras. Key contributions include studies on convexity numbers, Ramsey theorems, and minimal dynamical systems. His publications often involve collaborations with mathematicians like Menachem Kojman and Saharon Shelah. Recent articles address topics such as universal metric flows, self-dual matroids, and end degree conjectures in graph theory. His work frequently intersects with mathematical logic and discrete mathematics, emphasizing foundational and structural problems. Stefan Geschke's contact information includes the email stefan.geschke@uni-hamburg.de and office hours by appointment at Room 209, Bundesstraße 55, Hamburg.

Francesco CarrabsView profile

Professor

• Operations Research
• Combinatorial Optimization
• Graph Theory
• +5 more

Francesco Carrabs is a Full Professor of Operations Research in the Department of Mathematics at the University of Salerno, Italy, a position he has held since 2024. Previously, he served as Associate Professor (2020-2024) and Assistant Professor (2008-2020) at the same institution, demonstrating a steady progression through the academic ranks. Dr. Carrabs earned his PhD in Computer Science from the University of Salerno in 2006 and graduated cum laude in Computer Science from the same university in 2002. His international research experience includes a visiting scholar position at the Centre de recherche sur les transports (CRT) at the University of Montréal, Canada (2004-2006) under Professors Gilbert Laporte and Jean-François Cordeau, followed by a post-doctoral fellowship at HEC Montréal (October 2006-March 2007). His research focuses on theoretical study, development and implementation of exact and heuristic approaches for optimization problems on graphs. His primary research areas include Routing problems, Variants of Spanning Tree problems, Traveling Salesman Problems, Labeled Graph problems, and Wireless Sensor Networks problems. This program has resulted in approximately 50 publications across various formats. His recent publications reveal a strong emphasis on constrained graph problems, particularly those involving conflict constraints in spanning trees and set covering problems. His methodological contributions span exact approaches like branch-and-cut algorithms and heuristic methods including GRASP and genetic algorithms, often accompanied by publicly available datasets and source code. Dr. Carrabs has participated in numerous national and international research projects and has served on scientific committees for various conferences. His teaching activities at the University of Salerno focus on Operations Research and Optimization courses within the SSD MATH-06/A classification. With an h-index of 16 and over 800 citations (excluding approximately 13% self-citations), Dr. Carrabs has established himself as a respected researcher in combinatorial optimization and operations research.

Pallavi JainView profile

Assistant Professor

• Parameterized Complexity
• Kernelization
• Computational Social Choice Theory
• +7 more

Pallavi Jain is an Assistant Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Jodhpur, a position she has held since 2020. Previously, she was a Postdoctoral Fellow at Ben-Gurion University of the Negev, Israel (2019–2020) and the Institute of Mathematical Sciences, Chennai (2017–2019). Ph.D., Dayalbagh Educational Institute, Agra (2012–2017) Postdoctoral Fellow, Ben-Gurion University of the Negev, Israel (2019–2020) Postdoctoral Fellow, Institute of Mathematical Sciences, Chennai (2017–2019) Her research focuses on theoretical computer science, particularly in Parameterized Complexity , Kernelization , Computational Social Choice Theory , and Graph Algorithms . She explores algorithmic aspects of voting, fair division, and combinatorial optimization under structural and parameterized paradigms. Her work often bridges theoretical foundations with real-world applications in multiagent systems and participatory decision-making. Her recent publications span top-tier journals and conferences including Algorithmica , ACM Transactions on Computation Theory , AAAI , AAMAS , ICALP , and IJCAI . The publications reflect a strong trend in parameterized algorithms, fairness in allocation, committee selection, and voting under complex constraints. She has also contributed to heuristic methods in graph optimization problems. Best Paper Runner-Up Award at EUMAS 2022 SERB National Postdoctoral Fellowship (2017–2019) Maulana Azad National Fellowship (2014–2016) Institute Seed Grant (2022–2025) Indo-German Project Grant (2023–2025) Pallavi Jain actively advises BTech and MTech students and has mentored numerous interns from institutions like CMI, University of Calcutta, and Aligarh Muslim University. She has secured research funding from SERB and other national and international bodies. She serves on the program committees of major conferences including IJCAI, AAAI, AAMAS, and ECAI, and has co-organized workshops such as the Winter School on Algorithms for Graphs and Games and COSCOE 2023. She teaches courses such as Advanced Data Structures and Algorithms , Graph Theoretic Algorithms , and Computational Microeconomics . She leads a vibrant research group focused on algorithms and computational social choice, collaborating with leading researchers like Saket Saurabh, Nimrod Talmon, and Sushmita Gupta. Her lab emphasizes theoretical rigor and practical relevance in solving complex computational problems in social systems.

Yossi AzarView profile

Professor

• ON-LINE ALGORITHMS
• APPROXIMATION METHODS
• LOAD BALANCING
• +3 more

Prof. Yossi Azar is a faculty member at the Blavatnik School of Computer Science, Tel-Aviv University, where he holds the academic rank of Professor. He is actively involved in research and teaching in theoretical computer science, particularly in online algorithms, approximation methods, and algorithmic game theory. University: Tel-Aviv University School: Blavatnik School of Computer Science Academic Rank: Professor Email: azar@tau.ac.il His research focuses on ON-LINE ALGORITHMS, APPROXIMATION METHODS, LOAD BALANCING, ROUTING SCHEMES, PROBABILISTIC METHODS, and ALGORITHMIC GAME THEORY . He has made significant contributions to the design and analysis of algorithms for scheduling, routing, and resource allocation under uncertainty and competitive settings. The recent articles reflect a strong trend in theoretical computer science, particularly in online and approximation algorithms, algorithmic game theory, and network optimization. His work often involves competitive analysis, mechanism design, and performance guarantees in scheduling and routing problems. The research spans subfields such as load balancing, unsplittable flow, truthful mechanisms, and network design, with applications in distributed systems and communication networks. Prof. Azar has supervised numerous PhD and MSc students, including prominent researchers such as Leah Epstein and Oded Regev. He teaches advanced courses like Online and Approximation Algorithms and Algorithmic Methods , and has served on program committees of top conferences including SODA, STOC, FOCS, and ESA, often as chair. PhD Students: Leah Epstein, Oded Regev, Yossi Richter, Amir Epstein, Shai Gutner, Iftah Gamzu, Ilan Cohen, Adi Vardi, Danny Vainstein, Noam Touitou, Shahar Lewkowicz, Or Vardi MSc Students: Includes many of his PhD advisees and additional names such as Amitai Armon, Nir Avrahami, Arik Litichevskey, and others. He is an active participant in the academic community, serving as a journal editor for Algorithmica and organizing the Advanced Algorithms Seminar at Tel-Aviv University, which fosters collaboration and dissemination of cutting-edge research in algorithms.

Heng GuoView profile

Associate Professor

• Algorithms
• Computational Complexity
• Approximate Counting
• +5 more

Heng Guo is an Associate Professor in Algorithms and Complexity at the School of Informatics, University of Edinburgh. He leads the ERC starting grant project New Approaches to Counting and Sampling (NACS), which runs from 2021 to 2026. Previously, he has worked and studied at Berkeley, London, Madison, and Beijing. His research lies at the intersection of theoretical computer science, combinatorics, and statistical physics. Guo's research focuses on algorithms from a complexity perspective, particularly computational counting and sampling. He is renowned for his work on the Lovász local lemma, Markov chain Monte Carlo methods, phase transitions in computational complexity, and complexity classifications. His approach often involves discovering unseen links between different areas of theoretical computer science. Key contributions include confirming a conjecture of Gorodezky and Pak through partial rejection sampling, establishing rapid mixing for Swendsen-Wang dynamics, and developing a polynomial-time approximation algorithm for all-terminal network reliability. His publication record shows a strong trajectory of impactful research in top venues including FOCS, STOC, SODA, J. ACM, and SIAM Journal on Computing. His work on the all-terminal network reliability problem won the Best Paper Award at ICALP 2018. Guo has organized several significant workshops including JerrumFest 2025, MCMC 2.0 (Shonan seminar), and a STOC 2020 workshop on new frontiers of approximate counting. These events highlight his leadership role in the theoretical computer science community. Best Paper Award at ICALP 2018 EATCS Distinguished Dissertation Award 2016 Guo has advised several PhD students including Giorgos Mousa, Jiaheng Wang, and Graham Freifeld, and mentored postdocs such as Weiming Feng, Vishvajeet Nagargoje, and Konrad Anand. His ERC grant supports multiple research associates working on counting and sampling problems. He has taught courses including Computational Complexity, Randomness and Computation, and Algorithmic Game Theory at the University of Edinburgh.

Sami DaviesView profile

Researcher

• Theoretical Computer Science
• Combinatorial Optimization
• Algorithm Design
• +5 more

Sami Davies is a Research Scientist in Theoretical Computer Science at the Simons Institute and the Department of Electrical Engineering and Computer Sciences (EECS) at the University of California, Berkeley. He earned his PhD in Mathematics from the University of Washington in 2021 under the supervision of Thomas Rothvoss, with work spanning the Department of Mathematics and the Allen School theory group. Prior to Berkeley, he was a postdoctoral researcher in the theory group at Northwestern University. His research lies at the intersection of theoretical computer science and combinatorial optimization. Key interests include scheduling algorithms, clustering, hypergraph matchings, approximation algorithms, and algorithmic applications in machine learning. His work often addresses fundamental problems in algorithm design with practical implications in resource allocation, data analysis, and network optimization. The most recent publications reflect a strong trend in developing efficient combinatorial algorithms for clustering and scheduling problems, particularly under complex constraints such as communication delays or fairness objectives. There is a growing integration of machine learning concepts into traditional algorithmic frameworks, as seen in works on predictive flows and trace reconstruction. His research is consistently published in top-tier venues including NeurIPS, ICML, SODA, FOCS, and COLT, indicating high impact and recognition within the theoretical CS community. Sami is actively engaged in academic service and outreach. He has served as a mentor in the Washington Directed Reading Program and co-taught the 'Math in Society' course through FEPPS, which provides education to incarcerated individuals. He has also taught yoga at the University of Washington. He enjoys bouldering, running with his dog, vegan cooking and baking, and practicing yoga. He completed a 200-hour yoga teacher training in 2019. Contact: Email: samidavies@berkeley.edu , davies@berkeley.edu

• Logic
• Well Quasi-Orders
• Verification
• +7 more

Sylvain Schmitz is a Professor of Computer Science at Université Paris Cité, affiliated with the Institut de Recherche en Informatique Fondamentale (IRIF). He leads the automata and applications team and is a member of the modelling and verification team. His research focuses on logic, well quasi-orders, verification, formal languages, and database theory. He is actively involved in the academic community, serving on steering and program committees for major conferences such as STACS, LICS, and CSL. PhD in Computer Science, defended on September 24, 2007, at I3S Laboratory, Sophia Antipolis. Habilitation titled Algorithmic Complexity of Well-Quasi-Orders , defended on November 27, 2017, at ENS Paris-Saclay. His research interests span logic, well quasi-orders, verification, formal languages, database theory, theoretical computer science, complexity theory, program verification, automata theory, and model checking. His recent work explores complexity bounds in vector addition systems, reachability problems, and logical foundations of verification. His publications exhibit a strong focus on theoretical foundations of computation, particularly in the analysis of infinite-state systems, complexity hierarchies beyond elementary, and logical characterizations of computational problems. Key themes include well-structured transition systems, non-elementary complexity, and applications of ordinal analysis to verification. IUF junior (2018–2023) Sylvain Schmitz has supervised several PhD students, including Hector Buffière, Aliaume Lopez, Anthony Lick, and Simon Halfon, often in joint supervision with researchers such as Jean Goubault-Larrecq, David Baelde, and Philippe Schnoebelen. His research has been funded by multiple ANR projects including BraVAS, PRODAQ, ReacHard, and AVeriSS. He is a key member of the IRIF laboratory, contributing to research in automata, verification, and logic. He has organized major events such as ICALP 2022 and RP 2020, and is deeply involved in the European theoretical computer science community through committee memberships and conference organization.

• Commutative Algebra
• Graph Theory
• Combinatorics
• +4 more

Katharine Shultis serves as an Associate Professor of Mathematics at Gonzaga University, holding a Ph.D. from the University of Nebraska-Lincoln and demonstrating interdisciplinary expertise through her dual background in mathematics and chemistry. Her extensive teaching portfolio spans foundational courses like Introductory Statistics and Calculus through advanced offerings including Abstract Algebra and Comprehensive Mathematics. Her academic credentials include: Ph.D. in Mathematics, University of Nebraska-Lincoln M.A. in Mathematics, University of California, San Diego B.A. in Mathematics and Chemistry, Scripps College Dr. Shultis maintains exceptionally broad research interests that bridge pure and applied mathematics. While her doctoral work established her in commutative algebra, she actively pursues graph theory, combinatorics, mathematical games, topology, and voting theory. Her signature approach involves collaborative student research, with explicit interest in future chemistry-mathematics interdisciplinary projects. She champions inquiry-based learning where students actively engage in mathematical discovery rather than passive observation. Her publication trajectory reveals distinctive dual threads: rigorous theoretical work in commutative algebra alongside innovative applications in graph theory and recreational mathematics. Recent collaborations with students dominate her output, particularly in power domination and geometric dissections. Simultaneously, she contributes significantly to mathematics education discourse through publications on undergraduate research practices and pedagogical techniques. No scientific awards or fellowships are documented in the available materials. Dr. Shultis demonstrates exceptional commitment to undergraduate mentorship, evidenced by numerous student co-authorships across diverse projects. Her publication 'What Counts as Math Research?' specifically addresses frameworks for meaningful student research experiences. While grant details remain unspecified, her pedagogical philosophy emphasizes active student participation through inquiry-based learning strategies developed for courses ranging from Calculus to Abstract Algebra. Though no formal laboratory infrastructure is described, her collaborative model involves small student teams working on targeted projects in graph theory, combinatorics, and mathematical games, often extending classroom concepts into original research contexts.

• Data Science
• Statistics
• Machine Learning
• +3 more

William S. Cleveland serves as the Shanti S. Gupta Distinguished Professor of Statistics and Courtesy Professor of Computer Science at Purdue University, a position held since 2014 following 12 years as Department Head and Distinguished Member of Technical Staff at Bell Labs. His academic foundation includes an A.B. in Mathematics from Princeton University (advised by William Feller) and a Ph.D. in Statistics from Yale University (advised by Leonard Jimmie Savage). Cleveland pioneered the modern definition of data science in 2001, establishing its six technical areas spanning statistical theory to live data analysis systems. His research bridges statistics , machine learning , data visualization , and high-performance computing for deep data analysis , with seminal contributions including trellis display frameworks and Divide and Recombine (D&R) methodology. Current work focuses on DeltaRho software implementation for distributed computing challenges. Recent publications reveal a strong emphasis on climate science applications, particularly Arctic atmospheric river dynamics and high-resolution precipitation modeling, while maintaining core contributions to distributed statistical computing. This reflects his career-long approach of applying advanced data analysis to multidisciplinary problems across telecommunications, cybersecurity, and environmental systems. His distinguished honors include: Lifetime Achievement Award for Graphics and Computing (ASA, 2016) Parzen Prize (Texas A&M, 2016) Statistician of the Year (Chicago ASA, 1996) Highly Cited Researcher designation (2002) Multiple journal prizes including two Wilcoxon and one Youden awards Fellowships in ASA, IMS, and AAAS plus ISI Elected Membership Mentoring 18 Purdue doctoral students since 2004 (6 currently active), Cleveland's research has been sustained through major grants supporting the MODSQUAD team and DeltaRho development. His leadership extends to founding the ASA Graphics Section and authoring influential texts like The Elements of Graphing Data , which remains foundational in visualization practice. He directs the DeltaRho project within Purdue's data science ecosystem, collaborating with the MODSQUAD (Data-Driven Discovery of Models) team on applications spanning climate modeling, cybersecurity analytics, and healthcare systems through integrated high-performance computing frameworks.

• Environmental Geochemistry
• Atmospheric Aerosols
• Trace Element Analysis
• +3 more

Daniela Varrica serves as an Associate Professor in the Department of Earth and Marine Sciences at the University of Palermo, specializing in environmental geochemistry and atmospheric pollution studies. Her research focuses on trace element analysis across multiple environmental matrices including soils, aerosols, biological tissues, and water systems. Her primary research interests encompass Environmental Geochemistry , Atmospheric Aerosols , Trace Element Analysis , Soil Pollution , and Biogeochemical Cycles . Her work frequently examines the spatial distribution of contaminants, anthropogenic versus natural sources of pollution, and human exposure pathways through biomonitoring approaches. Recent publications demonstrate consistent focus on Sicilian environmental systems with particular attention to Palermo urban areas and industrial zones. Analysis of her 15 most recent publications reveals strong emphasis on trace element characterization in diverse environmental compartments. Her research spans from baseline geochemical studies of Sicilian soils to sophisticated analyses of atmospheric particulate matter, with recurring themes of source apportionment, health risk assessment, and biomonitoring using human hair, lichens, and edible mushrooms. The temporal pattern shows increasing sophistication in modeling approaches while maintaining field-based empirical validation. Her scientific contributions include methodological advancements in environmental monitoring and significant documentation of pollution patterns in Mediterranean environments, particularly regarding platinum group elements from vehicular emissions, Saharan dust influences on urban air quality, and industrial impacts on local ecosystems.