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

Abhishek Methukuمشاهده پروفایل

استادیار

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

Abhishek Methuku is an Assistant Professor in the Department of Mathematics at the University of Illinois Urbana-Champaign, part of the College of Liberal Arts & Sciences. His research focuses on probabilistic combinatorics, with expertise in hypergraphs, extremal graph theory, and Turán problems. Prior to this role, he held research positions at ETH Zürich and the University of Birmingham (UK), working with notable researchers like Benny Sudakov, Daniela Kühn, and Deryk Osthus. He earned his Ph.D. in 2019 under Gyula O.H. Katona and Ervin Győri at the Alfréd Rényi Institute of Mathematics. His work addresses foundational questions in combinatorics, including Erdős-style problems, hypergraph coloring, and extremal configurations. Recent contributions include proofs of long-standing conjectures like the Erdős-Faber-Lovász conjecture and the Elliott-Rödl conjecture on hypertrees. His research spans theoretical advancements in cycle decomposition, chromatic indices, and structural properties of graphs and hypergraphs. Abhishek’s academic network includes collaborations with leading mathematicians and institutions globally. His research is supported by a strong publication record in top-tier journals and conferences, reflecting his deep engagement with combinatorial optimization, extremal set theory, and algorithmic approaches to graph problems.

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

Tina Eliassi-Rad is the Joseph E. Aoun Professor at Northeastern University's Khoury College of Computer Sciences. She serves as core faculty at the Network Science Institute and external faculty at the Santa Fe Institute and Vermont Complex Systems Institute. Her research bridges data mining, machine learning, and network science with emphasis on trustworthy AI systems and societal impacts. Her current research programs focus on: Trustworthy Network Science: Enhancing explainability, robustness, and fairness in graph-based machine learning Just Machine Learning: Analyzing AI within broader sociotechnical systems to mitigate systemic risks Dr. Eliassi-Rad teaches graduate courses in Machine Learning with Graphs and has organized numerous workshops including the 2024 ICML Workshop on Humans, Algorithmic Decision-Making and Society. Her interdisciplinary work connects computer science with social science, biology, and policy studies.

• Machine Learning
• High-Dimensional Statistics
• Network Models
• +۳ مورد دیگر

Yang Feng is a Professor and Ph.D. Program Director in the Department of Biostatistics at New York University's School of Global Public Health. He holds affiliate faculty positions at the Center for Data Science and PRIISM. His research focuses on Machine Learning, High-Dimensional Statistics, Network Models, and Applications in Biostatistics and Public Health. Key contributions include advancements in Neyman-Pearson classification, federated learning, transfer learning, and high-dimensional statistical methods. He has authored influential papers in journals such as the Annals of Statistics, JASA, and Journal of Machine Learning Research. Recipient of prestigious honors: ASA Fellow, IMS Fellow, and ISI Elected Member. Leading an NSF-funded project on high-dimensional multi-task learning inference (Grant DMS-2324489). Editorial roles at top journals including JASA and AOAS. Research emphasizes theoretical foundations and practical applications, spanning statistical methodology, algorithm development, and interdisciplinary collaborations in health and data science.

Jonathan Noelمشاهده پروفایل

استادیار

• Extremal Combinatorics
• Probabilistic Combinatorics
• Combinatorial Limits
• +۷ مورد دیگر

Jonathan Noel is an Assistant Professor in the Department of Mathematics and Statistics at the University of Victoria. His research focuses on extremal combinatorics, probabilistic combinatorics, and combinatorial limits, with applications to quasirandomness, Ramsey theory, and graph theory. He holds a DPhil (PhD) from the University of Oxford and teaches courses such as MATH 122 (Logic and Foundations) and MATH 529 (Topics in Discrete Mathematics). His research interests include extremal set theory, graph colouring, graph homomorphisms, bootstrap percolation, and computational complexity. He explores how local patterns in discrete structures influence global properties, such as the interplay between edge densities and cycle counts in graphs. Recent work emphasizes quasirandomness through permutation patterns and entropy methods, alongside bootstrap percolation dynamics in hypercubes and cellular automata. His articles often bridge combinatorial limits with analytic approaches, such as the Szemerédi Regularity Lemma. No awards are listed for Jonathan Noel in the provided text. He advises no formally listed students but contributes to academic supervision through course instruction.

