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

Srinivas Peetaمشاهده پروفایل

استاد

• Transportation Systems Engineering
• Dynamic Traffic Networks
• Connected and Automated Vehicles (CAV)
• +۶ مورد دیگر

Dr. Srinivas Peeta is the Frederick R. Dickerson Chair and Professor in Transportation Systems Engineering at the Georgia Institute of Technology’s School of Civil and Environmental Engineering. He previously held the Jack and Kay Hockema Professorship at Purdue University, where he served for 24 years. He is also the Associate Director of the USDOT Center for Connected and Automated Transportation. Education: B. Tech. from IIT Madras, M.S. from Caltech, and Ph.D. from UT Austin, all in Civil Engineering. His research focuses on large-scale transportation systems, infrastructure interdependencies, and connected/automated vehicles. He has authored over 345 publications and secured over $48M in research funding. Research Interests: Dynamic traffic networks and driver behavior modeling Information-based navigation in vehicular systems Systems perspectives for complex adaptive infrastructure Autonomous vehicle integration and human-vehicle interactions Key Achievements: Developed DYNASMART software for traffic operations Recipient of NSF CAREER Award (1997) and ASCE Walter Huber Prize (2009) Directed NEXTRANS UTC and pioneered USDOT’s real-time route guidance systems Grants & Outreach: Secured funding from USDOT, NSF, FHWA, and international agencies Initiated NEXTRANS internship programs and K-12 outreach Labs/Teams: Active in Georgia Tech’s ACT Lab, focusing on autonomous transportation systems and human-vehicle-environment interactions.

Massimo Fornasierمشاهده پروفایل

استاد

• Mathematical Modeling
• Data Analysis
• Image/Signal Processing
• +۵ مورد دیگر

Prof. Massimo Fornasier holds the Chair of Applied Numerical Analysis at the Technical University of Munich (TUM), within the School of Computation, Information and Technology and the Department of Mathematics. His research focuses on mathematical modeling, numerical analysis, and data-driven methods, particularly in areas like compression, sparse recovery, and optimization. He has made significant contributions to consensus-based optimization, control of multiagent systems, and applications in image/signal processing. Education: PhD in Computational Mathematics, University of Padua (2003) Postdoctoral fellowships at University of Vienna, Sapienza University of Rome, and Princeton University Awards: ERC Starting Grant (2012) START Prize (2011) Prix de Boelpaepe (2009) His work bridges theoretical analysis and computational methods, with applications ranging from compressive sensing to machine learning. Recent research emphasizes consensus-based optimization frameworks and their global convergence properties. Editorial roles include journals like Networks and Heterogeneous Media and Calcolo . He leads research groups in areas such as Data Science and Numerical Analysis at TUM.

Stephen Robert Hannekeمشاهده پروفایل

استادیار

• Machine Learning
• Artificial Intelligence
• Statistical Learning Theory
• +۳ مورد دیگر

Stephen Robert Hanneke is an Assistant Professor in the Department of Computer Science at Purdue University, specializing in theoretical machine learning and statistical learning theory. His work focuses on reducing the number of training examples required for learning, with contributions to supervised, semi-supervised, active, and transfer learning. He joined Purdue in Fall 2021 after roles including Research Assistant Professor at the Toyota Technological Institute at Chicago (2018–2021), Visiting Lecturer at Princeton University (2018), and Visiting Assistant Professor at Carnegie Mellon University (2009–2012). Education: B.S. in Computer Science from the University of Illinois at Urbana-Champaign (2005), Ph.D. in Machine Learning from Carnegie Mellon University (2009). Research interests include statistical learning theory, machine learning foundations, algorithms, and quantum computing. Notable contributions explore the theoretical underpinnings of active learning, adversarial robustness, and universal learning frameworks. His research bridges disciplines like probability theory, philosophy of science, and algorithmic information theory. Key awards include the Best Paper Award at ALT 2021 for 'Stable Sample Compression Schemes' and runner-up for COLT 2021. He has also received the COLT 2020 Best Paper Award and an Honorable Mention for the ICML 2017 Test of Time Award. His work on 'A Bound on the Label Complexity of Agnostic Active Learning' (ICML 2007) received further recognition in 2017. Teaching includes courses on machine learning theory and data mining at Purdue, Princeton, and Carnegie Mellon. He has organized workshops like the ALT 2019 'When Smaller Sample Sizes Suffice for Learning' and chaired the program committee for ALT 2017. His research outputs span over 100 publications in top venues like COLT, NeurIPS, and JMLR, focusing on foundational questions in learning theory and algorithmic efficiency.

