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

Julia A. Palaciosمشاهده پروفایل

دانشیار

• Statistical Methods in Evolutionary Genomics
• Infectious Diseases Modeling
• Bayesian Nonparametric Methods
• +۷ مورد دیگر

Julia A. Palacios is an Associate Professor of Statistics and Biomedical Data Science at Stanford University, with a courtesy appointment in Biology. She leads the Palacios Lab, focusing on developing statistical methods for evolutionary genomics, infectious diseases, and stochastic processes impacting public health. Her work integrates Bayesian nonparametric techniques, probabilistic AI, and computational statistics to address challenges in genetics, health, and cancer research. Her educational background includes a PhD in Statistics and postdoctoral research in computational biology. Current lab members include postdocs Bingjing Tang and Isaac Goldstein, PhD students Yi-Ting Tsai, Ivan Specht, Julie Zhang, and Leda Liang, and undergraduate researcher Shinnosuke Yagi. Former postdocs like Airam Blancas and Jaehee Kim have moved to faculty positions at ITAM and Cornell, respectively. Research funding includes NIH, NSF, Sloan Foundation grants, and the Terman Fellowship. Key contributions span phylodynamic modeling, coalescent theory, and real-time pathogen surveillance. Her lab's software tools include phylodyn (R package for phylodynamic inference) and adaPop (Bayesian population dynamics inference). Awards include the Sloan Research Fellowship and Gabilan Fellowship. Teaching roles include courses like Stats 376 and Stats 305A . Her lab actively recruits students and postdocs for research in evolutionary stochastic processes and biomedical data science. Labs/Teams: Palacios Lab at Stanford's Department of Statistics, collaborating with institutions globally on pandemic tracking and genomic studies. Current projects focus on multifurcating trees in infectious diseases, Bayesian nonparametric coalescent models, and computational tools for public health.

Luke Postleمشاهده پروفایل

استاد

• Graph Theory
• Graph Coloring
• Graph Decompositions
• +۳ مورد دیگر

Dr. Luke Postle is a Canada Research Chair in Graph Theory and a Professor in the Department of Combinatorics and Optimization at the University of Waterloo. His research focuses on Graph Coloring, Graph Decompositions, Topological and Structural Graph Theory, Extremal and Probabilistic Combinatorics, and Matroids. He has received the 2021 Coxeter-James Prize for his contributions to combinatorics. His work includes theoretical advancements in graph coloring, decomposition algorithms, and structural properties of graphs on surfaces. He teaches courses on Graph Theory and Probabilistic Methods, with lecture series available on YouTube. Postle’s research has been published in top journals such as Journal of Combinatorial Theory Ser. B , Journal of Graph Theory , and Transactions of the American Mathematical Society . His articles address problems in list coloring, cycle counting, matroid structure, and probabilistic graph decomposition. Key Awards: 2021 Coxeter-James Prize Teaching: Graph Theory and Probabilistic Methods courses on YouTube Research Themes: Structural Graph Theory, Combinatorial Optimization, Probabilistic Methods

• Lattice Algorithms and Geometry of Numbers
• Linear and Integer Programming
• Extended Formulations
• +۳ مورد دیگر

Daniel Dadush is a part-time Professor of Geometry of Optimization at Utrecht University and leads the Networks & Optimization group at Centrum Wiskunde & Informatica (CWI). He has held previous positions as a Simons Postdoctoral Fellow at the Courant Institute of Mathematical Sciences (New York University) and a PhD in the ACO program (Algorithms, Combinatorics, and Optimization) at Georgia Tech. Research Interests: Lattice Algorithms, Geometry of Numbers, Linear/Integer Programming, Extended Formulations, Discrepancy Theory, Convex Optimization, Asymptotic Convex Geometry. Awards: Van Dantzig Prize (2020), Best Paper Award at CCC'20 (2020), Tucker Prize (2015). Advising: Supervised PhD/MSc students including Ben Bals, Samarth Tiwari, Sander Borst, Sophie Huiberts, Huck Bennett, and Yilin Li. Recent Publications: His 15 most recent articles focus on strongly polynomial algorithms, exact integer programming, convex optimization in the oracle model, matrix discrepancy, circuit diameter bounds, and integrality gaps, spanning journals and conferences like STOC, SODA, FOCS, and Mathematical Programming. Professional Activities: Organizer of the Dutch Day on Optimization (2022), co-organizer of workshops on Discrepancy Theory, Lattices, and Discrete Optimization at institutions like HIM Bonn and the Simons Institute. Served on program committees for STOC 2025, SODA 2024, and other major conferences. Teaching: Lectured on Interior Point Methods, Straight-Line Complexity, and courses in Continuous Optimization at Utrecht University and Mastermath.