• Combinatorics
• Functional Analysis
• Ramsey Theory
• +۵ مورد دیگر

Pandelis Dodos is a Professor in the Department of Mathematics at the National and Kapodistrian University of Athens, Greece. His research focuses on combinatorics, functional analysis, and their intersections, particularly Ramsey theory, Banach space geometry, and descriptive set theory. He holds a PhD from the National Technical University of Athens (2003) and a Habilitation à Diriger des Recherches from Université Pierre et Marie Curie (2009). His work bridges analysis and combinatorics, addressing problems in nonlinear spectral gaps, forbidden intersection configurations, and high-dimensional random arrays. He leads the ANACOMB project (Hellenic Foundation for Research and Innovation), exploring combinatorial problems via analytical methods. Notable collaborations include researchers such as V. Kanellopoulos, K. Tyros, and S. Todorcevic. His contributions include monographs on Ramsey theory and Banach spaces, as well as over 50 peer-reviewed articles. Education: MSc Electrical Engineering (NTUA, 1997) PhD Mathematics (NTUA, 2003) Habilitation (UPMC Paris 6, 2009) His research projects include the ANACOMB initiative, investigating density Hales-Jewett conjectures and concentration inequalities. He advises PhD candidate Stamatis Skouras and collaborates with institutions like Texas A&M and Charles University. His work frequently intersects with theoretical computer science and probability theory. Awards: None explicitly listed, but recognized through extensive international collaboration and editorial roles in journals like Mathematische Annalen and Transactions of the AMS . Grants & Labs: ANACOMB (HFRI-FM20-02717), leading a multinational team addressing analytic combinatorics. Active in organizing workshops like COMPRAAthens 2024 .

Konstantinos Tyrosمشاهده پروفایل

دانشیار

• Ramsey Theory
• Density Combinatorics
• Banach Space Geometry
• +۲ مورد دیگر

Konstantinos Tyros is Associate Professor in Mathematics at the University of Athens, specializing in combinatorial analysis and Ramsey theory. His research connects density theorems in combinatorics with problems in Banach space geometry and probabilistic methods. Key contributions include density versions of combinatorial theorems (Carlson-Simpson, Hales-Jewett), structure theorems for stochastic processes on discrete cubes, and concentration inequalities for high-dimensional random arrays. His work on spreading models in Banach spaces reveals new structures in functional analysis. He has developed novel approaches to nonlinear spectral gaps and dual Ramsey theory for trees, while advancing the Moser-Tardos algorithmic framework. Honors include technical excellence awards from Greek academic institutions.

Alexander A. Razborovمشاهده پروفایل

استاد

• Complexity Theory
• Circuit Complexity
• Proof Complexity
• +۵ مورد دیگر

Alexander A. Razborov is the Andrew MacLeish Distinguished Service Professor of Computer Science and Mathematics at the University of Chicago and Adjoint Professor at the Toyota Technological Institute. His primary research focuses on complexity theory, including circuit complexity, proof complexity, quantum computations, and communication complexity. Previously he worked in combinatorial group theory and is actively exploring extremal combinatorics. He leads the Theoretical Computer Science Group, which connects computer science with physics, statistics, and mathematical sciences. His educational contributions include teaching Honors Discrete Mathematics, Mathematics of Quantum Computing, Complexity Theory, and other advanced topics. Razborov has received numerous prestigious awards including the Rolf Nevanlinna Prize (1990), Gödel Prize (2007), and election to the American Academy of Arts & Sciences (2020). He has supervised over 12 PhD and Master's students, with research spanning combinatorial open problems in proof complexity, continuous combinatorics, and communication complexity.

Daniel Kráľمشاهده پروفایل

استاد

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