• Artificial Intelligence
• Human-Computer Interaction
• Health Informatics
• +۵ مورد دیگر

Krzysztof Z Gajos is a Gordon McKay Professor of Computer Science at Harvard University’s Paulson School of Engineering and Applied Sciences. He leads the Intelligent Interactive Systems Group, focusing on human-AI interaction, accessible computing, and behavioral research at scale. His work integrates technical innovation with ethical and societal considerations, emphasizing equity-centered design. Education: Ph.D., University of Washington M.Eng. and B.Sc., Massachusetts Institute of Technology (MIT) Research Interests: His research spans AI for public services , health informatics , design for equity , and behavioral research platforms like LabintheWild.org. He investigates how AI can augment human decision-making while addressing biases and ethical challenges. Recent Trends in Articles: Recent work emphasizes human-AI collaboration in healthcare , explainable AI , and equity-centered design . Key themes include reducing overreliance on AI, improving transparency in algorithmic decisions, and centering marginalized communities in technology development. Scientific Awards: Sloan Fellowship Best Paper Awards at ACM CHI, COMPASS, and IUI Advising & Grants: His federal grants support AI ethics and healthcare projects, though recent terminations have prompted efforts to secure alternative funding. He advises students on projects like AI for humanitarian negotiations and digital phenotyping. Labs & Teams: Leads the Intelligent Interactive Systems Group , collaborating with organizations on AI for social good and accessible technology.

Yuguo Chenمشاهده پروفایل

استاد

• Network Analysis
• Monte Carlo Methods
• Statistical Inference
• +۷ مورد دیگر

Yuguo Chen is a Professor in the Department of Statistics at the University of Illinois at Urbana-Champaign (UIUC), serving as Interim Department Chair and Director of the Illinois Statistics Office. He holds affiliations with the Department of Computer Science, Information Trust Institute, Coordinated Science Lab, and Illinois Informatics Institute. Chen earned his PhD in Statistics from Stanford University (2001) and a B.S. in Mathematics from the University of Science and Technology of China (1997). His research focuses on Monte Carlo methods, network data analysis, state space models, bioinformatics, and Bayesian inference. Key interests include scalable network estimation, community detection, and applications in public health, education, and computational biology. Recent work highlights include advancements in dynamic network modeling, Bayesian latent class models for cognitive diagnosis, and statistical methods for analyzing multi-layer networks. His contributions have been recognized through awards such as the American Statistical Association Fellowship (2018) and the Charles Edison Lectureship (2018). Editorial Roles: Associate Editor of Journal of the American Statistical Association , Journal of Computational and Graphical Statistics , and Journal of Algebraic Statistics . Grants & Consulting: Directs the Illinois Statistics Office, providing interdisciplinary research support. Active in collaborative projects involving healthcare, education, and computational infrastructure. Labs & Teams: Leads initiatives at the Coordinated Science Lab and Information Trust Institute, integrating statistical methods with cybersecurity and data-driven decision-making.

David Mimnoمشاهده پروفایل

دانشیار

• Natural Language Processing
• Machine Learning
• Computational Social Science
• +۴ مورد دیگر

David Mimno is an Associate Professor and Chair of the Department of Information Science at Cornell University. He holds a PhD from the University of Massachusetts Amherst and previously worked at the Perseus Project and Princeton University. His research focuses on computational social science, natural language processing, and historical text analysis. Mimno is known for developing the MALLET toolkit, a widely used Java-based platform for machine learning in text processing. He teaches courses such as INFO 4940: How LLMs Work and INFO 6150/CS 6788: Advanced Topic Modeling. His work has been supported by the Sloan Foundation, NEH, and NSF. Mimno advises PhD students in Information Science and Computer Science, emphasizing interdisciplinary research at the intersection of computing and humanities/social sciences. He also contributes to initiatives like AI for Humanists, making large language models accessible for text-as-data research. Bachelor’s degree: Not explicitly stated in text PhD: University of Massachusetts Amherst Research Interests: Mimno explores large language models, topic modeling, cross-lingual semantics, and ethical AI applications in humanities and legal domains. His recent work addresses data curation practices for language models, LLM memorization of poetry, and generative AI’s societal impacts. He co-authored reports on generative AI in academic research and education. Grants & Collaborations: His projects include the Text as Data (TADA) conference and collaborations on generative AI law workshops. Mimno’s MALLET toolkit supports document classification, clustering, and topic modeling, with applications in cultural analytics and computational historiography.

