Stephen L. Smith is a Professor and Tier 2 Canada Research Chair in the Department of Electrical and Computer Engineering at the University of Waterloo. He serves as Co-Director of the Waterloo Artificial Intelligence Institute, leading research in robotics and AI. His work focuses on autonomous systems, multi-robot coordination, and human-robot interaction, with applications in navigation, control systems, and collaborative task planning. Smith's research explores challenges such as path planning in uncertain environments, persistent monitoring, and adaptive decision-making. His contributions include algorithms for robot navigation in ice-covered waters, real-time replanning under constraints, and optimizing multi-agent systems for efficiency and safety. Key scientific awards include the Tier 2 Canada Research Chair designation. His research also addresses human-centric aspects, such as studying user preferences in collaborative tasks and developing frameworks for learning user intent through interaction.
João Pedro Hespanha is a Distinguished Professor holding dual appointments in the Electrical and Computer Engineering and Mechanical Engineering departments at the University of California, Santa Barbara. He is affiliated with the Center for Control, Dynamical-Systems and Computation (CCDC) and the Institute for Collaborative Biotechnologies, where he leads research at the intersection of control theory, networked systems, and biological applications. Dr. Hespanha has established himself as a leading authority in hybrid systems and networked control with significant theoretical contributions and practical implementations. Dr. Hespanha received his Licenciatura and MS in Electrical and Computer Engineering from Instituto Superior Técnico in Lisbon, Portugal, before earning his PhD in Electrical Engineering and Applied Science from Yale University in 1998. After serving as an Assistant Professor at the University of Southern California from 1999-2001, he joined UC Santa Barbara in 2002 where he has remained ever since, rising to his current distinguished position. His educational background reflects a strong foundation in both theoretical mathematics and practical engineering applications. His research program spans multiple interconnected domains including hybrid and switched systems, networked control systems, cooperative control of autonomous agents, and systems biology. Dr. Hespanha's work on hybrid systems has fundamentally advanced the mathematical frameworks for modeling systems that combine continuous dynamics with discrete logic transitions. His research on networked control systems addresses critical challenges in communication-constrained environments, while his work in cooperative control tackles computational complexity and limited communication in multi-agent systems. His systems biology research applies control theory to model gene regulatory networks using stochastic hybrid systems. Dr. Hespanha's recent publications demonstrate consistent innovation across theoretical foundations and practical applications. His work shows a clear trajectory toward more complex networked systems, with increasing emphasis on security, resilience, and uncertainty quantification. The publications reveal strong interdisciplinary connections between control theory, computer science, and biology, with applications spanning autonomous vehicles, communication networks, and biological processes. Among his numerous accolades: Elevated to IEEE Fellow in 2008 for contributions to stability techniques for switched and hybrid systems Awarded the prestigious Ruberti Young Researcher Prize in 2009 Received the George S. Axelby Outstanding Paper Award in 2006 Honored with the Automatica Theory/Methodology best paper prize in 2005 Named IFAC Fellow in 2016 Received ACM SIGBED HSCC Best Paper Award in 2019 Dr. Hespanha has successfully mentored over 25 PhD students who have gone on to prominent positions in academia and industry. His research has been consistently supported by substantial funding from NSF, NIH, ONR, and other agencies, with current projects including pandemic management decision systems, precision drug delivery, and control of autonomous vehicle networks. He has taught numerous influential courses including Linear Systems Theory and Noncooperative Game Theory, authoring widely used lecture notes published by Princeton Press. Dr. Hespanha leads an active research group within the Center for Control, Dynamical-Systems and Computation, collaborating with researchers across engineering disciplines and biology. His lab maintains strong connections with industry partners working on autonomous systems, communication networks, and biological applications. He has organized major conferences including serving as General Chair for the 9th International Workshop on Hybrid Systems: Computation and Control in 2006, further establishing UCSB as a leading center for control systems research.
Karthekeyan Chandrasekaran is an Associate Professor in the Department of Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana-Champaign (UIUC), where he has been since 2014. He holds an affiliate position in the Department of Computer Science. His academic career includes a Visiting Fellowship at ICERM (Spring 2023) and Eötvös Loránd University (Budapest, Fall 2022). He earned a B.Tech. in Computer Science and Engineering from the Indian Institute of Technology Madras (2007) and a Ph.D. in Algorithms, Combinatorics, and Optimization from Georgia Institute of Technology (2012). Before joining UIUC, he was a Simons Postdoctoral Research Fellow at Harvard University (2012–2014). His research focuses on Probabilistic Methods and Analysis , Algorithms , Mathematical Programming , and Combinatorial Optimization . He explores theoretical foundations of optimization, graph theory, and hypergraphs, with applications in algorithm design and complexity analysis. Recent work emphasizes hypergraph partitioning, submodular functions, and approximation algorithms. Chandrasekaran has received the Sharp Outstanding Teaching Award in Industrial Engineering (2018) and the College of Computing Dissertation Prize (2012) . His teaching includes courses such as Deterministic Models in Optimization and Combinatorial Optimization , reflecting his expertise in operations research and algorithmic theory. His research output spans over 50 publications, addressing cutting-edge topics like hypergraph connectivity augmentation, feedback vertex set problems, and strongly polynomial algorithms. He actively contributes to theoretical computer science and combinatorial optimization, with a focus on bridging mathematical rigor and practical algorithmic solutions.
Dr. Troy Lee is an Associate Professor of Quantum Cryptography at the Centre for Quantum Software and Information within the Faculty of Engineering and Information Technology at the University of Technology Sydney . His research focuses on quantum algorithms, computational complexity, and graph theory, with particular emphasis on quantum-classical separations and query complexity. Education: Not explicitly mentioned Research Areas: Quantum algorithms, computational complexity, graph theory, quantum cryptography, and Boolean function analysis Teaching: Supervised the course Data Structures and Algorithms in 2022 Grants: Currently involved in quantum algorithm design and defense optimization projects (2025-2028, 2021-2024) His recent publications highlight advancements in quantum query complexity, graph algorithms, and exact learning techniques. Notably, his work includes quantum speedups for graph connectivity problems and improved bounds for Fourier-sparse function learning. Dr. Lee maintains active collaborations across theoretical computer science and quantum computing domains, contributing to both foundational and applied research in quantum software development.
Alejandro Erick Trofimoff serves as an Adjunct Professor in the Department of Computer Science within the College of Science & Mathematics at Rowan University. His academic profile reflects extensive interdisciplinary training across engineering, mathematics, and information systems disciplines. His educational credentials include: Ph.D. in Electrical & Computer Engineering, Drexel University M.S. in Electrical Engineering (Medical Robotics Track), Drexel University M.S. in Applied & Pure Mathematics, University of Texas at Rio Grande Valley M.S. in General Statistics, University of Texas at Arlington B.S. in Power & Industrial Electronics, Del Valle University B.S. in Information Systems, Del Valle University Trofimoff's research demonstrates exceptional breadth across theoretical and applied domains. His work in Information Theory focuses on entropy region mapping and probabilistic structural models, while his Medical Robotics research analyzes complexity in minimally invasive surgical systems through functional, structural, and environmental dimensions. Significant contributions in Statistical Modeling address outlier detection methodologies, and his Information Systems work examines ERP integration in manufacturing contexts. This interdisciplinary approach bridges pure mathematics with practical engineering solutions. Publication trends reveal a progression from foundational manufacturing systems research (2005) through statistical methodology development (2008) to medical robotics complexity analysis (2013-2014), culminating in advanced information theory work (2019-2021). The entropy region research represents his most recent theoretical contributions, while earlier work demonstrates consistent application of analytical frameworks across diverse engineering challenges. No scientific awards or fellowships are documented in the available information. There is no mention of graduate student mentorship or externally funded research grants in the provided materials. No laboratory affiliations or dedicated research teams are specified in the current biography.
Andrew Clark is an Associate Professor in the Department of Electrical & Systems Engineering at Washington University in St. Louis (WashU), part of the McKelvey School of Engineering. Previously, he served as an Associate Professor at Worcester Polytechnic Institute (WPI). He holds a PhD from the University of Washington (2014) and degrees from the University of Michigan (BSE 2007, MS 2008). His research focuses on control, security, and resilience of cyber-physical systems (CPS) and complex networks, leveraging game theory, control theory, and optimization to ensure safety in adversarial environments. Key areas include secure control frameworks for autonomous systems, power grids, and submodular optimization for scalable algorithms. Education: PhD, Electrical Engineering, University of Washington, 2014 MS, Mathematics, University of Michigan, 2008 BSE, Electrical Engineering, University of Michigan, 2007 Research Interests: Clark’s work emphasizes resilience engineering, game-theoretic security modeling, and cyber-physical system security. He develops methods for robust control under attacks, including controlled islanding for power systems, stochastic control barrier functions for safety, and submodular optimization for resource allocation. His research also addresses challenges in autonomous systems, smart grids, and adversarial machine learning. Articles Trends: Recent publications focus on safety-critical control under adversarial conditions, secure CPS design, and submodular optimization for network resilience. His work bridges theoretical advancements with practical applications in energy systems and autonomous vehicles. Scientific Awards: NSF CAREER Award (2020) AFOSR Young Investigator Program (YIP) Award (2022) Multiple best paper awards at venues like WiOpt, GameSec, and ICCPS Grants & Advising: Clark has secured grants from NSF, AFOSR, and ONR totaling over $1.6M. He advises PhD students (e.g., Luyao Niu, Zhouchi Li) and MS students, focusing on CPS security and resilience. His lab has won awards at VehicleSec and other conferences. Labs & Teams: His research group at WashU collaborates on projects like resilient CPS design, with a focus on real-world applications such as autonomous systems and smart grids.
Uriel Feige is a Professor in the Department of Computer Science and Applied Mathematics at the Weizmann Institute of Science in Rehovot, Israel. His office is located in Zyskind 251, and he can be contacted via phone at (972)-8-9343364 or email. His research focuses on theoretical computer science with emphasis on combinatorial optimization, approximation algorithms, algorithmic game theory, and fairness in resource allocation. Professor Feige's research interests include NP-hard optimization problems (approximation algorithms, beyond worst-case analysis), algorithmic game theory (allocation problems, fairness), and past work on cryptography and random walks. His publications demonstrate deep engagement with fundamental challenges in computational fairness and optimization. Recent publications (2021-2025) show strong emphasis on fair allocation problems, particularly involving indivisible goods, subadditive/XOS valuations, and maximin fairness concepts. These works bridge computer science, game theory, and economics, developing novel mechanisms for resource distribution under complex constraints.
Emiliano Traversi is an Associate Professor in the Department of Information Systems, Data Analytics and Operations at ESSEC Business School. He holds a PhD in Operations Research from the University of Bologna and previously served as a Full Professor at LIRMM, University of Montpellier. His research focuses on mathematical optimization, decomposition methods, and machine learning, with recent emphasis on network slicing in UAV-based 5G systems and multi-drone formation strategies. His work bridges theoretical optimization frameworks with practical applications in telecommunications and autonomous systems. Education: PhD in Operations Research, University of Bologna Habilitation à diriger des recherches, Business Administration, Sorbonne Université (2023) Research Interests: Mathematical Optimization (Convex/Non-Convex) Decomposition Algorithms (e.g., Benders, Dantzig-Wolfe) Network Slicing & Resource Allocation for 5G/6G Autonomous Systems & Multi-Agent Coordination Applications in Telecommunications and Transportation Recent Research Trends: His 2025 publications highlight advancements in UAV-enabled 5G network slicing frameworks (EASIER) and mathematical foundations for drone fleet formations. Earlier work extends to optimization methods for transportation systems, quantum computing challenges, and power grid management through semidefinite relaxations. Professional Contributions: 20+ peer-reviewed articles in top journals/conferences (e.g., Computer Networks, AICA) Development of optimization frameworks with real-world applications Labs/Teams: Active collaborations in ESSEC's data analytics initiatives and international projects on UAV communication systems.
Mitchell Goemans is the RSA Professor of Mathematics at the Massachusetts Institute of Technology (MIT), where he also serves as the Head of the Department of Mathematics. He is a member of the Theory of Computation group at MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on combinatorial optimization, approximation algorithms, and algorithmic mathematics. He is an ACM Fellow, recognizing his contributions to theoretical computer science and discrete mathematics. Goemans has taught numerous advanced courses at MIT, including Advanced Combinatorial Optimization , Algorithms , and Topics in Theoretical Computer Science . His work bridges foundational mathematics with computational challenges, emphasizing techniques like semidefinite programming and matroid theory. Key research areas include non-bipartite matchings, matroid intersection, submodular function optimization, and approximation algorithms for NP-hard problems. His contributions to the Traveling Salesman Problem and semidefinite programming relaxations are particularly influential. Awards and recognitions include the ACM Fellowship (2009) and leadership roles in academic administration, reflecting his dual impact on research and education.
Yann Disser is a Professor (W2) at the Department of Mathematics, Technische Universität Darmstadt. His research focuses on combinatorial optimization, online algorithms, and graph theory. He holds a PhD in Theoretical Computer Science from ETH Zurich (2011) and has held academic positions at TU Berlin and ETH Zurich. Disser has led numerous DFG-funded research projects, including work on incremental maximization and potential-based flow networks. His teaching includes courses on discrete optimization, algorithmic discrete mathematics, and online optimization. He supervises a research group with members such as Júlia Baligács and Annette Lutz, and has advised multiple PhD students including David Weckbecker. His recent work explores competitive analysis, algorithmic lower bounds, and graph exploration. Education: PhD in Theoretical Computer Science (ETH Zurich, 2011), MSc in Physics (TU Darmstadt), Diplom in Computer Science (TU Darmstadt). Research Interests: Combinatorial Optimization, Online Algorithms, Graph Exploration, Computational Complexity, Incremental Algorithms, Approximation Algorithms. Grants: DFG TRR 154 (2022–2026), DFG Individual Grants (2019–2023), EU EFRE Project (2016–2019). Labs: Deep Learning Lab (TU Darmstadt), Algorithms Lab (ETH Zurich).
Umang Bhaskar is a Professor at the School of Technology and Computer Science , Tata Institute of Fundamental Research (TIFR), Mumbai, India. His research focuses on Algorithmic Game Theory , Combinatorial Optimization , and Approximation Algorithms . He has taught graduate courses including Algorithms and Data Structures and Computational Social Choice . Education : PhD from Dartmouth College, MTech from IIT Bombay, BSc from NIT Allahabad. Experience : Postdoctoral scholar at University of Waterloo and Caltech; software engineer at Tata Consultancy Services. His research explores computational challenges in multi-agent systems, particularly equilibrium computation in games, mechanism design , and network routing . He co-organizes academic workshops like the 2024 Workshop on Algorithmic Mechanism Design in IIT Gandhinagar. Recent publications span topics such as approximation algorithms , congestion games , and inverse optimization . His work has appeared at conferences including ESA , IJCAI , AAAI , and EC . Students include Phani Raj Lolakapuri , a PhD candidate who tragically passed away in 2019. Umang collaborates with researchers like Siddharth Barman and Katrina Ligett .
Dr. Danupon Na Nongkai is an Associate Professor in the Division of Theoretical Computer Science at KTH Royal Institute of Technology's School of Electrical Engineering and Computer Science. His research focuses on theoretical computer science, with specialization in graph algorithms for dynamic and distributed environments. Supported by prestigious grants including the Swedish Research Council's VR Young Researcher Grant (2015) and the European Research Council's Starting Grant (2016), his work spans approximation algorithms, communication complexity, game theory, verification, theoretical databases, quantum algorithms, and social network analysis. PhD in Algorithms, Combinatorics, and Optimization (ACO) from Georgia Tech (2011) Co-winner of Principles of Distributed Computing Doctoral Dissertation Award (2013) Research Interests: Dr. Na Nongkai investigates fundamental problems in graph theory and algorithm design, particularly in dynamic, distributed, and quantum computing paradigms. His research connects theoretical computer science with practical applications in network processing, optimization, and complexity analysis. Article Trends: Recent publications demonstrate expertise in near-linear time algorithms for shortest paths, cut problems, and connectivity in diverse computational models. Key themes include cross-paradigm optimization (dynamic/static, distributed/parallel, quantum), expander decomposition applications, and submodular function analysis. Scientific Recognition: FOCS 2022 Best Paper Award ERC Starting Grant recipient VR Young Researcher Grant PODC Doctoral Dissertation Award Advising & Grants: As a principal investigator, Dr. Na Nongkai has mentored numerous researchers through collaborative publications with 85 co-authors. His group's funding includes competitive national and European grants for cutting-edge algorithm research.
Saifuddin Syed is a Florence Nightingale Bicentenary Research Fellow at the University of Oxford's Department of Statistics, supervised by Arnaud Doucet and funded by the CoSInES project. His research focuses on computational statistics and machine learning, particularly scalable Bayesian inference, Monte Carlo methods, and non-reversible parallel tempering. He completed his PhD in Statistics at the University of British Columbia under Alexandre Bouchard-Côté. Currently, he contributes to the Next Generation Event Horizon Telescope (ngEHT) collaboration, improving algorithms for modeling and imaging supermassive black holes. Research interests include parallel tempering, sequential Monte Carlo, information geometry, and statistical physics. His work spans methodological development in MCMC schemes and applications in complex systems. He is affiliated with the Computational Statistics and Machine Learning research group and Statistical Theory and Methodology at Oxford. Key contributions include advancing non-reversible parallel tempering techniques to enhance computational efficiency in high-dimensional sampling, with applications to astrophysics and statistical mechanics. His recent work emphasizes scalable algorithms and rigorous theoretical analysis of MCMC performance.
Marek Adamczyk is an Assistant Professor in the Institute of Computer Science at the University of Wrocław. He earned his PhD in Computer Science from Sapienza University of Rome and held postdoctoral positions at Technical University of Munich, University of Bremen, and the University of Warsaw. His research is supported by a Polish National Science Centre (NCN) SONATA grant. His primary research interests lie in the design and analysis of algorithms under uncertainty, focusing on combinatorial and stochastic optimization, online algorithms, mechanism design, algorithmic game theory, and their intersections with machine learning. He explores theoretical foundations of optimization problems involving matroids, matchings, and submodular functions in uncertain environments. The 15 most recent publications reveal a consistent and impactful research trajectory in theoretical computer science, particularly in approximation algorithms for stochastic and submodular optimization. Key themes include stochastic probing, contention resolution schemes, and mechanism design, often yielding constant-factor or logarithmic approximations for NP-hard problems. His work frequently appears in top-tier venues such as FOCS, ICALP, ESA, STACS, and journals like Mathematics of Operations Research. First prize in the 44th Polish Mathematical Society's Contest for the best student paper in probability theory (for MSc thesis in Mathematics) Marek Adamczyk advises MSc and Engineering thesis students at the University of Wrocław and has a strong record of collaborative research, often working with prominent figures in the field. He is actively involved in organizing the Polish AI Olympiad for high school students and leads the development of the "Wrocław Beast" chess engine, which has achieved a 2200 ELO rating on Lichess. His work is funded by the Polish National Science Centre's SONATA grant on Combinatorial Optimization Under Uncertainty.
Kent R. Quanrud is an Assistant Professor in the Department of Computer Science at Purdue University, where he joined in Fall 2019. His research focuses on the design and analysis of algorithms within theoretical computer science, particularly in approximation algorithms, randomized algorithms, combinatorial optimization, and discrete geometry. He holds a PhD from the University of Illinois at Urbana-Champaign (UIUC), awarded in 2019. Dr. Quanrud's work spans topics such as submodular function maximization, matroid intersection, densest subgraph algorithms, and optimization in directed graphs. His research is supported by the National Science Foundation (NSF). He has taught courses including undergraduate and graduate algorithms, randomized algorithms, and advanced topics in algorithms. His publications reflect a strong emphasis on algorithmic efficiency, scalability, and theoretical foundations in combinatorial optimization. Notable contributions include advancements in approximation algorithms for metric TSP, submodular optimization, and dynamic graph algorithms. His collaborations with researchers like Chandra Chekuri have led to breakthroughs in areas such as matroid sparsification and densest subgraph problems. While no formal awards are listed, his work is widely cited in top venues like FOCS, SODA, and STOC. His research interests and publications highlight a commitment to advancing fundamental algorithmic techniques with applications in graph theory, optimization, and theoretical computer science.