Professor Daniel Kráľ is the Alexander von Humboldt Professor for Discrete Mathematics at Leipzig University since April 2025, affiliated with the Max Planck Institute for Mathematics in the Sciences. Previously, he held the Donald Ervin Knuth Professorship at Masaryk University (2018–2025) and was a professor at the University of Warwick (2012–2020). He also serves as an honorary professor at Warwick and has held visiting roles at UC Berkeley (2025) and Georgia Tech (2005–2006). His research focuses on combinatorics, graph theory, and their intersections with computer science, particularly in extremal combinatorics, graph limits, and algorithmic graph theory. Education: Ph.D. in Computer Science (2004), Master's (2001) from Charles University, Prague. Early career included postdoc roles at TU Berlin and Charles University's Institute for Theoretical Computer Science. Research Interests: Theory of combinatorial limits, extremal combinatorics, structural and algorithmic graph theory, analytic methods in discrete mathematics. Key contributions include resolving Steinberg's Conjecture and Lovász-Plummer Conjecture, development of graph limit theory, and applications to algorithm design. Grants & Awards: Recipient of ERC Starting (CCOSA) and Consolidator (LADIST) grants, SIAM Fellowship (2024), AMS Fellow (2020), Philip Leverhulme Prize (2014), European Prize in Combinatorics (2011). Over 150 journal articles, with impactful work in Advances in Mathematics , Journal of the EMS , and others. Service: Editor-in-Chief of SIAM Journal on Discrete Mathematics , co-editor of Journal of Combinatorial Theory , co-founder of Advances in Combinatorics . Organized major conferences and workshops, including the 2025 Oberwolfach workshop on Graph Theory. Labs/Teams: Leading research groups in discrete mathematics at Leipzig and previously in Brno/Warwick. Collaborates with postdocs and students on projects spanning graph limits, integer programming, and combinatorial optimization.

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

Dr. Ku Cheng Yeaw is a Senior Lecturer at the Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University (NTU). He holds a PhD from Queen Mary, University of London (2005) and has held prior academic positions at the California Institute of Technology (Harry Bateman Research Instructor, 2005–2008) and the National University of Singapore (Visiting Fellow/Lecturer/Senior Lecturer, 2008–2016). His research focuses on combinatorics, graph theory, and discrete mathematics, with notable contributions to eigenvalue analysis, intersecting families, and extremal set theory. He has an extensive publication record spanning over two decades, addressing topics such as hypergraphs, permutation patterns, and spectral properties of graphs. Dr. Ku has not been explicitly noted for awards or student advisement in the provided text.

Arnau Padrolمشاهده پروفایل

دانشیار

• Discrete Geometry
• Combinatorial Geometry
• Convex Polytopes
• +۵ مورد دیگر

Arnau Padrol is an Associate Professor at the Department of Mathematics and Computer Science, Faculty of Mathematics, Universitat de Barcelona. He is a member of the Combinatorics Research Group, the Institut de Matemàtica de la Universitat de Barcelona (IMUB), and the Centre de Recerca Matemàtica (CRM). He is currently on leave from a similar position as Maitre de conférences HDR at Sorbonne Université’s Institut de Mathématiques de Jussieu - Paris Rive Gauche, where he was part of the Combinatoire et Optimisation team. His research lies at the intersection of discrete geometry, combinatorics, and algebra, with a focus on convex polytopes, oriented matroids, triangulations, and their applications. He explores deep structural properties of polytopes, including their realization spaces, deformation cones, and connections to cluster algebras and combinatorial optimization. His work often reveals surprising phenomena in higher dimensions, such as the existence of polytopes without rational realizations or with complete graphs. The recent publications reflect a strong trend in geometric combinatorics, particularly in the study of polytopal structures like associahedra, zonotopes, and hypersimplices, and their combinatorial and algebraic properties. Key themes include universality, realizability, and the interplay between geometry and combinatorics in high-dimensional spaces. Scientific Awards: No specific awards mentioned in the provided text. Advising and Grants: Arnau Padrol has supervised multiple PhD students and postdoctoral researchers, including Chiara Mantovani, Eva Philippe, Germain Poullot, and Leonardo Martínez-Sandoval. His supervision reflects an active research group in geometric combinatorics. He has been involved in research projects such as Geometry and Algebra in Combinatorics , Red Temática de Matemática Discreta y Algorítmica , Combinatorics and Complexity of Discrete Geometric Structures , and several ANR-funded projects including PAGCAP and CAPPS, indicating sustained grant support for his research. Labs and Teams: He is a core member of the Combinatorics Research Group at Universitat de Barcelona and is affiliated with IMUB and CRM. At Sorbonne Université, he was part of the Combinatoire et Optimisation team at IMJ-PRG. These affiliations place him within active research networks in discrete mathematics in Europe.