Leonard J. Schulmanمشاهده پروفایل

استاد

• Algorithms
• Communication Protocols
• Combinatorics
• +۶ مورد دیگر

Leonard J. Schulman is a Professor of Computer Science at the California Institute of Technology (Caltech), where he has been on the faculty since 2000. He is affiliated with the Caltech Center for the Mathematics of Information (which he directed from 2003 to 2017) and the Institute for Quantum Information and Matter. His academic appointments have included positions at UC Berkeley, the Weizmann Institute of Science, the Georgia Institute of Technology, and the Mathematical Sciences Research Institute. Schulman received his BSc in Mathematics in 1988 and his PhD in Applied Mathematics in 1992, both from the Massachusetts Institute of Technology (MIT). Schulman's research spans several overlapping areas in theoretical computer science and applied mathematics. His work focuses on algorithms and communication protocols , combinatorics and probability , coding and information theory , and quantum computation . More recently, his research has expanded into causal inference and machine learning , particularly in the areas of mixture models, causal discovery, and structure learning. His approach combines deep theoretical insights with practical applications across multiple domains. An analysis of Schulman's recent publications (2019-2025) reveals a strong focus on causal inference and machine learning, particularly in the areas of mixture models, causal discovery, and structure learning. His work bridges theoretical computer science with statistical learning, often developing novel algorithms with provable guarantees. He has also maintained his foundational work in coding theory, algorithms, and quantum computation, demonstrating remarkable breadth across theoretical computer science. IEEE Schelkunoff Prize (2004) ACM Notable Paper (2012) UAI Best Paper Award (2016) FOCS Test of Time Award (2022) S. A. Schelkunoff Transactions Prize Paper Award (2004) SIAM Fellow NSF CAREER award NSF mathematical sciences postdoctoral fellowship MIT Bucsela prize in mathematics Schulman has advised numerous PhD students and postdoctoral researchers who have gone on to successful careers in academia and industry. His former students and postdocs include notable researchers such as Ashwin Nayak, Yaoyun Shi, Sean Hallgren, Jie Gao, and Michael Langberg. He served as Editor-in-Chief of the SIAM Journal on Computing from 2013 through 2018 and has been on the editorial boards of several prestigious journals including the Journal of the ACM, ACM Transactions on Algorithms, and SIAM Journal on Discrete Mathematics. Schulman directs the Caltech Center for the Mathematics of Information, a research center focused on the mathematical foundations of information processing, communication, and computation. His work often involves interdisciplinary collaborations across computer science, mathematics, physics, and economics.

Mehtaab Sawhneyمشاهده پروفایل

استادیار

• combinatorics
• probability
• analytic number theory
• +۱ مورد دیگر

