Brett Kolesnik is a Research Fellow in the Department of Statistics at the University of Warwick. His research focuses on probability theory, random structures, bootstrap percolation, and interactions with combinatorics. He has held postdoctoral fellowships at UC Berkeley, San Diego, and the University of Oxford, and was a Senior Demy at Magdalen College. His work includes organizing workshops on bootstrap percolation and collaborating with leading researchers in probability and combinatorics. Education: PhD in Mathematics from the University of British Columbia (advised by Omer Angel). Notable awards include the NSERC Postdoctoral Fellowship and the Florence Nightingale Bicentennial Fellowship in Statistics. Research interests span bootstrap percolation models, random graph dynamics, and stochastic processes. Recent work includes studies on Brownian map geometry, tournament score sequences, and Coxeter group structures. Selected articles explore topics such as critical beta-splitting processes, Catalan percolation, and random walks on algebraic structures. His publications appear in top journals like Electronic Journal of Probability and Annals of Applied Probability . Awards include the Florence Nightingale Fellowship and NSERC Postdoctoral Fellowship. Professional involvement includes organizing the 2024 BIRS workshop on Bootstrap Percolation and contributing to interdisciplinary collaborations in probability and combinatorics.
Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.
Raphael Hauser is an Associate Professor in Numerical Mathematics at the University of Oxford's Mathematical Institute, Director of Graduate Studies - Teaching, and Tanaka Fellow in Applied Mathematics at Pembroke College. His affiliations include membership in the Data Science, Numerical Analysis, and Mathematical and Computational Finance research groups, as well as a fellowship at the Alan Turing Institute. Education: PhD in Operations Research, Cornell University, Ithaca, USA Dipl. Math. ETH, Swiss Federal Institute of Technology (ETH Zurich), Switzerland Research interests span data science, numerical optimisation, medical imaging, distributed computing, and applied probability/statistics. His work integrates mathematical rigor with practical applications, particularly in optimization algorithms, machine learning theory, and medical imaging technology. Publications focus on optimization theory, stochastic processes, medical imaging systems, and computational finance, with recurring themes in non-convex optimization guarantees, PCA variants, and X-ray tomography innovations. Awards: Oxford University Teaching Award (2007) SIAM Optimization Prize (2005) SIAM Student Paper Prize (2000) Advising includes 15+ DPhil students and 40+ MSc students, with projects in optimization, finance, imaging, and machine learning. Current postdocs and students are affiliated with the Alan Turing Institute and industrial partners like Siemens and Macquarie Group. He leads teams in the Mathematical Institute's research groups and collaborates with the Alan Turing Institute on large-scale data science initiatives.
Tamara Broderick is an Associate Professor in the Department of Electrical Engineering and Computer Science at MIT, specializing in machine learning and statistics. Her research focuses on developing methods for uncertainty quantification in data analysis, Bayesian nonparametrics, and scalable inference algorithms. She leads a research group advising PhD students and postdocs in statistical machine learning. Her work spans Bayesian modeling, variational inference, spatial statistics, and applications in epidemiology and environmental science. Recent projects involve uncertainty-aware forecasting, robustness analysis of statistical methods, and efficient algorithms for high-dimensional inference. Broderick teaches Bayesian Modeling and Inference and contributes to MIT's statistics and data science initiatives.
Chaitanya Swamy is a Professor and University Research Chair in the Department of Combinatorics & Optimization at the University of Waterloo, Canada. His primary affiliation is within the Faculty of Mathematics, and he holds positions in both the Department of Combinatorics & Optimization and the School of Computer Science. He obtained his Ph.D. in Computer Science from Cornell University under the supervision of David Shmoys, followed by postdoctoral research at Caltech's Center for the Mathematics of Information. Swamy’s research focuses on algorithms, particularly in combinatorial optimization, approximation algorithms, algorithmic game theory, stochastic optimization, network design, scheduling, and online algorithms. His work spans theoretical contributions and practical applications, including algorithm design for facility location, network routing, and mechanism design. He has contributed to foundational results in approximation algorithms, such as the development of primal-dual methods and LP-rounding techniques. Swamy has held significant editorial roles, including as an associate editor for Discrete Optimization and SIAM Journal on Computing . He has organized major conferences like CanaDAM 2021 and sessions at ISMP 2018. His teaching record includes courses on combinatorial optimization, scheduling, and algorithmic game theory. He has advised numerous Ph.D. and Master’s students, many of whom have gone on to prestigious academic and industry positions. Swamy’s research has been recognized through awards for his students, including the University of Waterloo Alumni Gold Medal. He actively contributes to the academic community through committee work for conferences like STOC, APPROX, and SODA, and his publications reflect a deep engagement with both theoretical and applied aspects of algorithms and optimization.
Salim ROSTAMI is an Associate Professor at the IÉSEG School of Management in France, specializing in Operations Management. He holds a Ph.D. in Economics and Mathematics Sciences from KU Leuven (2019) and a Master’s in Engineering from KU Leuven (2013), alongside a Bachelor’s in Industrial Engineering from Ferdowsi University of Mashhad (2012). His research focuses on scheduling under uncertainty, project planning, combinatorial optimization, and healthcare logistics. Notable achievements include the 2016 2nd Best Conference Paper Award from the University of Valencia. Education: Ph.D., Economics and Mathematics Sciences, Operations Management, KU Leuven, Belgium (2019) Master, Engineering, Operations Research, KU Leuven, Belgium (2013) Bachelor, Engineering, Industrial Engineering, Ferdowsi University of Mashhad, Iran (2012) His work spans stochastic resource-constrained project scheduling, sequential testing of systems, and chemotherapy appointment scheduling. He has published widely in journals like the European Journal of Operational Research and Flexible Services and Manufacturing Journal. Teaching roles include courses on operations management and project management across undergraduate and graduate programs. Awards: 2016: 2nd Best Conference Paper Award, University of Valencia His research emphasizes practical applications in healthcare and project management, leveraging dynamic programming and metaheuristic algorithms. Collaborations include work with institutions like École des Mines de Saint-Étienne and KU Leuven.
Neil Olver is an Associate Professor in the Department of Mathematics at the London School of Economics and Political Science (LSE), where he has held his current position since 2021. He is also affiliated with CWI in Amsterdam. His research focuses on combinatorial optimization, network design, algorithmic game theory, and probability, with applications to traffic networks and robust optimization. Olver has organized major events such as the Highlights of Algorithms conference and the Hausdorff Trimester Program on Discrete Optimization. He completed his PhD in Applied Mathematics at McGill University (2010), preceded by an MSc (2006) and BSc (2004) from the University of Cape Town and McGill University. His academic career includes roles at Vrije Universiteit Amsterdam (2013–2021) and MIT (2010–2013). Olver has been awarded grants from NWO (VIDI, TOP, VENI) and the NSF, supporting research on network optimization and robust design. His notable contributions include resolving the VPN Conjecture, advancing strongly polynomial algorithms for generalized flows, and analyzing dynamic traffic equilibria. Students advised include Dr. Dario Frascara and Dr. Madelon de Kemp. Current grants include a VIDI-funded project on 'Usable Algorithms for Network Design.'
Dr. Dmytro Matsypura is an Associate Professor in the Discipline of Business Analytics at the University of Sydney Business School. He holds a BA (Hons) from Kyiv Polytechnic Institute (KPI), an MS (Hons) from KPI, and a PhD from the University of Massachusetts Amherst. His research focuses on optimization methodologies, network science, and their applications in finance, transportation, ecology, and graph theory. He is a recipient of multiple teaching awards, including the Wayne Lonergan Outstanding Teaching Award (Early Career) in 2010. Education: PhD in Management Science, University of Massachusetts Amherst (2006) MS (Hons) in Information Systems, Kyiv Polytechnic Institute (2000) BA (Hons) in Business Administration, Kyiv Polytechnic Institute (1998) Research Interests: Dr. Matsypura’s work spans operations research and management science, with a focus on mathematical optimization and network science. His methodological contributions include developing efficient optimization algorithms, while his applied research addresses real-world challenges in finance, engineering, and ecology. Notable applications include wildfire fuel management, portfolio margining, and credit card fraud detection via graph-based models. Awards and Recognition: Teaching Excellence Award (2008, 2013, 2018) Wayne Lonergan Outstanding Teaching Award (Early Career) (2010) Grants and Projects: Current projects include Bushfire Analytics: Optimization of Fuel Reduction (2023, ARC Discovery Project). His research frequently integrates interdisciplinary collaborations, such as applying graph theory to biomedical problems and cybersecurity. Labs/Teams: Active in the Sydney Environment Institute, contributing to projects at the intersection of analytics and sustainability. Collaborates with industry on fraud detection and supply chain optimization.
Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.
Paata Ivanisvili is an Associate Professor at the University of California, Irvine (UCI), Department of Mathematics, School of Physical Sciences. His research focuses on Analysis, Probability, Harmonic Analysis, and Functional Analysis, with a particular emphasis on isoperimetric inequalities, functional inequalities, and discrete structures such as the Hamming cube. He has held visiting positions at institutions including the Hausdorff Research Institute for Mathematics and Princeton University. Ivanisvili has organized conferences such as the Dual Trimester Program at the Hausdorff Institute on Boolean Analysis in Computer Science (2024) and annual Summer/Fall Schools since 2021. He earned his PhD in Mathematics from Michigan State University (2015) and a BS from Saint Petersburg State University (2011). His research interests include sharp inequalities in analysis (e.g., Poincaré, Beckner, Ehrhard), hypercontractivity, and applications to discrete mathematics and probability. He has collaborated with prominent mathematicians such as Fedor Nazarov, Alexander Volberg, and Roman Vershynin. Notable awards include the NSF CAREER Award (2021–2025) and Simons Fellowship in Mathematics (2025–2026). Ivanisvili’s recent work explores the interface between harmonic analysis and discrete mathematics, including studies on additive energies, convex hulls of space curves, and learning theory. His articles frequently address foundational questions in geometric functional analysis, often using tools like Bellman functions and optimal control theory. He actively advises PhD students and has mentored visiting researchers at UCI.
Ola Svensson is an Associate Professor at the School of Computer and Communication Sciences , EPFL. His research spans approximation algorithms, combinatorial optimization, computational complexity, and scheduling. He holds an ERC Consolidator Grant (2023–) and previously received an ERC Starting Grant (2014–2019) and SNF grant (2019–2023). Education: PhD in Computer Science from IDSIA, Università della Svizzera italiana (2009) M.Sc. from Uppsala University (2005) Research Focus: Svensson develops novel techniques for NP-hard problems, with emphasis on primal-dual methods, LP/SDP hierarchies, and hardness proofs. His work applies to clustering, scheduling, network design, and submodular optimization. Publications: His 15 most recent works (2018–2021) focus on learning-augmented algorithms, robust optimization, and improved approximations for clustering/TSP. Key trends include integration of ML with classical algorithms and quasi-polynomial methods for combinatorial problems. Awards: Best Paper Awards at FOCS (2011, 2017) and STOC (2018) I&C Teaching Award at EPFL Advising & Grants: He advises 6 current PhD students and graduated 8 others. Major grants include ERC Starting Grant 'OptApprox' (€1.4M) and ERC Consolidator Grant 'POTCO' (€2M). Teaching: Leads courses in Advanced Algorithms, Computational Complexity, and Approximation Algorithms. He developed pedagogical frameworks for scribe notes and project-based learning in theoretical computer science.
J. Cole Smith is the Dean of the College of Engineering and Computer Science at Syracuse University and holds the academic rank of Professor. He joined Syracuse in 2019 with a focus on advancing undergraduate and graduate education, research initiatives, and diversity, equity, and inclusion efforts. Previously, he earned a PhD in Industrial and Systems Engineering from Virginia Tech (2000) and a BS in Mathematical Sciences from Clemson University (1996). His research focuses on mathematical optimization, particularly mixed-integer programming and combinatorial optimization, with applications in network interdiction, logistics, national security, healthcare, and sports. His work has been supported by agencies such as the National Science Foundation, Office of Naval Research, and Defense Advanced Research Projects Agency. Recent research trends emphasize network interdiction under uncertainty, bilevel optimization, and large-scale optimization challenges. His publications in top journals like Operations Research and Mathematical Programming reflect these themes. Awards include INFORMS Fellow (2023) and recognition from Virginia Tech's Grado Department of Industrial and Systems Engineering. While his dean duties reduce direct research involvement, he remains active through collaboration with PhD students. His team's work addresses real-world problems in security, logistics, and healthcare, leveraging advanced algorithmic techniques.
Huazheng Wang is an Assistant Professor in the School of Electrical Engineering and Computer Science at Oregon State University. His research focuses on reinforcement learning, information retrieval, and trustworthy AI. He received his Ph.D. from the University of Virginia (2021) and B.E. from the University of Science and Technology of China (2015). He holds awards including the 2025 EECS Fabulous Teacher Recognition and SIGIR 2019 Best Paper Award. His work addresses challenges in robust reinforcement learning, adversarial attacks on bandit systems, and applications in scientific discovery. Education: Ph.D., Computer Science, University of Virginia (2021) B.E., Computer Science and Technology, University of Science and Technology of China (2015) Research interests emphasize developing efficient algorithms for reinforcement learning, multi-armed bandits, and their applications in recommendation systems, protein optimization, and security. Notable contributions include provably efficient risk-aware reinforcement learning frameworks and adversarial attack analysis on bandit systems. Recent work includes NSF-funded research on neural bandits (IIS-2403401) and publications in top venues like ICML, NeurIPS, and AAAI. His lab explores embodied LLM agents for team cooperation and federated collaborative online monitoring frameworks.
Arpit Agarwal is an Assistant Professor in the Department of Computer Science & Engineering at the Indian Institute of Technology, Bombay. He previously held postdoctoral positions at FAIR Labs (Meta) working with Max Nickel and at the Data Science Institute at Columbia University hosted by Prof. Yash Kanoria and Prof. Tim Roughgarden. He completed his PhD from the Department of Computer & Information Science at the University of Pennsylvania under the guidance of Prof. Shivani Agarwal. His research focuses on the intersection of human behavior and machine learning systems, with particular interest in learning from implicit, strategic, and heterogeneous human feedback. His work spans multiple dimensions of human-AI interaction including understanding long-term dynamics between humans and AI systems, designing responsible AI, and studying misalignment between user preferences and system objectives. His research methodology often combines theoretical machine learning with practical applications in recommendation systems and social AI. His recent publications reveal a strong focus on bandit algorithms, preference learning, and recommendation systems, with increasing attention to responsible AI design and human-centered considerations. His work demonstrates expertise in theoretical machine learning with applications to real-world problems, particularly in understanding how humans interact with and are influenced by AI systems over time. Dr. Agarwal teaches advanced courses including CS767 Theoretical Machine Learning (Autumn 2025) and CS6103 Human-Centered AI: From Learning Models to Responsible Systems (Spring 2025), which covers topics such as AI alignment, learning from pairwise comparisons, crowdsourcing, human-in-the-loop decision making, recommendation systems, interpretability, privacy, fairness, causality, and AI governance.
Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.