Nicolás Sanhueza-Matamalaمشاهده پروفایل

استادیار

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

Nicolás Sanhueza-Matamala is an Assistant Professor at the Universidad de Concepción, Faculty of Physical and Mathematical Sciences. He is a member of the Discrete Mathematics Research Group at UDEC, focusing on extremal and probabilistic combinatorics, particularly in graph and hypergraph theory. His research interests include extremal graph theory, probabilistic methods in combinatorics, hypergraph theory, Hamiltonian cycles, Ramsey theory, and structural problems in discrete mathematics. He investigates degree conditions for spanning substructures, cycle decompositions, and robustness of graph properties. The recent publications highlight a strong focus on hypergraph generalizations of classical graph theorems, including Dirac-type conditions, bandwidth theorems, and cycle decompositions. His work frequently involves collaborations with leading researchers such as Richard Lang, Matías Pavez-Signé, and Simón Piga, and is published in top journals like Journal of Combinatorial Theory, Series B , Random Structures & Algorithms , and SIAM Journal on Discrete Mathematics . Best Paper Award at LAGOS '21 Editor's Choice 2022 of Discrete Mathematics He has advised several undergraduate and master’s students in mathematics and computer science and serves as a thesis advisor in doctoral and master’s programs. He has been awarded competitive grants including the Fondecyt Regular (2025–2028) and Fondecyt Iniciación (2022–2024). He is actively involved in the academic community, organizing colloquia and participating in international conferences such as EUROCOMB and RSA. He is a key contributor to the discrete mathematics community in Chile and internationally, with research that bridges theoretical depth and structural insight in combinatorics.

Victor Seixas Souzaمشاهده پروفایل

پژوهشگر ارشد

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

Victor Seixas Souza is a Klarman Fellow in the Department of Mathematics at Cornell University since July 2025, hosted by Martin Kassabov and Steven Strogatz. He is also a Research Fellow at Sidney Sussex College, Cambridge. Previously, he held a Research Associate position in the Algorithms and Complexity group at the University of Cambridge under Tom Gur's mentorship. PhD in Pure Mathematics, University of Cambridge (Department of Pure Mathematics and Mathematical Statistics), supervised by Professor Béla Bollobás Master's in Pure Mathematics, IMPA (Instituto Nacional de Matemática Pura e Aplicada), supervised by Rob Morris Undergraduate degree in Computer Engineering, University of Campinas Dr. Souza's research spans combinatorics, number theory, probability theory, and their connections to statistical physics and theoretical computer science. His recent work has focused on synchronization phenomena, which was featured in Quanta magazine. He has made significant contributions to extremal graph theory, geometric probability, and combinatorial game theory, with publications appearing in top mathematics journals. His research demonstrates deep connections between discrete mathematics and probabilistic methods. Dr. Souza's publication record shows a strong focus on combinatorial structures and probabilistic phenomena. His work often bridges theoretical mathematics with applications in computer science, particularly in problems involving phase transitions, extremal configurations, and random processes. The research demonstrates sophisticated mathematical techniques applied to fundamental questions in discrete mathematics. Dr. Souza collaborates extensively with leading researchers in combinatorics and probability, including V. Falgas-Ravry, A. Mond, R. Sarkar, C. Bortolotto, L. Hollom, and J. Portier. His work has attracted attention from the mathematical community, with coverage in prominent outlets like Quanta magazine.

Cheng Maoمشاهده پروفایل

استادیار