Mehtaab Sawhney is a Clay Research Fellow and a tenure-track assistant professor at Columbia University specializing in combinatorics, probability, analytic number theory, and theoretical computer science. His academic journey began at the University of Pennsylvania where he enrolled in a Bachelor of Engineering in Computer Science (2016-2017), then continued at MIT where he earned a Bachelor of Science in Mathematics with Minor in Computer Science (2017-2020), followed by a Doctor of Philosophy in Mathematics (2020-2024) under the advisorship of Yufei Zhao. His research spans probabilistic combinatorics, random matrix theory, additive number theory, and theoretical computer science. Sawhney's work bridges theoretical mathematics with computational applications, focusing on random structures, additive combinatorics, and spectral properties of discrete objects. His publications demonstrate a strong interdisciplinary approach that connects number theory with probabilistic methods to solve complex combinatorial problems. The analysis of his publication record reveals a consistent focus on foundational mathematical structures with applications across multiple domains. His work on random graphs, additive bases, and arithmetic progressions has established him as a leading researcher in modern combinatorics, often collaborating with prominent mathematicians including Ashwin Sah, Yufei Zhao, and Vishesh Jain. His research output shows remarkable depth and breadth, with contributions to both pure mathematics and theoretical computer science. 2024 Clay Research Fellow 2021 Frank and Brennie Morgan Prize for Outstanding Research in Mathematics by an Undergraduate Student (joint with Ashwin Sah) Churchill Scholar 2020 Best Student Paper STOC 2021 (Joint with Ryan Alweiss, Yang Liu) Best Student Paper ITCS 2022 (Joint with Yang Liu, Ashwin Sah) 2023 Hartley Rogers Jr. Prize 2022 Charles W. and Jennifer C. Johnson Prize (joint with Ashwin Sah) NSF Graduate Fellowship Sawhney has established a robust research program with significant contributions across multiple mathematical disciplines. His frequent collaborations with top researchers worldwide indicate an active and influential research network. While specific advisees aren't listed in available information, his extensive publication record with numerous co-authors suggests active mentorship of junior researchers through collaborative projects.

• Combinatorics
• Latin squares
• Matrix permanents
• +۵ مورد دیگر

Prof Ian M. Wanless is a Professor in the School of Mathematics at Monash University, Melbourne, Australia. He has held academic positions at institutions including the Australian National University (ANU), University of Melbourne, Christ Church Oxford, and Charles Darwin University. His research primarily focuses on combinatorics, with specializations in Latin squares, matrix permanents, graph theory, and algebraic structures. He has made significant contributions to the enumeration and properties of Latin squares, including groundbreaking work on transversals, orthogonality, and symmetry. Wanless has also explored connections between Latin squares and algebraic structures like quasigroups and loops. His education includes a PhD from ANU (supervised by Brendan McKay) and postdoctoral fellowships at Oxford and ANU. He has been awarded an Australian Research Council Future Fellowship (2011) and has led major research initiatives, including organizing international conferences (e.g., 5ICC in 2017). His work spans theoretical results and computational methods, with over 100 publications in top journals like Journal of Combinatorial Theory and SIAM Journal on Discrete Mathematics . Wanless’s research interests extend to design theory, hypergraphs, and permutation polynomials. He co-edits the Electronic Journal of Combinatorics and has held leadership roles in professional societies, including president of the Combinatorial Mathematics Society of Australasia. His current projects include studies on perfect 1-factorizations, covering radii of permutation sets, and algebraic properties of Latin squares.

Raffaella Mulasمشاهده پروفایل

استادیار

• Spectral Theory of Graphs and Hypergraphs
• Discrete Laplacians
• Non-backtracking Operators
• +۷ مورد دیگر

Raffaella Mulas is an Assistant Professor in the Department of Mathematics at the Faculty of Science, Vrije Universiteit Amsterdam. She previously served as a Group Leader and Minerva Fast Track Fellow at the Max Planck Institute for Mathematics in the Sciences, where she maintains an ongoing affiliation. Her research lies at the intersection of spectral graph theory, discrete mathematics, and network science. Research Interests: Her work focuses on the spectral theory of graphs and hypergraphs, particularly the properties of discrete Laplacians and non-backtracking operators. She investigates extremal combinatorics problems such as graph coloring and the Turán problem, often applying spectral methods to derive sharp bounds. Her research has strong applications in modeling and analyzing complex networks. Recent Research Trends: Analysis of the 15 most recent publications reveals a consistent focus on spectral characterizations of graphs and hypergraphs, including signed and complex unit hypergraphs. She frequently studies the normalized Laplacian and its extremal eigenvalues, develops non-backtracking operators, and explores measure-theoretic and geometric representations of networks. A strong thread connects spectral bounds to combinatorial invariants like chromatic number. VU Startpremie Grant Elected Member, European Mathematical Society Young Academy (EMYA) Elected Member, Elisabeth-Schiemann-Kolleg, Max Planck Society Minerva Fast Track Fellow, Max Planck Institute Advising and Grants: While no formal students are listed, she is an active researcher with significant grant funding, notably the VU Startpremie Grant. She collaborates internationally and supervises research projects in spectral graph theory and network analysis. Her affiliation with both VU Amsterdam and MPI-MiS enables broad academic mentorship and collaborative supervision. Labs and Research Groups: Raffaella Mulas leads research within the Mathematics Department at VU Amsterdam and is affiliated with the research group at the Max Planck Institute for Mathematics in the Sciences. Her work contributes to advancing theoretical foundations in discrete mathematics with applications in data science and network modeling.