Yuri Bazilevsمشاهده پروفایل

استاد

• Computational Mechanics
• Isogeometric Analysis
• Fluid-Structure Interaction
• +۵ مورد دیگر

Yuri Bazilevs is the E. Paul Sorensen Professor of Engineering at Brown University's School of Engineering and Co-Director of the Mechanics of Undersea Science and Engineering Center. His research focuses on computational mechanics, isogeometric analysis, fluid-structure interaction, and high-performance computing. Prior to Brown, he held positions at UC San Diego, where he advanced to Full Professor in 2014 after a rapid tenure. He earned his PhD in 2006 and postdoc training in computational engineering at UT Austin's ICES. Research interests span computational fluid dynamics, solid mechanics, and advanced discretization methods like isogeometric analysis (IGA) and meshfree approaches. He has developed novel formulations for complex phenomena such as underwater explosions, composite material failure, and hypersonic flow dynamics. His work integrates cutting-edge numerical methods with practical engineering applications in aerospace, energy, and biomedical systems. Recent publications highlight advancements in IGA for architected materials, RKPM-based crack modeling, and stabilized formulations for compressible flows. His contributions bridge theoretical mechanics with computational innovation, addressing challenges in multiphysics coupling and large-scale simulations. Collaborations span academia and industry, emphasizing practical validation and real-world impact. Bazilevs' expertise includes variational multiscale methods, peridynamics for fracture mechanics, and immersive particle methods for fluid-structure interaction. His work has been applied to wind turbine aerodynamics, gas turbine optimization, and cardiovascular flow analysis. He actively contributes to computational infrastructure development, such as the tIGAr software framework for IGA automation.

Mohammad Mohammadi Amiriمشاهده پروفایل

استادیار

• Large Language Models
• Data Valuation
• Federated Learning
• +۵ مورد دیگر

Mohammad Mohammadi Amiri serves as an Assistant Professor in the Department of Computer Science at Rensselaer Polytechnic Institute (RPI), appointed in Fall 2023. His research focuses on advancing artificial intelligence through strategic data utilization, with emphasis on large language models, data valuation, federated learning, and deep learning. Previously, he held postdoctoral appointments at Princeton University and MIT Media Lab, building on his strong educational foundation from Imperial College London, University of Tehran, and Iran University of Science and Technology. Education: Ph.D. in Electrical and Electronic Engineering, Imperial College London (2019) - Best Ph.D. Thesis Award recipient M.Sc. in Electrical and Computer Engineering, University of Tehran (2014) - Ranked 1st among all M.Sc. students B.Sc. in Electrical Engineering, Iran University of Science and Technology (2011) - Ranked 1st among all B.Sc. students Dr. Amiri's research centers on optimizing artificial intelligence systems through innovative data strategies. His work addresses critical challenges in large language models including efficiency, memory usage, alignment, and reasoning capabilities. In data valuation, he develops principled methods to quantify data worth for fair trading platforms. His federated learning research tackles privacy concerns, heterogeneous data distribution, and communication overhead in decentralized environments. The deep learning component explores theoretical foundations to improve model interpretability and robustness. Analysis of his recent publications reveals a strong focus on making AI systems more efficient and accessible, with particular emphasis on large language model optimization, federated learning advancements, and data valuation frameworks. His work bridges theoretical foundations with practical applications in wireless communications and distributed computing environments. Scientific Awards: IEEE Communications Society Young Author Best Paper Award (2022) Best PhD Thesis Award from IEEE Information Theory Chapter of UK and Ireland (2019) Eryl Cadwallader Davies Prize for Outstanding PhD Thesis (2019) EEE Departmental Scholarship at Imperial College London (2015-2019) Ranked 1st among M.Sc. students at University of Tehran (2014) Ranked 1st among B.Sc. students at Iran University of Science and Technology (2011) Dr. Amiri actively mentors graduate students, currently supervising five Ph.D. candidates and one M.Sc. student working on efficient LLM fine-tuning, inference, and storage. His research has attracted significant attention, evidenced by numerous keynote invitations at prestigious institutions including Bell Labs, MIT, King's College London, and various IEEE conferences. He serves on program committees for major conferences including IEEE Globecom and ICC, demonstrating his growing influence in the academic community. His research group operates at the intersection of machine learning and wireless communications, developing innovative solutions for resource-constrained environments while addressing fundamental theoretical challenges in AI systems. Current projects focus on making advanced AI more scalable and accessible through efficiency improvements in model training and inference.