• statistical inference on random graphs
• mathematics of data science
• mathematical statistics
• +۲ مورد دیگر

Cheng Mao is an Assistant Professor in the School of Mathematics at the Georgia Institute of Technology (Georgia Tech), with office location in Skiles 102C and mailing address at 686 Cherry Street, Atlanta, GA 30332 USA. His position is active as of 2025, with no indication of part-time status or retirement. Education: B.S. and M.A. in Mathematics, University of California, Los Angeles (UCLA), 2013 Ph.D. in Mathematics and Statistics, Massachusetts Institute of Technology (MIT), 2018 (Advisor: Philippe Rigollet) Postdoctoral Researcher, Yale University, 2018-2019 (with Yihong Wu) Cheng Mao's research centers on the mathematics of data science, specifically statistical inference for random graphs. His work bridges mathematical statistics, applied probability, and theoretical computer science to address fundamental problems in graph matching, community detection, and matrix estimation under structural constraints like total positivity. He investigates algorithmic efficiency, information-theoretic limits, and the detection-recovery gap in planted models. His publication trends (2020-2025) reveal deep specialization in spectral methods for graph matching (e.g., Erdős-Rényi graphs, noise robustness) and combinatorial approaches to planted structures (dense cycles, subhypergraphs). Key themes include leveraging low-degree polynomials for detection, tree counting for network correlation, and method-of-moments techniques for permutation learning. Matrix estimation under Monge and total positivity constraints forms another consistent thread. Scientific Awards: No scientific awards mentioned in the provided text Cheng Mao advises three Ph.D. students at Georgia Tech: Jingyi (Joy) Zhang (co-advised with Debankur Mukherjee), Shenduo Zhang, and Abhishek Dhawan (Ph.D. 2024, now postdoc at UIUC, co-advised with Anton Bernshteyn). Timothy Wee joined as a postdoc in 2024. The text contains no references to research grants or external funding sources. No laboratories, research teams, or collaborative groups are specified in the source material.

• Theoretical Computer Science
• Database Theory
• Formal Logic
• +۵ مورد دیگر

Nicole Schweikardt is a Professor at the Institute of Computer Science within Humboldt University of Berlin . Her research focuses on Theoretical Computer Science , particularly in Database Theory , Formal Logic , and Algorithmic Meta-Theorems . Academic Rank: Professor Contact: schweikn@informatik.hu-berlin.de Research Interests : Nicole investigates logical characterizations of database query languages, algorithmic meta-theorems for sparse graphs, and efficient enumeration techniques. Her work bridges formal logic, computational complexity, and practical database systems. Scientific Awards : 2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award Recent Article Trends : Nicole's recent publications emphasize schema matching , spanner evaluation , first-order logic extensions , and query enumeration . Her work spans theoretical foundations (e.g., counting quantifiers, Hanf normal forms) and practical applications (e.g., event stream analysis, document compression).

Shonda Dueckمشاهده پروفایل

دانشیار

• Algebraic Graph Theory
• Algebraic Hypergraph Theory
• Group Actions on Combinatorial Structures
• +۳ مورد دیگر

Shonda Dueck is an Associate Professor in the Department of Mathematics and Statistics at the University of Winnipeg . She holds a Ph.D. in Mathematics from the University of Ottawa, a Master of Mathematics from the University of Waterloo, and a B.Sc. (Honours) from the University of Winnipeg. Her research focuses on algebraic graph and hypergraph theory, particularly on group actions on combinatorial structures, cyclic partitions of hypergraphs, and metric dimension problems. Research Interests include: Algebraic graph theory and hypergraph theory Self-complementary and t-complementary graphs/hypergraphs Hypergraph decompositions using group actions Metric and partition dimension of Cayley hypergraphs Large sets of combinatorial designs Her recent publications analyze metric dimension in circulant graphs, cyclic partitions of hypergraphs, and threshold dimension problems. She has also contributed to understanding Hamiltonian paths in Cayley digraphs and vertex-transitive hypergraph structures. Affiliations: Adjunct Professor, Faculty of Graduate Studies and Research, University of Regina (2017–2022)