Jonah Gasterمشاهده پروفایل

استادیار

• Topology
• Geometric Group Theory
• Combinatorial Topology
• +۱ مورد دیگر

Jonah Gaster is an Assistant Professor in the Department of Mathematical Sciences at the University of Wisconsin-Milwaukee, where he also serves as the Program Coordinator for the Topology Research Group and Colloquium Chair. His research focuses on mathematical topology, geometric group theory, and combinatorial structures in low-dimensional topology. His research explores the interplay between combinatorial methods and geometric structures, with specific interests in curve systems on surfaces, harmonic maps between manifolds, and the computational aspects of topological invariants. Recent work investigates combinatorial representations of geometric objects and their applications in low-dimensional topology. Analysis of Dr. Gaster's recent publications reveals a consistent focus on topological combinatorics, surface embeddings, and geometric group theory. His work bridges discrete mathematics with continuous geometric structures, particularly in the contexts of hyperbolic geometry and curve complexes. He leads the Topology Research Group at UWM, fostering collaborative investigations into fundamental questions in geometric topology and discrete mathematics.

Hemanshu Kaulمشاهده پروفایل

دانشیار

• Discrete Mathematics
• Operations Research
• Graph Theory
• +۵ مورد دیگر

Hemanshu Kaul is an Associate Professor of Applied Mathematics at Illinois Institute of Technology (IIT), part of the College of Computing. He serves as Co-Director of the M.S. in Computational Decision Science and Operations Research (CDSOR) program. His expertise spans Discrete Mathematics, Operations Research, Graph Theory, and Network Optimization, with applications in transportation, computer science, and engineering. Education: PhD in Mathematics from the University of Illinois at Urbana-Champaign (UIUC), MS in Mathematics from the Indian Institute of Technology Bombay. He has held roles including Distinguished Teaching Fellow (2016–2018) and AMS Project NExT Fellow (2007–2008). Research Interests : Focus on Graph Packing, DP-coloring, List Coloring, and algorithmic solutions for discrete optimization problems. His work bridges theoretical foundations with practical applications such as transportation networks and computer science systems. Publications & Grants : Over 50 publications in combinatorics and optimization, including NSF/NSA-funded projects like the EXCILL III Conference (2016–17). Recent work explores spectral Turán problems, DP-coloring algorithms, and longitudinal network models. Awards : Board of Trustees Award for Excellence in Teaching (2019) Excellence in Teaching Award (2017, College of Science, IIT) Interdisciplinary Research Grant (2009–2010, Transportation Networks) Advising & Leadership : Co-advisor for IIT's SIAM Student Chapter. Led restructuring of the Applied Math M.Sc. program (2018–19). Advised teams in the Mathematical Contest in Modeling (MCM), including a 2019 Meritorious Winner team for a disaster response system design. Labs & Collaborations : Involved in interdisciplinary projects combining applied math with computer science and engineering, including work on equitable public transit systems and network optimization.

Roland Bauerschmidtمشاهده پروفایل

استاد

• Probability Theory
• Mathematical Physics
• Statistical Mechanics
• +۵ مورد دیگر

Roland Bauerschmidt is a Professor of Mathematics at the Courant Institute of Mathematical Sciences, New York University. He previously held a professorship at the University of Cambridge and conducted postdoctoral research at Harvard and the Institute for Advanced Study. His research focuses on probability theory, mathematical physics, and statistical mechanics, particularly in spin systems, renormalization group methods, stochastic dynamics, and random matrices. He has contributed extensively to understanding phase transitions, critical phenomena, and universality classes. Education: PhD from the University of British Columbia (advised by David Brydges and others), undergraduate degrees from ETH Zurich. Research interests include applications of supersymmetry in probability, Coulomb systems, and log-Sobolev inequalities. He has organized programs such as the HIM Trimester Program on Probabilistic Methods in Quantum Field Theory. His teaching spans graduate and undergraduate courses in probability theory, stochastic dynamics, and mathematical analysis at NYU, Cambridge, and international institutions. His work frequently intersects with renormalization group techniques, spectral gaps, and non-equilibrium dynamics. Recent publications explore log-Sobolev inequalities in spin systems, high-temperature discrete Gaussian models, and percolation transitions in random forests.

