جست‌وجوی استاد و پژوهشگر

Erik Westlundمشاهده پروفایل

استاد

• Discrete Mathematics
• Combinatorics
• Graph Theory
• +۴ مورد دیگر

Erik Westlund serves as the Chair of the Department of Mathematics and Professor of Mathematics at Kennesaw State University (KSU). He joined the faculty in 2011 and has held leadership roles, including Interim Department Chair from 2024 to 2025. He holds a Ph.D. in Mathematical Sciences from Michigan Technological University (2010), an M.S. from the same institution (2006), and a B.S. in Mathematics from Northland College (2003). His research focuses on discrete mathematics, including combinatorics, extremal and algebraic graph theory, and applied network analysis. He also explores best practices in undergraduate mathematics education and institutional research. Westlund emphasizes active learning in teaching calculus for STEM majors and discrete mathematics for computer science students, alongside courses in graph theory, combinatorics, and abstract algebra. His publications span theoretical graph theory and educational innovation, addressing topics like Hamilton decompositions in Cayley graphs, graph coloring extensions, and faculty-driven curricular reforms. While no awards are explicitly listed, his contributions to academic leadership and research are evident through his sustained scholarly output and administrative roles. Westlund’s advising and grant activities are not detailed in the provided text, but his roles as department chair and professor highlight institutional and academic leadership. His work bridges pure mathematical research with pedagogical innovation, reflecting a commitment to both advancing knowledge and enhancing educational practices.

• Combinatorics
• Graph Theory
• Discrete Mathematics
• +۴ مورد دیگر

Affiliations & Roles Sonia Pérez Mansilla is a researcher at the Universitat Politècnica de Catalunya (UPC), affiliated with the Departament de Matemàtiques and the Escola d'Enginyeria de Telecomunicació i Aeroespacial de Castelldefels (EETAC) . She is a core member of two research groups: COMBGRAPH (Combinatorics, Graph Theory and Applications) OMGRAPH (Optimization Methods on Graphs) Education She holds a doctoral degree in Mathematics from UPC, with a thesis titled Recubrimientos k-arco transitivos de digrafos (2001), exploring symmetry in graph structures. Research Interests Her work focuses on combinatorics, graph theory, and optimization methods applied to networks. Key themes include: Algebraic graph constructions (e.g., Cayley digraphs) Graph symmetry (arc transitivity, vertex transitivity) Applications in telecommunications and unmanned aerial systems Publications Trends Her articles span theoretical contributions (e.g., Cayley digraph optimizations) and applied work (e.g., channel allocation in mobile networks). Recent efforts emphasize geometric approaches to dense network design and hypergraph symmetry analysis. Grants & Collaborations She has led/co-led multiple competitive projects funded by Spanish and Catalan agencies, including: AGRUPS grants (2022–2024) Projects on combinatorial optimization and graph applications Labs & Teams Active in the COMBGRAPH and OMGRAPH groups, collaborating with experts like Miquel Àngel Fiol and Oriol Serra on discrete mathematics and algorithmic challenges.

Lipei Zhangمشاهده پروفایل

پژوهشگر

• Medical Imaging
• Artificial Intelligence
• Machine Learning
• +۳ مورد دیگر

Lipei Zhang is a researcher affiliated with the Department of Applied Mathematics and Theoretical Physics (DAMTP) at the University of Cambridge, contributing to the Cambridge Image Analysis research group. Their work focuses on advancing machine learning and deep learning techniques for medical imaging applications, particularly in healthcare diagnostics and biomedical engineering. Research interests include brain disease analysis, MRI reconstruction, tumour segmentation, Alzheimer's diagnosis, and multi-modal data integration. Key technical contributions involve developing novel neural network architectures like Hypergraph Dynamic Adapters and Dual-Stage Distribution Adaptation (D2SA) for improving medical image processing efficiency. Zhang's work bridges computational methods with clinical challenges, addressing issues such as low-count PET denoising, glioma grading, and cross-manufacturer chest X-ray segmentation. These efforts aim to enhance diagnostic accuracy and accelerate healthcare AI applications. Publications highlight expertise in implicit neural representations, biophysics-informed regularization, and population-based graph neural networks. The research portfolio reflects a strong emphasis on translating theoretical advancements into practical tools for medical practitioners, emphasizing both algorithmic innovation and clinical relevance.

