Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.
Professor Jelena Grbic is a distinguished mathematician serving as Professor of Mathematics within the School of Mathematical Sciences at the University of Southampton since 2012. Her academic journey began with a B.Sc. in Mathematics from the University of Belgrade, Serbia in 1997, followed by a Ph.D. in Algebraic Topology from the University of Aberdeen in 2004. Prior to her current position, she held academic appointments at the University of Manchester (2007-2012) as Lecturer and Senior Lecturer, and at the University of Aberdeen (2004-2006) as Lecturer. Professor Grbic's research spans multiple interconnected domains of pure mathematics, with a primary focus on modern homotopy theory, particularly unstable homotopy theory, and its applications across topology, algebra, and geometry. Her work centers on decompositions and exponent problems in homotopy theory, homotopy aspects of Toric Topology, Hopf algebras, and geometric problems related to cobordisms and string topology. This research bridges abstract mathematical theory with potential applications in data science and computational topology. Analysis of her recent publications (2020-2025) reveals a consistent research trajectory in algebraic topology with increasing interdisciplinary connections. Her work demonstrates sophisticated mathematical techniques applied to complex topological structures, particularly moment-angle complexes and polyhedral products. Notably, her 2022 paper 'Aspects of topological approaches for data science' indicates growing interest in applying topological methods to contemporary data analysis problems, suggesting an expanding research horizon beyond pure mathematics. Professor Grbic actively supervises PhD students, including current student Salvatore Elia in Mathematical Sciences, and teaches modules covering algebraic topology and homotopy theory. She serves as a reviewer for prestigious journals including Homology, Homotopy and Application (2019), Transactions of the London Mathematical Society (2021), and The LMS Newsletter (2017), contributing to the scholarly community through peer review and academic service.
Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.
Dr. Lucas Pahl is a Lecturer in Economics at the University of Sheffield, School of Economics since 2024. His research specializes in mathematical game theory, particularly in equilibrium refinements, fixed point theory, and real algebraic geometry. He holds a PhD in Economics from the University of Rochester, an MSc in Mathematics from IMPA (Brazil), and a BSc in Social Sciences from the University of São Paulo. Previous positions: Postdoctoral Scholar at Hausdorff Institute for Mathematics and Institute for Microeconomics, University of Bonn His research interests include advanced topics like fixed point theory applications in game theory, algebraic topology intersections with economic models, and equilibrium refinement methodologies. Recent work explores information spillover in zero-sum games and polytope-form game structures. Key publications focus on O’Neill’s theorem extensions, sustainable equilibria analysis, and finite characterizations of perfect equilibria. He serves as a reviewer for top journals including Econometrica and Games and Economic Behavior. No scientific awards explicitly mentioned. His advisory and grant activities remain unspecified in current records. Labs/teams: No lab affiliations explicitly stated in provided information.
Laura Anderson is an Associate Professor in the Department of Mathematics at Binghamton University. She holds a Ph.D. from MIT (1994) and has been affiliated with Binghamton since 2001. Her research focuses on Combinatorics and Topology, with a specialization in matroid theory, hyperplane transversals, and topological combinatorics. She teaches advanced courses such as Introduction to Combinatorics (Math 511) and Discrete Mathematics (Math 314). Her academic contributions include groundbreaking work on oriented matroids, combinatorial Grassmannians, and hyperfield applications. Anderson has advised multiple Ph.D. students, including Olakunle Abawonse, Ulysses Alvarez, and Leandro Junes, whose theses explore topics like matroid extensions and tropical phased matroids. She actively participates in academic conferences, co-organizing the Binghamton University Graduate Conference in Algebra and Topology (BUGCAT). Anderson’s research integrates algebraic topology with discrete mathematics, addressing geometric realizations, hyperfield structures, and topological invariants. Her pedagogical innovations include experimenting with flipped classroom methods in calculus education. She maintains an active presence in academic service, contributing to journal reviews and editorial work in combinatorial geometry.
David Perkinson is a Professor of Mathematics at Reed College, where he holds a position in the Department of Mathematics. His research focuses on combinatorics, algebraic geometry, and discrete mathematics, with a particular emphasis on sandpile models, graph theory, and matroid theory. He is the author of the textbook *Divisors and Sandpiles: An Introduction to Chip-Firing*, which explores the combinatorial theory of chip-firing on graphs. Perkinson has also developed software tools like the Sandpile Java App, which visualizes and analyzes the Abelian Sandpile Model. He organizes the Cascade Lectures in Combinatorics (CALICO), a series of conferences funded by the National Science Foundation, aimed at fostering collaboration among researchers in combinatorics. His work bridges discrete mathematics with algebraic geometry, emphasizing connections between graph theory and geometric structures. Perkinson teaches advanced courses in analysis and contributes to the academic community through his research on topics such as divisor theory on graphs, sandpile groups, and combinatorial game theory. His recent publications (2015–2024) address matroid theory, sandpile dynamics, and applications of algebraic methods to discrete systems.
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.
Thomas Lam is a professor of mathematics at the University of Michigan , specializing in algebraic combinatorics, total positivity, and connections to mathematical physics. His work bridges cluster algebras, positive geometry, and integrable systems, with applications to scattering amplitudes in quantum field theory. Lam has collaborated extensively with physicists such as Nima Arkani-Hamed and mathematicians like Pavlo Pylyavskyy and Mark Shimozono. Key research areas: Cluster algebras, total positivity, electrical networks, positroid varieties, and quantum cohomology. Notable contributions: Defining polypositroids, proving regularity theorems for totally nonnegative flag varieties, and establishing cluster structures in braid varieties. Recent work focuses on positive geometries , including the amplituhedron and moduli spaces of points on projective lines, with implications for particle physics. His articles often explore dual graded graphs, K-theoretic Schubert calculus, and the interplay between combinatorics and algebraic structures. Lam's research has been supported by NSF grants, including DMS-0748636 and DMS-1249708 .
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.
Massachusetts Institute of TechnologyUnited States
Gabriele Farina is an Assistant Professor at MIT in the Department of Electrical Engineering and Computer Science (EECS) and the Laboratory for Information and Decision Systems (LIDS), with additional affiliations at the Operations Research Center (ORC). Holding the X-Window Consortium Career Development Chair, his research focuses on theoretical and algorithmic foundations for learning and computational decision-making under imperfect information, integrating game theory, machine learning, optimization, and statistics. He previously served as a Research Scientist at Meta's Fundamental AI Research (FAIR) group, where he contributed to Cicero, a human-level AI agent combining strategic reasoning and natural language. Ph.D. in Computer Science from Carnegie Mellon University (advisor: Tuomas Sandholm) Facebook Fellowship (2019-2020) in Economics and Computation Recipient of multiple awards including ACM SIGecom dissertation award, NSF CAREER, and AI2050 Early Career Fellow His research spans four key areas: (1) No-Regret Learning Dynamics in extensive-form games; (2) Correlation and Mediated Equilibria in sequential decision-making; (3) Team Games and Team Max-Min Equilibria; and (4) Human Modeling and Equilibrium Perfection. His work addresses challenges in scalable equilibrium computation, stability of learning algorithms, and robustness to mistakes in multi-agent systems. Recent publications highlight advancements in polynomial-time equilibrium computation, cautious optimism algorithms, and connections between regret minimization and mirror descent. These contributions appear in top venues like COLT, NeurIPS, ICML, and AAAI, with keywords spanning game theory, optimization, and machine learning. NSF CAREER award AI2050 Early Career Fellow Facebook Fellowship ACM SIGecom dissertation award GameSec 2024 best paper award ICLR 2023 outstanding paper honorable mention His research group at MIT collaborates on projects involving strategic reasoning, human-level AI agents, and equilibrium refinements, with applications to games like Diplomacy and poker. Current efforts include developing faster algorithms for correlated equilibria and exploring connections between machine learning and economic theory.
Swiss Federal Institute of Technology in LausanneSwitzerland
Varun Jog is Professor of Information Theory and Statistics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS) at the University of Cambridge, Faculty of Mathematics. Previously, he served as Assistant Professor at the University of Wisconsin-Madison (2016-2020) and at the University of Cambridge (2021-2024). His academic background includes a B.Tech. in Electrical Engineering from IIT Bombay (2010) and a Ph.D. in Electrical Engineering and Computer Sciences from UC Berkeley (2015). Professor Jog's research centers on fundamental questions at the intersection of information theory, statistics, and machine learning. He develops theoretical frameworks for statistical inference under constraints such as limited communication and privacy requirements, with significant contributions to hypothesis testing, differential privacy, adversarial risk analysis, and information-theoretic inequalities. His work bridges abstract mathematical principles with practical applications in data science and robust machine learning. Recent publications demonstrate a concentrated focus on distributed inference systems, particularly examining sample complexity limits in hypothesis testing under information constraints and privacy-preserving mechanisms. His research consistently reveals deep connections between information theory and statistical learning, with increasing emphasis on adversarial robustness and foundational inequalities. His scientific contributions have earned recognition through prestigious awards: NSF-CAREER Award (2020) R. Narasimhan Memorial Lecture Award (2020) Eli Jury Award from UC Berkeley EECS Department (2015) Jack Keil Wolf student paper award at ISIT (2015) Professor Jog maintains an active research group, currently supervising one PhD student while having graduated four PhD students and four Master's students. His mentorship extends to postdoctoral researchers including Amir Asadi, Deepanshu Vasal, and Andre Wibisono. Research funding includes the competitive NSF-CAREER grant. He co-organizes the Cambridge Information Theory Seminar, fostering academic exchange and collaboration within the theoretical research community.
Prof. Dr. Tobias Dyckerhoff is a Professor of Mathematics at the University of Hamburg , specializing in Higher Structures in Algebra and Geometry . He is affiliated with the Cluster of Excellence "Quantum Universe" and the Center for Mathematical Physics . His academic career includes positions at the University of Bonn, University of Oxford, Yale University, and the University of Pennsylvania. Research Interests : Higher category theory, homological algebra, perverse sheaves, Fukaya categories, and applications to symplectic geometry and quantum topology. Editorial Roles : Managing Editor of Abhandlungen aus dem mathematischen Seminar der Universität Hamburg (since 2023) and Editor of Applied Categorical Structures (since 2023). Publications & Articles focus on advanced topics like stable ∞-categories, spherical functors, and Calabi-Yau structures. Notable trends include interconnections between algebraic topology, category theory, and symplectic geometry. Scientific Awards : Bonn Junior Fellow (2014–2018) Titchmarsh Postdoctoral Fellow (2013–2014) Simons Postdoctoral Fellow (2010–2013) Students & Collaborations : Mentors active researchers like Angus Rush, Till Heine, and Jonte Gödicke. Collaborates with institutions such as MPI Bonn and international experts in higher structures.
David Eppstein is a Distinguished Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He holds academic leadership roles as director of the Center for Algorithms and Theory of Computation and associate director of the Center for Algorithms, Combinatorics, and Optimization. His research focuses on graph algorithms, computational geometry, discrete mathematics, and geometric graph theory. Eppstein earned a B.S. in Mathematics from Stanford University (1984) and a Ph.D. in Computer Science from Columbia University (1989). Research Interests: Graph drawing, information visualization, dynamic graph algorithms, mesh generation, optimal triangulation, K-shortest paths, subgraph isomorphism, data depth, exponential-time algorithms for NP-hard problems. Awards: ACM Fellow (2012), AAAS Fellow (2017), Distinguished Professor (2020), Best Paper Awards (2023, 2022), and SIAM recognition. Grants: Co-PI on a $1.2M NSF grant (2022) for geometric graph research, and previous NSF grants for algorithm studies (2016). His work bridges theoretical computer science and practical applications, including contributions to graph visualization, geometric algorithms, and combinatorial optimization. Notable recent achievements include resolving open questions in graph biplanarity and authoring the book Forbidden Configurations in Discrete Geometry (2018).
Professor Paul Goulart is a full Professor of Engineering Science at the University of Oxford and Tutorial Fellow at St Edmund Hall, positions he has held since 2014. He leads research and teaching in robust optimization, control systems, and high-speed numerical methods, with applications spanning fluid flows, traffic networks, and economics. Education SB & MSc, Aeronautics and Astronautics – Massachusetts Institute of Technology (MIT) PhD, Control Engineering – University of Cambridge (Gates Scholar, 2007) Research Interests Professor Goulart’s work lies at the intersection of control engineering and optimization . His core expertise includes: Robust and high-speed convex optimization Model predictive control (MPC) and control barrier functions Neural-network-based control and system identification Optimization over traffic and economic networks Real-time and embedded optimization solvers These interests are reflected in prolific publication output and active supervision of doctoral researchers. Publications & Trends From 2020 to 2025 Professor Goulart has co-authored more than thirty papers. A dominant theme is the development of fast, reliable algorithms for conic optimization and robust control , often leveraging machine-learning techniques to enhance scalability and real-time performance. Recent works emphasize safety certificates, GPU-accelerated solvers, and neural-network controllers for uncertain systems. Awards & Honors Gates Cambridge Scholar (2003) Advising & Grants Professor Goulart actively seeks DPhil students in control engineering and optimization . He leads the Control Group within the Department of Engineering Science and has been involved in multiple industrially funded projects, although specific grant identifiers are not provided in the supplied text. Laboratory & Teams He is a member of the Control Group , Department of Engineering Science, University of Oxford, and serves as Secretary to the Governing Body of St Edmund Hall (Michaelmas Term 2024).
Calin Belta is the Brendan Iribe Endowed Professor of Electrical and Computer Engineering and Computer Science at the University of Maryland, College Park. He is affiliated with the Institute of Systems Research (ISR) and the Maryland Robotics Center (MRC), and holds a Research Professor position at Boston University's College of Engineering. His work bridges control theory, formal methods, and machine learning to ensure safety in cyber-physical and data-driven systems, with applications in robotics, autonomous driving, and systems biology. Research Interests: Focus on dynamics and control theory, formal methods for verification and control synthesis, robotics, autonomous systems, and synthetic biology. Recent projects include PROGENIC (collaborating with MIT, UChicago, and UDelaware) and safety-critical control for heterogeneous robotic teams. Key Achievements: General Chair of the 2025 MRC Symposium, recipient of AFOSR Young Investigator Award (2008), NSF CAREER Award (2005), and IEEE Fellow. His work on formal methods for autonomous systems has led to impactful tools for safety assurance in robotics and AI. Grants: NSF EFRI PROGENIC grant (2024), multiple industry partnerships. Advising: Mentored students like Wenliang Liu (PhD 2024, now at Amazon), and collaborator Marius Kloetzer (shared HSCC Test of Time Award 2025). Labs/Teams: Maryland Robotics Center, Institute for Systems Research, and Boston University collaborations.