Joy Morrisمشاهده پروفایل

استاد

• Combinatorics
• Algebraic Graph Theory
• Group Theory
• +۴ مورد دیگر

Joy Morris is a Professor at the Department of Mathematics & Computer Science at the University of Lethbridge. She earned her BSc from Trent University in 1992 and her PhD from Simon Fraser University in 2000 under Brian Alspach. Her academic journey includes tenure in 2005, promotion to Associate Professor, and full Professor status in 2015. Research Focus: Interactions between group theory and graph theory, with emphasis on Cayley graphs and automorphisms Key Contributions: Solving the distinguishing number problem for various graph families, advancing DCI/CI group theory Research Overview Her work bridges abstract algebra with graph theory through Cayley graphs. She investigates automorphism groups, Hamilton cycles, and graph symmetry properties. Notable contributions include resolving the DCI property for specific groups, analyzing Praeger-Xu graphs, and studying color-preserving automorphisms. Academic Leadership As a co-author of two influential open-access textbooks ( Proofs and Concepts with Dave Morris and her own Combinatorics text), she has shaped curriculum development and mathematical education outreach programs for parents in Alberta. Her teaching portfolio includes foundational courses like Math 2000 and advanced combinatorial theory instruction. Collaborative Impact With over 30 publications since 1996, her collaborations span international researchers including C. Praeger, P. Spiga, and E. Dobson. Current projects involve hypercube distinguishing costs and automorphism group analysis of vertex-transitive digraphs. She maintains active research into graphical regular representations and graph isomorphism problems.

• Discrete Mathematics
• Probability
• Theoretical Computer Science
• +۶ مورد دیگر

Prasad Tetali is a Regents' Professor at the Georgia Institute of Technology , with appointments in both the School of Mathematics and the School of Computer Science . He also holds an adjunct professor position at Emory University's Mathematics and Computer Science departments. Education: PhD in Mathematics (1991) from the Courant Institute of Mathematical Sciences at NYU; MS in Mathematics (1987) from the Indian Institute of Science; Postdoc at AT&T Bell Labs His research spans Discrete Mathematics, Probability Theory, and Theoretical Computer Science , focusing on Markov chains, Isoperimetry, Combinatorics, Computational number theory, and Algorithms. Recent work includes applications to statistical physics models and hypergraph structures. He has served as Director of the ACO Ph.D. Program since 2019 and held leadership roles like Interim Chair of the School of Mathematics. His publications reflect a blend of discrete geometry, stochastic processes, and algorithmic analysis . Key Honors: AMS Fellow (2012) SIAM Fellow (2009)

Roie Levinمشاهده پروفایل

استادیار

• Approximation Algorithms
• Online Algorithms
• Submodular Functions
• +۵ مورد دیگر

Roie Levin is an Assistant Professor at Rutgers University's Department of Computer Science. He received his PhD in Algorithms, Combinatorics and Optimization from Carnegie Mellon University in 2022, advised by Anupam Gupta. Prior to that, he worked at the Allen Institute for Artificial Intelligence (2015-2017) and earned dual BSc degrees in Computer Science/Applied Mathematics and Mathematics from Brown University (2015). Before joining Rutgers, he was a Fulbright Postdoctoral Fellow at Tel Aviv University under Niv Buchbinder. Current Role: Assistant Professor in Computer Science Academic Training: PhD (2022) CMU, BSc (2015) Brown University Postdoctoral: Fulbright Fellow at Tel Aviv University Levin's research focuses on approximation algorithms for uncertain environments (online/dynamic/streaming models) and submodular function optimization. His work spans theoretical foundations and practical implementations across distributed systems, geometric constraints, and reinforcement learning paradigms. Teaching includes graduate and undergraduate algorithms courses (CS 344, CS 513) with emphasis on problem-solving techniques, computational complexity, and modern algorithmic trends. His publications showcase expertise in online algorithms, submodular optimization, and approximation theory with applications in clustering, caching, and machine learning. The 2025 articles demonstrate continued exploration of online consistency and contention resolution, while 2023-2024 works focus on submodular optimization under uncertainty and dynamic environments. Earlier publications (2015-2017) cover semantic parsing, geometric approximation, and planar graph optimization. Fulbright Postdoctoral Fellow Levin's research connects theoretical guarantees with practical implementations, bridging classical algorithm design with modern machine learning applications. His recent work explores primal-dual methods in online settings and robust subspace approximation techniques for streaming data environments.