• Combinatorics
• Probability Theory
• Statistical Physics
• +۳ مورد دیگر

Bhargav Narayanan is an Associate Professor in the Department of Mathematics at Rutgers University. His research focuses on combinatorics, probability theory, statistical physics, and theoretical computer science, with a specialization in combinatorial models and probabilistic methods. He organizes a weekly seminar at Rutgers exploring these topics. Previously, he held a research fellowship at St John's College, Cambridge, and completed his PhD under Béla Bollobás at Cambridge University. Education: PhD in Mathematics from the University of Cambridge. Career: Postdoctoral research at St John's College, Cambridge before joining Rutgers. Research Interests: Combinatorics, probability theory, statistical physics, and theoretical computer science. He has published extensively in top-tier journals such as the Annals of Mathematics and the Journal of the European Mathematical Society. Selected publications highlight contributions to antichain codes, random graph bisections, threshold phenomena, and combinatorial optimization. His work often bridges discrete mathematics and applications in physics and computer science. He has taught graduate courses on additive combinatorics, spectral methods, and probabilistic methods in combinatorics. No scientific awards explicitly listed in the provided texts. Advising: No students listed explicitly in the text. Grants: No specific grants mentioned. Lab/Team: Organizes a weekly research seminar at Rutgers.

Yifan Jingمشاهده پروفایل

استادیار

• Additive and Combinatorial Number Theory
• Combinatorics and Graph Theory
• Harmonic Analysis
• +۸ مورد دیگر

Yifan Jing is an Assistant Professor in the Department of Mathematics at The Ohio State University (OSU). He previously held postdoctoral positions at the University of Oxford’s Mathematical Institute and Wolfson College, mentored by Ben Green. His academic journey includes a PhD from the University of Illinois Urbana-Champaign (2021), supervised by József Balogh and Xiaochun Li, an M.Sc. from Simon Fraser University (2018) under Bojan Mohar, and a B.Sc. from the University of Science and Technology of China (2016), advised by Jack Koolen. His research focuses on Arithmetic Combinatorics, Analytic and Combinatorial Group Theory, Lie groups, Abstract Harmonic Analysis, Representation Theory, Additive Number Theory, Model Theory applications, Discrete Probability, and Theoretical Computer Science. Notable contributions include work on measure growth in Lie groups, inverse theorems for geometric inequalities, and structural graph theory. He received the 2023 Kirkman Medal for his research contributions. He currently organizes OSU’s Combinatorics Seminar and teaches Math 4507: Geometry. His advising includes PhD students Yewen Sun, Chavdar Lalov, and Yuchen Meng, alongside mentoring multiple undergraduate researchers at Oxford. Collaborators include leading mathematicians such as Chieu-Minh Tran, Ruixiang Zhang, and Bojan Mohar. His work bridges analysis, algebra, and logic to address problems across combinatorics, number theory, and geometry.

Edwin van Damمشاهده پروفایل

استاد

• Combinatorics
• Discrete Mathematics
• Operations Research
• +۱ مورد دیگر

Edwin van Dam is a Full Professor in the Department of Econometrics and OR at Tilburg University, affiliated with the TS Economics and Management faculty and CentER. His research focuses on Combinatorics, Discrete Mathematics, and Operations Research, with contributions to eigenvalue studies, hypergraphs, and graph theory. He earned his PhD from CentER (1992–1996) and held academic roles since 1996, including postdoctoral fellowships at Queen’s University (1997–1998) and assistant/associate professorships at Tilburg. He co-authored textbooks like Linear and Dynamical Systems, Optimization and Games (2006, 2010). Recent research emphasizes spectral graph theory, hypergraphs, and combinatorial designs. He supervised four PhD students and contributed to projects on distance-regular graphs and black-box function approximation. Collaborations span global institutions, and he leads the Operations Research research group at Tilburg.

Zelealem Yilmaمشاهده پروفایل

عضو هیئت علمی

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