Andreas Gulyasمشاهده پروفایل

استادیار

• Macroeconomics
• Labor Economics
• Search Theory
• +۱ مورد دیگر

Prof. Andreas Gulyas is an Assistant Professor of Macroeconomics at the Department of Economics, University of Mannheim, and a research affiliate at IZA. He holds a Ph.D. from UCLA and a M.Sc. from the University of Vienna. His research focuses on Macroeconomics, Labor Economics, Search Theory, and Machine Learning applications in economics. Education: Ph.D. in Economics, UCLA, Los Angeles, USA M.Sc. in Economics, University of Vienna, Austria Research Interests: Gulyas examines labor market dynamics, monetary policy impacts, wage transparency, and the consequences of job displacement. His work combines theoretical models with empirical analysis, often employing field experiments and machine learning techniques to explore labor market inefficiencies and policy implications. Notable areas include cross-country comparisons of economic inequality and pandemic-induced unemployment effects. Articles Trends: His recent work emphasizes labor market policies, wage structures, and macroeconomic shocks. Key themes include the role of fringe benefits in job search behavior, monetary policy's heterogeneous effects, and pandemic-related unemployment disparities. Machine learning is increasingly used to analyze heterogeneous outcomes in displacement scenarios. Awards: No scientific awards listed. Advising/Grants: No advising records or grant information provided in available texts. His current research is likely supported through institutional funding and affiliations like IZA. Labs/Teams: Affiliated with the AEE Seminar at Mannheim, contributing to collaborative economics research initiatives.

Mehmet Esat Belviranliمشاهده پروفایل

استادیار

• Heterogeneous Architectures
• Runtime Systems
• Performance Modeling
• +۵ مورد دیگر