Irène Marcoviciمشاهده پروفایل

استاد

• Probability Theory
• Dynamical Systems
• Cellular Automata
• +۴ مورد دیگر

Irène Marcovici is a Professor in the Department of Mathematics at the University of Rouen Normandy, affiliated with the Raphaël Salem Mathematics Laboratory (LMRS). She leads the Probability and Dynamical Systems team within LMRS and participates in the ALEA and SDA2 working groups of the GDR Informatique Fondamentale et ses Mathématiques. PhD in Mathematics (2013, University of Paris Diderot) Habilitation à Diriger des Recherches (2021, University of Lorraine) Her research focuses on probability theory , dynamical systems , and cellular automata , with significant contributions to percolation theory, self-organization phenomena, and combinatorics on words. She investigates how randomness influences complex systems, particularly through probabilistic cellular automata and their ergodic properties. Analysis of her recent publications (2021-2025) reveals a strong emphasis on percolation dynamics (e.g., corner percolation with directional bias), self-stabilization mechanisms in cellular systems, and combinatorial structures like Kolakoski sequences. Her work bridges theoretical computer science and pure mathematics, often employing stochastic methods to solve problems in symbolic dynamics and discrete geometry. Supervision & Collaborations: Currently supervising Maxence Poutrel (with Jérôme Casse) Previously supervised Pierrick Siest (2021-2024), Jocelyn Begeot (now Associate Professor), and Pierre-Adrien Tahay (now PRAG at Telecom Nancy) Regular collaborations with Régine Marchand, Nazim Fatès, and Pascal Moyal Laboratory Context: As leader of the Probability and Dynamical Systems team at LMRS, she contributes to France's national research infrastructure in fundamental mathematics, with connections to CNRS and international working groups focused on automata theory and discrete probability.

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

Lluis Vena Cros is a distinguished researcher in the Department of Mathematics at Universitat Politècnica de Catalunya - BarcelonaTech (UPC-BarcelonaTech), affiliated with the Faculty of Mathematics and Statistics. He is a core member of the GAPCOMB research group, which specializes in Geometric, Algebraic and Probabilistic Combinatorics. His research spans multiple domains within combinatorics, with particular emphasis on graph theory, algebraic combinatorics, geometric combinatorics, and probabilistic combinatorics. Vena Cros has made significant theoretical contributions to the understanding of graph homomorphisms, Tutte polynomials, Ramsey theory, and extremal combinatorial structures. His work often explores the deep connections between combinatorial objects and other mathematical disciplines such as topology, algebra, and discrete geometry. An analysis of his recent publications reveals a consistent focus on combinatorial structures with applications across multiple mathematical domains. His work on Tutte polynomials for various graph structures demonstrates a unifying approach to graph invariants, while his research in Ramsey theory explores structural properties of large combinatorial objects. The recurring theme across his publications is the investigation of extremal properties and computational aspects of combinatorial configurations. Vena Cros actively participates in multiple research projects including 'Structure, Randomness and Computational Methods in Extremal Combinatorics,' 'COntemporary COmbinatorics and Applications (COCOA),' and the 'Grup GAPCOMB de la UPC.' These projects involve collaborations with numerous researchers across Spain and internationally, reflecting his significant standing in the combinatorial mathematics community. His work has been supported by various funding bodies including the Spanish State Research Agency and the European Union's Horizon 2020 program. As a member of the GAPCOMB research group, Vena Cros contributes to a vibrant mathematical community focused on advancing combinatorial theory and its applications. The group maintains strong connections with other research centers and regularly participates in international conferences and collaborative projects, fostering the exchange of ideas across the global combinatorial mathematics community.