Zelealem Yilma is an Associate Teaching Professor in the Department of Mathematics at Carnegie Mellon University Qatar, part of the Mellon College of Science. They specialize in graph theory, combinatorics, and network analysis with a focus on extremal problems and structural graph properties. Their research often addresses spanning trees in regular graphs, network eccentricity, and extremal edge-colorings. Key research interests include exploring the minimum spanning trees in multigraphs, structural constraints in networks, and Ramsey-type problems in graph colorings. Yilma's work frequently intersects with hypergraph theory and algorithmic combinatorics. Publications highlight a consistent focus on combinatorial extremal problems, with recent work emphasizing 4-regular graphs (2024) and multigraph spanning tree enumeration (2022). Earlier contributions include studies on Erdős–Rothschild edge-coloring conjectures (2017) and antimagic graph properties (2013).

Blair D. Sullivanمشاهده پروفایل

استاد

• parameterized algorithms
• structural graph theory
• applied discrete mathematics
• +۴ مورد دیگر

Dr. Blair D. Sullivan is a Professor in the School of Computing at the University of Utah. She holds a Ph.D. in Mathematics from Princeton University and a B.S. in Computer Science and Applied Mathematics from Georgia Tech. Prior to Utah, she was an Associate Professor at NC State University (2013–2019) and a Research Scientist at Oak Ridge National Laboratory (2008–2013). Research Interests: Parameterized algorithms, structural graph theory, applied discrete mathematics, random graphs, and combinatorial scientific computing. Current work focuses on integrating structural graph theory into scalable network analysis tools, with applications in robotics, fairness in algorithms, and biomedical networks. Awards & Honors: Fulbright U.S. Scholar to France (AY2025–26) Collegium de Lyon Fellow (2025–2026) Moore Investigator in Data-Driven Discovery (2014–2024) Inaugural Pathway of Progress Alumnae Honoree (Georgia Tech) Key Projects: Developed software tools like CONCUSS , spacegraphcats , and BEAVr for graph analytics and network analysis. Explores edge augmentation for fairness in social networks and robotic motion planning using parameterized algorithms. Grants: NSF-funded projects on fairness in network information flow ($1.5M). NIH grant for network-based drug repositioning algorithms. Labs & Collaborations: Active in the Laboratoire de l'Informatique du Parallélisme (LIP) at ENS de Lyon during her 2025–2026 sabbatical. Collaborates with SIAM and ICERM on workshops and conferences.

Kimberly Jenkinsمشاهده پروفایل

استاد

• Design Theory
• Combinatorics
• Statistics
• +۲ مورد دیگر

Kimberly Jenkins is a Professor of Mathematics at Transylvania University, where she teaches courses ranging from general education to advanced topics like Abstract Algebra and Design Theory. She holds a Ph.D. from Auburn University (1997) following a B.S. (1991) and M.A. (1993) from the same institution. Her teaching philosophy emphasizes conceptual understanding over rote computation, prioritizing students' ability to articulate mathematical reasoning and apply quantitative skills across disciplines. Her research focuses on design theory and combinatorics, with notable contributions to graph decompositions and hypergraph structures. Jenkins actively contributes to mathematics education through textbook editing for Schaum’s Outlines series. She is a member of the Mathematical Association of America (MAA). Jenkins values the liberal arts context, noting mathematics' role in fostering logical reasoning and its applications in diverse professions like medicine, psychology, and actuarial science. She takes pride in witnessing students' intellectual growth over their undergraduate careers.

Karen Gundersonمشاهده پروفایل

دانشیار

• Graph theory
• Combinatorics
• Random graphs
• +۱۰ مورد دیگر

Karen Gunderson is an Associate Professor in the Department of Mathematics at the University of Manitoba's Faculty of Science. Her research spans graph theory, combinatorics, random graphs, percolation, hypergraphs, and extremal combinatorics. Research Focus : Graph theory, combinatorics, random graphs, percolation, hypergraphs, extremal combinatorics Academic Role : Associate Professor, Acting Associate Head Graduate Contact : Karen.Gunderson@umanitoba.ca , karen.gunderson@umanitoba.ca Her work includes bootstrap percolation , random geometric graphs , and extremal hypergraph problems , with applications in network modeling and probabilistic combinatorics. Recent publications focus on adversarial burning densities, Erdos-Ko-Rado robustness, and Turán numbers in switching contexts. Academic Leadership : Co-organizer of the University of Manitoba Combinatorics Seminar and key organizer for the 2023 CanaDAM conference and Movement & Symmetry in Graphs retreat.

