Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.
Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.
Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.
Prof. Dr. Michael Ulbrich is a full professor and Chair of Mathematical Optimization at the Technical University of Munich (TUM), within the School of Computation, Information and Technology. He has held this position since 2006 and previously served as Dean of Studies (2007–2010) and Vice Dean of the Faculty of Mathematics (2012–2015). His research focuses on nonlinear optimization, optimal control, and numerical analysis, with applications in fluid dynamics, shape optimization, and PDE-constrained systems. He leads projects in the DFG SPP 1962 and IGDK 1754, and has received prestigious awards including the Howard Rosenbrock Prize (2015) and the Doctoral Award from the TUM Association of Friends (1996). Ulbrich is Editor-in-Chief of Optimization and Engineering and contributes to multiple journals. His work bridges theoretical foundations and practical applications, including CO2 sequestration, fluid-structure interaction, and distributed optimization algorithms. Education: PhD (1996), Habilitation (2002) in Mathematics at TUM. Research stays at Rice University (USA) under DFG funding. Research Areas: Semismooth Newton methods, PDE-constrained optimization, optimal control of Navier-Stokes equations, and distributed parameter systems. Awards: Rosenbrock Prize, Teaching Excellence Awards, and recognition for doctoral work. Leadership Roles: Department Head of Mathematics (2022–), Member of TUM Senate (2019–2022), and Co-Chair of GAMM 2018. Ulbrich has authored influential textbooks like Semismooth Newton Methods for Variational Inequalities and Nichtlineare Optimierung . His recent projects include OptiGeoS (2024–2026) and collaborations on nonsmooth optimization and stochastic algorithms. His academic contributions span over 100 publications, emphasizing both algorithmic innovation and rigorous mathematical analysis.
Anders Rantzer is a Professor of Automatic Control at the Department of Control Engineering, Faculty of Engineering, Lund University, Sweden. He has held visiting positions at Caltech (2004–2005) and the University of Minnesota (2015–2016) as the Taylor Family Distinguished Visiting Professor. His academic journey began with a PhD from KTH Stockholm in 1991, followed by a postdoc at the Institute for Mathematics and its Applications (IMA), University of Minnesota. His research interests center on modeling, analysis, and synthesis of control systems , with a strong focus on scalability, adaptation, and applications in energy networks . He is particularly known for foundational work in positive systems and integral quadratic constraints (IQCs) . These theoretical frameworks are critical in analyzing stability and robustness of large-scale interconnected systems. His work bridges mathematical rigor with practical engineering applications, especially in sustainable energy and networked systems. The recent publications and lecture materials reflect a consistent trajectory in scalable and robust control, optimization, and distributed systems. Themes such as large-scale convex optimization , nonlinear and stochastic control , and network dynamics dominate his scholarly output, indicating a sustained commitment to advancing control theory for complex, real-world systems. Scientific honors include: Fellow of IEEE Member of the Royal Swedish Academy of Engineering Sciences (IVA) Chairman of the Swedish Scientific Council for Natural and Engineering Sciences Chairman of the Royal Physiographic Society of Lund Rantzer has supervised numerous students and contributed extensively to academic leadership and education. He has been involved in major national and international research initiatives such as WASP (Wallenberg AI, Autonomous Systems and Software Program) and ELLIIT. His work includes developing educational tools and courses in control, optimization, and machine learning. He leads and contributes to research projects on autonomous systems, cloud control, and smart energy networks. He is affiliated with the Control Lab at LTH and participates in collaborative efforts such as the Nordic University Hub on Industrial Internet of Things (HI2OT). His work integrates theoretical advances with practical implementations in robotics, biomedical systems, and industrial automation.
Dr. Iro Armeni is Assistant Professor of Civil and Environmental Engineering at Stanford University, leading the Gradient Spaces research group. Her interdisciplinary research bridges architecture, civil engineering, and computer vision to develop data-driven methods for sustainable and adaptive built environments. Professor Armeni's work focuses on creating gradient environments that blend physical and digital realities through mixed reality technologies. She develops computational methods for 3D scene understanding, generative design, and adaptive spaces that respond to human needs. Her research integrates AI with architectural design to improve sustainability, inclusivity, and reusability of built spaces. Current projects include 3D scene graph representations, automated BIM modeling from visual data, and neuro-symbolic approaches for design optimization. She has developed tools like HoloLabel (AR semantic labeling) and SemSpray (VR annotation) for construction information management. Professor Armeni holds a PhD from Stanford University, supported by a Google PhD Fellowship, and completed postdoctoral research at ETH Zurich with an ETH Fellowship. She teaches courses on Computer Vision for the Built Environment and Mixed Reality applications.
Stephen A. Vavasis is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo, part of the Faculty of Mathematics. He holds a PhD in Computer Science from Stanford University (1989) and has held academic positions at Cornell University (1989–2006) before joining Waterloo. His research focuses on continuous optimization, data science, first-order methods, scientific computing, and computational mechanics. Current teaching includes courses on convex optimization and portfolio optimization methods. He has served as Associate Dean of Computing (2017–2020) and Interim Director of Data Science graduate programs. His work is supported by NSERC grants. Notable awards include the Hertz Fellowship, Churchill Scholarship, and Guggenheim Fellowship. Vavasis's research emphasizes applications of optimization to clustering, machine learning, and fracture mechanics. His publications span convex optimization frameworks, algorithmic analysis of gradient methods, and numerical methods in mechanics. Recent work explores unifying analyses of first-order optimization algorithms and robust optimization techniques for high-dimensional data problems.
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).
Arkadi Nemirovski is the John P. Hunter, Jr. Chair and Professor at the H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech. He holds a Ph.D. in Mathematics (1974) from Moscow State University, a Doctor of Sciences in Mathematics (1990) from the USSR Supreme Attestation Board, and an honorary Doctor of Mathematics from the University of Waterloo (2009). Ph.D. in Mathematics, Moscow State University (1974) Doctor of Sciences in Mathematics, USSR Supreme Attestation Board (1990) Doctor of Mathematics (Honoris Causa), University of Waterloo (2009) His research focuses on Optimization Theory and Algorithms , with emphasis on complexity analysis, efficient methods for nonlinear convex programs, robust optimization, optimization under uncertainty, and applications in engineering and nonparametric statistics. He has pioneered advancements in interior-point methods, semidefinite programming, and stochastic approximation, shaping modern convex optimization. His article trends highlight a trajectory from foundational interior-point algorithms (1990s) to robust optimization (2000s) and recent works on first-order methods, polyhedral estimates, and applications in machine learning, signal processing, and tomography. Key subfields include matrix norms , large-scale optimization , and stochastic uncertainty handling . Scientific awards include: 1982 Fulkerson Prize (joint with L. Khachiyan and D. Yudin) 1991 Dantzig Prize (joint with M. Grotschel) 2003 John von Neumann Theory Prize (joint with M. Todd) 2017 Member, National Academy of Engineering 2018 Fellow, American Academy of Arts and Sciences 2020 Norbert Wiener Prize (joint with M. Berger) He has supervised students like Dmitry Gabelev (polynomial-time cutting plane algorithms), Daureen Steinberg (matrix norms in robust optimization), and Eitan Rubinstein (SVMs via advanced optimization), with their works later formalized in academic journals.
Yang P. Liu is an Assistant Professor in the Computer Science Department at Carnegie Mellon University's School of Computer Science. Previously, he was a Postdoctoral Member at the Institute for Advanced Study and earned his PhD from Stanford University under the supervision of Aaron Sidford. He completed his undergraduate studies at MIT, graduating in May 2018. His educational background includes: PhD in Computer Science, Stanford University (Advisor: Aaron Sidford) Bachelor's degree, Massachusetts Institute of Technology (graduated May 2018) Dr. Liu's research spans the intersection of mathematics and computer science, with particular focus on graph algorithms , optimization , high-dimensional geometry , and additive combinatorics . His work often develops novel algorithmic techniques that bridge theoretical insights with practical applications. He has made significant contributions to areas such as convex optimization, linear programming, and combinatorial problems. His teaching includes courses like "A Principled Approach to Optimization" (CS 15-759), which covers rigorous treatments of convex optimization topics including gradient descent, interior point methods, linear regression, linear programming, and sparsification. His extensive publication record in top-tier conferences (FOCS, STOC, SODA) demonstrates a consistent focus on developing almost-linear time algorithms for fundamental graph problems, optimization techniques, and combinatorial theorems. Recent work shows increasing emphasis on combinatorial lines, corners theorem, and k-CSP approximability, while maintaining strong connections to optimization theory and graph algorithms. Dr. Liu has received notable recognition for his work: National Defense Science and Engineering Graduate (NDSEG) Fellowship (2018-2021) Google PhD Fellowship (2022-2023) Best Paper award at FOCS 2022 for "Maximum Flow and Minimum-Cost Flow in Almost Linear Time" Best Student Paper at STOC 2021 for "Discrepancy Minimization via a Self-Balancing Walk" His research has been supported by prestigious fellowships including the NDSEG Fellowship and Google PhD Fellowship. His work on graph algorithms, optimization, and combinatorics involves collaborations with researchers across theoretical computer science and mathematics. His publications often involve co-authors from multiple institutions, suggesting active research collaborations across the field. Dr. Liu maintains an active research program with a focus on developing efficient algorithms for fundamental computational problems. His recent work continues to push the boundaries of what's computationally feasible in graph algorithms, optimization, and combinatorial mathematics, with particular emphasis on achieving almost-linear time complexity for challenging problems.
WEE Kwan Eng is a Senior Lecturer of Operations Management at the Lee Kong Chian School of Business, Singapore Management University (SMU), since 2012. He holds a Ph.D. in Operations Management from Purdue University (2000), an M.S. in Management from NUS (1995), and a B.S. in Mathematics (with Honors) from NUS (1993). His research focuses on pricing strategies, supply chain risk management, game-theoretic models, and queuing systems. He has received multiple teaching honors, including the Dean’s Teaching Honor List (2005–2011). His work spans theoretical and applied operations research, with notable contributions to inventory coordination in retail networks, newsvendor model extensions, and queuing-based manufacturing systems. He has published in top journals like Operations Research Letters and IIE Transactions. Awards: Frederick N. Andrews Fellowship (1995-1997), Dissertation Fellowship (1998-1999) Research Themes: Strategic inventory policies, supply chain coordination, and optimization under uncertainty
Andreas Grothey is a Senior Lecturer in the School of Mathematics at The University of Edinburgh, a position he has held since 2011. He completed his MSc in Numerical Algebra and Mathematical Computing at the University of Dundee (1995) and his PhD in Optimization at the University of Edinburgh (2001), supervised by Ken McKinnon. His research focuses on stochastic programming, interior point methods, decomposition approaches, high-performance computing, and energy systems optimization. He has contributed to energy planning, power grid reliability, and emergency response strategies for power networks. Grothey has advised seven PhD students, including work on unit commitment, top-percentile traffic routing, and power flow optimization. His projects include the OOPS solver, CESI energy integration center, and the Structured Modelling Language (SML). Recent work addresses pandemic policy optimization and exascale computational challenges. Education: MSc in Numerical Algebra and Mathematical Computing (University of Dundee, 1995) PhD in Optimization (University of Edinburgh, 2001) Research Interests: Stochastic Programming Interior Point Methods Decomposition Methods High-Performance Computing Energy Systems Optimization Advising & Projects: PhD Supervision (7 students, 2007–2022) OOPS Parallel Solver Development CESI Energy Systems Integration SML Structured Modelling Language Labs/Teams: Member of the Edinburgh Research Group on Optimization, leading projects in power grid stability and energy planning.
Santosh S. Vempala is the Frederick P. Storey II Chair and Professor of Computer Science at Georgia Institute of Technology's College of Computing with joint appointments in the H. Milton Stewart School of Industrial and Systems Engineering (ISyE) and the School of Mathematics. He teaches courses including CS6150: Computing for Good (C4G) and CS6550/CS8803DAA: Continuous Algorithms: Optimization and Sampling. His research spans multiple interconnected domains: Algorithmic convex geometry and high-dimensional sampling Continuous optimization methods Computational models of brain function Randomized algorithms with applications to machine learning Vempala's recent publications reveal a strong focus on developing efficient algorithms for high-dimensional problems, particularly logconcave sampling and convex body integration. His work bridges theoretical computer science with practical applications in optimization and neuroscience, with increasing attention to the intersection of theoretical frameworks and brain computation models through his collaboration with Christos Papadimitriou. He leads the Computing for Good (C4G) initiative which applies computational approaches to social challenges, including projects like Safe and Easy Passwords!, LifeNet, C4G BLIS, and Shelter-to-Home that address problems in resource-constrained settings. Vempala currently advises PhD students Xinyuan Cao, Mirabel Reid, Max Dabagia, and Yunbum Kook, and has authored influential books including 'Spectral Algorithms' and 'The Random Projection Method' that have shaped research in algorithmic convex geometry. His tutorials at major conferences, including STOC 2015 on 'Sampling and Volume Computation in High Dimension' and FOCS 2020 on 'Computation in the Brain,' demonstrate his leadership in connecting theoretical computer science with broader scientific challenges.
Daniel Dadush is a part-time Professor at Utrecht University and a senior researcher at Centrum Wiskunde & Informatica (CWI) , where he leads the Networks & Optimization group. His research spans lattice algorithms, integer programming, convex optimization, and discrepancy theory, with a focus on theoretical and algorithmic advancements. PhD in Algorithms, Combinatorics, and Optimization (ACO) from Georgia Tech (2012) Simons Postdoctoral Fellow at Courant Institute, NYU (2012-2014) His work bridges discrete and continuous optimization, exemplified by breakthroughs like Strongly Polynomial Algorithms for Linear Programming (STOC 2024) and Interior Point Methods Are Not Worse Than Simplex (FOCS 2022). Recent publications emphasize randomized algorithms, integrality gaps, and high-dimensional geometry. Scientific Awards : ERC Starting Grant (2019-2024) NWO Veni Grant (2015-2018) Van Dantzig Prize (2020) A.W. Tucker Prize for Best Thesis (2015) INFORMS Optimization Society Student Paper Prize (2011) He mentors PhD students and postdocs, including Ben Bals , Samarth Tiwari , and Sophie Huiberts , and co-organizes major conferences like ISMP 2027 and Dutch Day on Optimization . His teaching includes courses on Interior Point Methods and Learning-Augmented Algorithms.
Samir Elhedhli is a Professor in the Department of Management Sciences at the University of Waterloo, within the Faculty of Engineering. His research focuses on Large-scale Optimization, Logistics, Supply Chain Design, Healthcare Operations, Airline Scheduling, and Data Analytics. He has held grants from NSERC, CFI, OCE, and MITACS, collaborating with industries in aircraft manufacturing, airline scheduling, and warehouse management. Education: PhD in Management Science, McGill University (2001) Master's in Industrial Engineering, Bilkent University (1996) Bachelor's in Industrial Engineering, Bilkent University (1994) Research Interests: Data Analytics & Data Science Large-scale Optimization (Interior-point methods, decomposition, column generation) Supply-chain Analytics (Logistics, warehousing, routing, scheduling) Environmental Sustainability in Supply Chains Key Awards: CORS Service Award (2013) University of Waterloo Distinguished and Outstanding Performance Awards (2005–2019) Grants & Advising: Active grants from NSERC, CFI, OCE, and MITACS Currently accepting graduate student applications Administration & Service: Chair, Department of Management Sciences (2014–2018) President, Canadian Operational Research Society (2011–2012) Co-Editor-in-Chief, INFOR Journal (2014–present) Labs & Teams: Leads the WanOpt research group focused on optimization methodologies and applications.
