Tengyu Ma is an Assistant Professor of Computer Science at Stanford University. His research focuses on machine learning, deep learning, optimization, and theoretical computer science. He is particularly known for work on neural networks, reinforcement learning, and algorithmic guarantees in AI systems. His email is tengyuma@stanford.edu . Ma's research interests span foundational aspects of machine learning, including generalization theory, optimization algorithms, and the theoretical underpinnings of deep learning. He has contributed to areas such as self-play theorem provers, learning rate schedules, and robustness in low-light vision tasks. His work often bridges theoretical insights with practical algorithm design. His recent publications emphasize advancements in large language models (LLMs), theorem proving via self-play, and understanding training dynamics in deep networks. Despite prolific output, no specific scientific awards are explicitly mentioned in the provided texts. Ongoing work includes exploring in-context learning mechanisms, formal verification of AI systems, and efficient pretraining techniques. His research has implications for both theoretical understanding and real-world applications of AI.
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.
Allan Larsen is a Professor and Deputy Head of Division at the Department of Technology, Management and Economics (DTU Management) at the Technical University of Denmark. He heads the Operations and Supply Chain Management Section. His academic background includes an MSc in Applied Mathematics and a PhD in Operations Research, both from DTU. He teaches courses in Operations Management and Simulation at both undergraduate and graduate levels. Research Focus: His work applies operations research methodologies to complex planning problems in supply chain management, logistics, healthcare operations, and public transport. Key areas include urban freight transport, healthcare supply chains, and optimization of public transport resources like crew and fleets. Collaborations with industries, especially in freight transport, have been extensive. He previously co-directed the Transport DTU research center and co-chaired Denmark’s Transport Innovation Network. Education: MSc in Applied Mathematics (1989–1995), PhD in Operations Research (1997–1999), both from DTU. Recognition: Recipient of the Hedorf’s transportpris award in 2022 for contributions to transport research. Research Projects: Supervises multiple PhD students (e.g., on electric freight transport, healthcare resource optimization, and Industry 4.0 applications). Active in projects like 'Pioneering Electric Heavy-Duty Freight Transport' and 'Resource optimization in healthcare.' Labs/Teams: Leads the Operations and Supply Chain Management research group and collaborates in initiatives like the Transport Innovation Network, focusing on sustainable transport solutions.
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.
Illya V. Hicks is a Professor in the Computational and Applied Mathematics Department at Rice University. He holds a PhD from Rice University (2000) and a BS from Texas State University (1995). His research focuses on combinatorial optimization, integer programming, graph theory, and matroid theory, with applications in social networks, cancer treatment, and network design. He has advised numerous doctoral, post-doctoral, and masters students. Education: PhD and MA in Computational and Applied Mathematics, Rice University, 2000 BS in Mathematics, Texas State University, 1995 Research Interests: Utilizing graph decomposition techniques to solve NP-complete problems, including branch decompositions and matroid circuit problems. Applications include sensor network design, healthcare logistics, and algorithmic graph theory. Awards: Recognized with the 2015 Presidential Mentoring Award (Rice University), 2010 Forum Moving Spirit Award (INFORMS), and the 2005 Optimization Prize for Young Researchers. Grants and Projects: Includes NSF-funded research on branch decomposition techniques, submodular optimization, and healthcare service distribution. Active in promoting minority participation in operations research through travel grants and mentoring initiatives. Labs/Teams: Engaged in collaborative research on graph algorithms, combinatorial optimization, and interdisciplinary applications in healthcare and engineering.
Dr. Nanpeng Yu is a Full Professor at the University of California, Riverside , serving as Vice Chair and Graduate Advisor in the Department of Electrical and Computer Engineering . He maintains cooperative faculty affiliations with the Department of Computer Science and Department of Statistics , and directs the Energy, Economics, and Environment Research Center at UCR. Education : B.S. in Electrical Engineering from Tsinghua University (2006), M.S. in Electrical Engineering and Economics, and Ph.D. from Iowa State University (2010) Prior Industry Experience : Senior Power System Planner and Project Manager at Southern California Edison (2011-2014) Dr. Yu’s research bridges smart grid technologies , data-driven optimization , and machine learning for energy systems. Key areas include voltage control , renewable energy integration , transportation electrification , and grid resilience . His recent work focuses on physics-informed graph learning for unit commitment problems and adversarial purification in power system classifiers. The AI-Energy Nexus Laboratory under Dr. Yu has produced impactful publications in Applied Energy , IEEE Transactions on Power Systems , and Transportation Research series, covering topics like heavy-duty EV charging infrastructure and dynamic distribution network reconfiguration . Lab members have won the American-Made Digitizing Utilities Grand Prize ($300,000) from the U.S. DOE. Leadership Roles : Chair, IEEE Power and Energy Society Distribution System Operation and Planning Subcommittee Chair, IEEE Power and Energy Society Working Group on Data-Driven Modeling for Power Distribution Networks Associate Editor, IEEE Transactions on Smart Grid and IEEE Power Engineering Letters Scientific Awards : Regents Faculty Fellowship Regents Faculty Development Award Multiple IEEE Best Paper Awards
Seth Lewis Gilbert is a Professor and Head of the Department of Computer Science at the National University of Singapore (NUS), within the School of Computing . He holds the Dean's Chair Associate Professor title and focuses on algorithms for large-scale distributed systems , emphasizing scalability and fault-tolerance . His work spans wireless networks , contention resolution , dynamic networks , and blockchain protocols . Ph.D. in Computer Science, MIT (2007) M.S. in Computer Science, MIT (2003) B.S. in Electrical Engineering & Mathematics, Yale University (1999) His research explores trusted coordination in systems with untrusted and unreliable participants, addressing challenges like Byzantine agreement , load balancing , and contention resolution . He has pioneered formal frameworks for accountability in distributed protocols and developed novel algorithms for asynchronous task allocation . Recent publications include work on consensus protocols , leader election , and contention resolution , reflecting his focus on dynamic network environments . His research has earned recognition at venues like DISC, ICDCS, and CCS. Scientific Awards & Honors : Young Researcher Award (NUS, 2014) Faculty Teaching Excellence Award (2013/14, 2014/15, 2015/16) School of Computing Teaching Excellence Honour Roll (2016-2021) Best Paper Awards at DISC (2023, 2022), ICDCS (2022), IPDPS (2022) Best Student Paper Award at DISC (2022) He serves on the Steering Committee for DISC as Treasurer and has chaired program committees for DISC, OPODIS, and SPAA. His work bridges foundational algorithmic theory with practical applications in blockchains and dynamic networked systems .
Daniel Adelman is the Charles I. Clough, Jr. Professor of Operations Management at the University of Chicago Booth School of Business. He joined the faculty in 1997 after completing his PhD in industrial engineering and operations research at Georgia Tech. Adelman is a leading expert in Business Analytics and Management Analytics, helping companies deploy data and decision analysis to build world-class strategic and tactical management capabilities. Adelman received his PhD in industrial engineering and operations research in 1997, along with a bachelor's degree in industrial engineering and a master's degree in operations research, all from the School of Industrial and Systems Engineering at the Georgia Institute of Technology. Daniel Adelman's research focuses on applying analytical models to solve complex business problems across multiple industries. He has worked with firms from diverse sectors including internet services, chemical distribution, airlines, third party logistics, fiber-optics manufacturing, semiconductor manufacturing, oil, and healthcare. His research integrates real-world data with analytical models to bring structure and discipline to decision and control processes, enabling firms to achieve higher profits with lower risk. Adelman's recent work has concentrated heavily on healthcare analytics, where he leads the Healthcare Analytics Laboratory at Chicago Booth. This lab works with teams of doctoral and MBA students on projects with major healthcare institutions to optimize clinical, operational, and financial outcomes. His research spans foundational operations research including approximate dynamic programming, inventory theory/supply chain management, and revenue management/pricing optimization, as well as examining the linkage between operational performance metrics and financial performance of firms. Adelman's publications show a clear trend toward increasing focus on healthcare applications while maintaining strong theoretical foundations in operations research. His earlier work focused more on general operations management problems like inventory control and supply chain optimization, while his recent publications demonstrate a strategic shift toward healthcare analytics, particularly examining surgical team dynamics, hospital performance metrics, and resource allocation during public health emergencies like the COVID-19 pandemic. George B. Dantzig Prize (1998) for the best dissertation in operations research and management sciences that is innovative and relevant to practice Adelman regularly advises doctoral and MBA students through the Healthcare Analytics Laboratory at Chicago Booth. He has served as Associate Editor for Management Science, currently serves as Associate Editor for Manufacturing and Service Operations Management, and is the Area Editor for Operations and Supply Chain at Operations Research. His industry collaborations include significant projects with Akamai on internet pricing, with GE Global Research Labs on the electricity smart grid, with BP on gasoline supply contract portfolio optimization, and with Symantec on software release planning. Adelman leads the Healthcare Analytics Laboratory at Chicago Booth, which brings together interdisciplinary teams of doctoral and MBA students to work on a portfolio of projects with major healthcare institutions. The lab focuses on optimizing clinical, operational, and financial outcomes through advanced analytics and decision modeling.
Soroush Saghafian is an Associate Professor of Public Policy at Harvard Kennedy School, specializing in applying operations research and machine learning to address public health challenges. He leads the Public Impact Analytics Science Lab (PIAS-Lab), focusing on analytics-driven solutions for societal problems. His research spans healthcare delivery optimization, emergency department efficiency, and public health policy. Notable collaborations include Massachusetts General Hospital and Harvard's Center for Health Decision Science. Awards include the INFORMS MSOM Responsible Research Award and the Pierskalla Award for healthcare research. Recent work includes studies on hospital closures' impacts, predictive analytics for bipolar disorder using Fitbit data, and policy implications of race in disease risk models. He teaches courses on machine learning and big data for public impact.
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.
Susan J. Simkins is a Professor of Psychology at The Pennsylvania State University, where she serves as Lead of the CTSI-Team Science Core and is based in Moore Building at University Park. Her contact details include email sxm40@psu.edu and phone (814) 863-7387. Education Ph.D., Ohio State University, 1996 Research Interests Dr. Simkins' research centers on effective teamwork and performance through three interconnected streams: team composition/diversity (examining demographic, cognitive, and personality-based diversity within contingency frameworks), team cognition/mental models (focusing on shared understanding of tasks and teamwork dynamics), and temporal integration in teams (investigating time-based diversity, temporal leadership, and pacing styles). Her work emphasizes individual differences, cognitive processes, and temporal dynamics as critical determinants of team effectiveness in organizational contexts. Publication Trends Her 2013-2017 publications reveal a strong focus on temporal dimensions of teamwork, including polychronicity diversity, temporal conflict in specialized teams (e.g., culinary environments), and time-sensitive mental models. Key methodological approaches involve multilevel analysis and contingency frameworks, with applications spanning leadership theory, decision-making diversity, and climate interactions. Work appears consistently in top organizational psychology journals like Journal of Applied Psychology and Organizational Behavior and Human Decision Processes. Scientific Awards No scientific awards were documented in the provided text. Advising and Grants While the text confirms her faculty role and research leadership, specific details about graduate student advising, grant funding, or sponsored projects were not included in the source material. Labs and Teams Dr. Simkins leads the CTSI-Team Science Core, an initiative dedicated to advancing methodologies for studying team-based research structures and improving collaborative effectiveness in scientific and organizational settings.
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.
Lars Rohwedder is an Associate Professor in the Algorithms Group at the University of Southern Denmark (SDU) in Odense. He previously held positions as an Assistant Professor at Maastricht University (Netherlands) and postdoc researcher at EPFL, Lausanne (Switzerland). He earned his Ph.D. in Computer Science from CAU Kiel (Germany), advised by Klaus Jansen, and is a recipient of the 2019 PhD of the year award from Förderverein der TF of Kiel University. His research focuses on algorithms for combinatorial optimization, including approximation algorithms, online algorithms, parameterized algorithms, and integer programming. He has contributed to solving scheduling problems, resource allocation, and optimization under uncertainty. Rohwedder has served on program committees for conferences like MAPSP, SODA, STACS, and ICALP. He is funded by NWO's Open Competition M1 project on quasi-polynomial time algorithms. His teaching includes courses on advanced algorithms, operations management, and optimization at SDU and Maastricht University. Key achievements include a quasi-polynomial approximation for the restricted assignment problem, FPT algorithms for scheduling, and contributions to the Submodular Santa Claus problem. His work bridges theoretical foundations and practical applications, with a focus on algorithmic efficiency and robustness.
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.'
Jonathan M. Baker is an Assistant Professor in the Department of Electrical and Computer Engineering at The University of Texas at Austin, holding the Advanced Micro Devices Chair in Computer Engineering. His research centers on quantum computer architecture with emphasis on practical quantum error correction implementation across the quantum computing stack. His educational background includes a Ph.D. in Computer Science from the University of Chicago (advised by Fred Chong) and dual B.S. degrees in Mathematics and Chemistry and Computer Science from the University of Notre Dame. Baker's research spans quantum compilation, logic synthesis, multi-radix architectures, and error mitigation for both near-term and fault-tolerant quantum systems. His work addresses critical challenges in quantum hardware-software co-design, with particular focus on optimizing quantum circuits for real-world hardware constraints and noise characteristics. Current projects emphasize qudit-based computing, neutral atom architectures, and efficient error correction implementations. His publication record shows strong focus on quantum architecture innovations, with recent work exploring qudit advantages, modular chiplet designs, and dynamic noise adaptation. Key trends include hardware-aware compilation techniques, communication optimization across quantum systems, and practical approaches to fault tolerance. Best Paper Award Runner Up, MICRO 2020 IEEE Micro Top Pick, 2020 (Virtualized Logical Qubits) IEEE Micro Top Pick, 2020 (Extending Frontier with Qutrits) IEEE Micro Top Pick, 2021 (Emerging Technologies) Best Poster Award, MICRO 2018 Baker actively mentors graduate students in quantum computing architecture research and serves on conference review committees including MICRO and ASPLOS. His teaching includes specialized quantum systems courses at UT Austin and online EdX modules covering quantum computation fundamentals and architecture. He collaborates with the Duke Quantum Center and maintains strong industry connections through the AMD Chair position, focusing on bridging academic research with practical quantum computing implementations.