Andrzej Cegielskiمشاهده پروفایل

استاد

• Iterative methods for fixed point problems
• Operator theory
• Variational inequalities
• +۹ مورد دیگر

Andrzej Cegielski is a Professor at the Institute of Mathematics, University of Zielona Góra, Poland, with office located in room 521 A-29. His research spans multiple advanced mathematical domains with significant contributions to theoretical and applied mathematics. His primary research interests include: Iterative methods for fixed point problems and variational inequalities Properties of non-extending, regular non-extending, and strict pseudo-contracting operators Analysis of multivariate linear models and estimation of covariance parameters Game theory with focus on stochastic, multigenerational, and large games Graph theory specializing in distinguishable coloring and list-summation hypergraph coloring Theory of operators on locally convex spaces Nonlinear wave propagation and Korteweg-de Vries equation generalizations Approximation theory using Fourier series Professor Cegielski teaches courses in optimization, operational research, and iterative methods for fixed point problems. He also contributes to mathematical outreach through popular science lectures for young people, demonstrating commitment to education beyond traditional academic boundaries. His research methodology often employs coordinate-free approaches, fixed point theorems, and advanced analytical techniques across diverse mathematical applications.

• Data Mining
• Machine Learning
• Network Science
• +۵ مورد دیگر

Tina Eliassi-Rad is the Inaugural Joseph E. Aoun Professor at Northeastern University . She is also an external faculty member at the Santa Fe Institute and the Vermont Complex Systems Center . Her research lies at the intersection of Artificial Intelligence , Network Science , and their societal implications . Research Interests Data Mining & Machine Learning Network Science & Complex Systems Artificial Intelligence & Society Trustworthy Network Science Just Machine Learning Recent Article Trends Her recent work focuses on Graph Neural Networks , Hypergraph Mining , Adversarial Attacks , Algorithmic Fairness , and Human-AI Coevolution . Publications explore topics like Information Inequality , Network Resilience , and Explainable AI . Scientific Awards Inaugural Joseph E. Aoun Professor at Northeastern University Advising & Grants Current Students : Wan He (Network Science PhD), David Liu (CS PhD), Zohair Shafi (CS PhD), Samantha Dies (CS PhD) Major Funders : Defense Advanced Research Projects Agency (DARPA), National Science Foundation (NSF), Army Research Lab (ARL), Defense Threat Reduction Agency (DTRA), Lawrence Livermore National Laboratory (LLNL), MIT Lincoln Laboratory (MITLL), Volkswagen Foundation, PricewaterhouseCoopers (PwC), Washington Post Labs Labs & Teams She leads the RADLAB at Northeastern University and collaborates with the Network Science Institute . Her team includes postdoctoral researchers and PhD candidates working on AI, network science, and cybersecurity.

Huy Tuan Phamمشاهده پروفایل

پژوهشگر ارشد

• Combinatorics
• Probability
• Number Theory
• +۱ مورد دیگر

Huy Tuan Pham is a Clay Research Fellow at the Institute for Advanced Study, beginning July 2023. He received his PhD in 2023 from Stanford University, where he was advised by Jacob Fox. His research spans combinatorics, probability, number theory, and theoretical computer science. Key contributions include: With Fox and Zhao: demonstrating that Green’s popular difference theorem requires tower-type bounds, marking the first known application of Szemerédi’s regularity method that truly requires such bounds. With Park: proving the Kahn-Kalai conjecture on phase transitions and Talagrand’s conjecture on selector processes. With Conlon and Fox: solving long-standing conjectures of Erdős in additive combinatorics regarding subset sums and Ramsey complete sequences. With Cook and Dembo: developing a quantitative nonlinear large deviations theory for random hypergraphs. He has been awarded the Clay Research Fellowship, a five-year fellowship beginning July 2023, which is a significant recognition in the mathematical community. No details on academic advising, research grants, laboratories, or research teams are provided in the available text.