Mehmet Esat Belviranli is an Assistant Professor in the Computer Science Department at the Colorado School of Mines, where he directs the High Performance Systems and Software Lab (HyperSys). His research focuses on increasing resource utilization in heterogeneous architectures through runtime systems, scheduling algorithms, and performance modeling, with publications in top venues including MICRO, PPoPP, and SC. Education: Ph.D. in Computer Science, University of California, Riverside (2016) M.S. in Computer Science, Bilkent University (2009) B.S. in Computer Science, Bilkent University (2006) Belviranli's research spans heterogeneous architectures, runtime systems, performance modeling, parallel programming, autonomous computing, deep learning acceleration, cyber-physical systems, and edge-cloud platforms. His work develops analytical models and programming abstractions to address resource management, scheduling, and security challenges in diversely heterogeneous systems, with applications in edge computing, autonomous systems, and machine learning acceleration. Recent projects emphasize real-world constraints and security implications. His publication trends reveal increasing focus on edge-cloud resource management (e.g., HARNESS), security vulnerabilities in heterogeneous systems (e.g., MC3), and deep learning acceleration under resource constraints. Key themes include memory contention modeling, scheduling for cyber-physical systems, and concurrent DNN execution, reflecting a shift toward practical deployment in security-sensitive edge environments. Scientific Awards: U.S. Air Force Research Lab Summer Faculty Fellowship Award (2022) U.S. Air Force Research Lab Summer Faculty Fellowship Award (2021) Oak Ridge National Laboratory Significant Event Award (2019) Best Paper Finalist, IEEE HPEC 2018 Outstanding Paper Award, DATE 2024 Belviranli mentors Ph.D. students Ismet Dagli (MLCommons Rising Star 2024, CGO'24 SRC finalist) and Justin Davis (DATE'24 Outstanding Paper Award winner). He has secured $2M+ in funding from NSF, DoE, and SRC, including an NSF-SaTC grant on mobile security (2024), a DoE grant on superconductive systems (2023), and an NSF FuSe grant on graphene nanoribbons (2023), often leading multi-institutional teams from Rochester, Virginia, Arizona, and Minnesota. The HyperSys Lab develops ecosystems for high-performance heterogeneous systems, with recent projects including HARNESS for edge-cloud resource management and MC3 for mobile SoC security. The lab has received equipment donations from Google Coral.ai and Xilinx, and collaborates with national labs on security challenges and next-generation semiconductor technologies.

Konstantin Baumanمشاهده پروفایل

دانشیار

• Data Science
• Machine Learning
• Recommender Systems
• +۳ مورد دیگر

Dr. Konstantin Bauman is an Associate Professor in the Department of Management Information Systems at Temple University's Fox School of Business. He holds a PhD in Mathematics (Geometry and Topology) from Moscow State University and dual Master’s degrees in Mathematics and Machine Learning from prestigious Russian institutions. His research focuses on machine learning, data science, and context-aware recommender systems, emphasizing novel methods for predicting customer preferences and designing personalized recommendation frameworks. Education: PhD in Mathematics (Geometry and Topology), Moscow State University MS in Mathematics, Moscow State University MS in Machine Learning, Moscow Institute of Physics and Technology/Yandex School of Data Analysis Research Interests: Data Science and Analytics Machine Learning and Recommender Systems Context-Aware Systems and Text Mining Technology-Enhanced Learning Recent Work Trends: His publications emphasize context-aware recommendation algorithms, privacy concerns in personalized systems, and applications of hyperbolic embeddings. He also explores device impact on employee feedback and cryptocurrency investor behavior using multimodal data analysis. Awards: None explicitly listed in the provided materials. Advising/Grants: No formal advisees listed; his work at Yandex and NYU involved leading machine learning teams and tackling large-scale data science challenges. Labs/Teams: Active in the MIS department at Temple, contributing to research on adaptive learning systems and enterprise machine learning applications.

LEE Wee Sunمشاهده پروفایل

استاد

• Machine Learning
• Planning Under Uncertainty
• Approximate Inference
• +۳ مورد دیگر

LEE Wee Sun is a Professor in the Department of Computer Science at the National University of Singapore (NUS), where he previously served as Head of Department, Vice Dean of Undergraduate Studies, and Vice Dean of Research. His academic journey began with a B.Eng. in Computer Systems Engineering from the University of Queensland (1992) and a Ph.D. from the Australian National University (1996), followed by research roles at the Australian Defence Force Academy and MIT. Education: Ph.D., Australian National University, Canberra, Australia (1996) B.Eng. in Computer Systems Engineering, University of Queensland, Brisbane, Australia (1992) Research Focus: Professor Lee pioneers work in Machine Learning , Planning Under Uncertainty , and Approximate Inference , with emphasis on integrating AI subfields for holistic reasoning. His current projects include "Learning to Decompose for Reasoning and Planning" (enhancing LLMs via self-supervised problem decomposition) and "Learning to Reason with Visual-Linguistic Inputs" (unifying vision, language, and reasoning in single architectures). Publication Trends: Recent work (2023-2025) centers on bridging LLMs with classical AI techniques, featuring breakthroughs in uncertainty quantification, multi-task optimization, and graph-based reasoning. Key themes include sparsity-aware vehicle routing, epistemic uncertainty for reliable LLMs, and differentiable neural solvers for combinatorial problems. Awards: IJCAI-JAIR Best Paper Prize (2022) RSS Test of Time Award (2021) RoboCup Best Paper Award (IROS 2015) HRATC 1st Place (2015) IPPC POMDP Track 1st Place (2011, 2014) UAI Google Best Student Paper (2014) Semeval-1 1st/2nd Place (2007) J.G. Crawford Prize (ANU 1996) Leadership & Service: As steering committee chair for ACML and area chair for NeurIPS/ICML/AAAI/IJCAI, Professor Lee shapes global AI discourse. His administrative roles at NUS and collaborations with MIT/Singapore-MIT Alliance demonstrate commitment to advancing AI education and research infrastructure. While student advisees aren't listed, his leadership positions imply extensive mentoring. Research Ecosystem: His work drives NUS's AI initiatives including Knowledge@Computing projects on reasoning frontiers. Current efforts focus on making AI systems robust through uncertainty-aware planning and multi-modal integration, with applications in robotics, verification systems, and combinatorial optimization.

• Machine Learning
• Probabilistic Modeling
• Deep Learning
• +۴ مورد دیگر

Geoff Pleiss is an Assistant Professor in the Department of Statistics at the University of British Columbia (UBC), affiliated with CAIDA's AIM-SI cluster. He is also a Canada CIFAR AI Chair and faculty member at the Vector Institute. His research bridges deep learning and probabilistic modeling, focusing on uncertainty quantification, Bayesian optimization, Gaussian processes, and ensemble methods. Pleiss earned his PhD in Computer Science from Cornell University (2020), followed by a postdoc at Columbia University. He holds multiple awards, including the AISTATS Top Reviewer and NeurIPS recognitions. His work emphasizes scalable algorithms and open-source contributions, such as the GPyTorch library. Pleiss advises students in Computer Science and Statistics, including Donney Fan (PhD), Tim G. Zhou (MSc), and others. He teaches advanced courses like STAT 547U (Deep Learning Theory) and STAT 520P (Bayesian Optimization). Grants include NSERC Discovery and New Frontiers in Research funding. Pleiss collaborates on interdisciplinary projects, such as astrophysical discovery via machine learning, and actively participates in academic service and outreach. Education: PhD in Computer Science, Cornell University (2020) MSc in Computer Science, Cornell University (2018) BSc in Engineering (Computing with Applied Mathematics), Olin College (2013) Key Research Themes: Uncertainty-aware decision-making with neural networks Scalable Gaussian processes and Bayesian optimization Ensemble methods and their theoretical limitations Recent Grants: NSERC Discovery Grant (2024) New Frontiers in Research Fund (2025, co-PI) His publications span foundational theory to applied machine learning, with over 14,500 citations. He actively mentors students through research internships and advises on open-source software development. Pleiss frequently presents at top conferences and collaborates with industry partners like Microsoft and ASAPP.

Elizabeth Bruchمشاهده پروفایل

دانشیار

• Sociology
• Complex Systems
• Demography
• +۶ مورد دیگر

Elizabeth Bruch is an Associate Professor of Sociology and Complex Systems at the University of Michigan, serving as Associate Director of the Institute for Data and AI in Society. She holds External Faculty status at the Santa Fe Institute and is affiliated with the Center for Population Studies. With a Ph.D. from UCLA and an M.S. in Statistics, her research integrates choice modeling, network science, and agent-based simulations to study individual decisions in social environments. Key areas include residential segregation, dating markets, and higher education. Education: Ph.D. and M.S. in Sociology/Statistics (UCLA), B.A. in Sociology (Reed College) Affiliations: Santa Fe Institute, Institute for Advanced Study Berlin Her work has been published in Science , PNAS , and American Journal of Sociology , earning awards like the ASA Methodology Innovation Prize and the Merton Prize. Her upcoming book Date Like a Local (Princeton, 2026) explores urban influences on romantic behavior. Bruch’s research addresses societal challenges through computational methods, including pandemic modeling during the 2020 crisis and algorithmic analysis of dating markets. She serves on Santa Fe Institute’s Science Steering Committee and collaborates across disciplines to advance complexity science.

Maria Chudnovskyمشاهده پروفایل

استاد

• Graph Theory
• Applied Mathematics
• Combinatorics
• +۳ مورد دیگر

Maria Chudnovsky is a Professor in the Department of Mathematics at Princeton University. Her research focuses on structural graph theory, particularly in areas such as graph decomposition, induced subgraphs, and algorithmic applications of graph structure. She is renowned for her contributions to understanding perfect graphs, even-hole-free graphs, and the Erdős–Hajnal conjecture. Her work often explores the interplay between graph structure and algorithmic efficiency, with applications in combinatorial optimization and theoretical computer science. Notable contributions include foundational results on tree decompositions, chromatic number bounds, and the structure of metrizable graphs. Recent research trends include investigations into induced subgraph obstructions, tree independence numbers, and the properties of sparse graphs. She has published extensively on topics such as clique-stable set separation, rainbow matchings, and the complexity of graph coloring problems in restricted graph classes. Chudnovsky has been involved in significant collaborative projects, including work funded by the DMS-EPSRC grant 'The Power of Graph Structure' (2021). Her research frequently bridges theoretical insights with practical algorithm design, contributing to both fundamental and applied areas of discrete mathematics.