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.
Shiyu Su is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Waterloo. His research focuses on high-speed data converters, wireless transceivers, digital phase-locked loops (PLL), and AI-assisted analog/mixed-signal design automation. He holds a Ph.D. from the University of Southern California (2019) and teaches courses such as ECE 340 (Electronic Circuits 2) and ECE 432 (Radio Frequency Integrated Devices and Circuits). Education: B.S. from Beijing University of Post and Telecommunication (China) and Queen Mary, University of London (UK), 2011; M.S. and Ph.D. from USC, 2013 and 2019, all in electrical engineering. Research Interests: High-speed ADCs/DACs RF/mm-wave transceivers Time-approximation filters (TAF) Analog/mixed-signal design automation Memristor-based computing Biomedical interfaces Key Awards: IEEE SSCS Predoctoral Achievement Award (2017–2018) Best Student Paper Award at IEEE RFIC (2022) Ming Hsieh Institute Scholar (2019–2020) Lab Focus: The Shiyu Su Lab develops integrated circuits for communications, sensing, and computing, with a focus on AI-driven methodologies and digital-analog co-design. Collaborations include work with Prof. Wei Wu (USC) on memristor-based systems.
Günter Rote is a Professor in the Department of Computer Science at Freie Universität Berlin, specifically within the Theoretical Computer Science group (Arbeitsgruppe Theoretische Informatik). He holds a formal academic title of Professor Dr. and is affiliated with the Faculty of Mathematics and Computer Science. His research focuses on theoretical computer science, computational geometry, algorithms, and discrete mathematics. Key research interests include geometric algorithms, optimization problems (e.g., shortest paths, traveling salesman problems), and algorithm design for parallel computing systems. His work spans topics such as systolic arrays, convex hulls, and combinatorial optimization. Rote’s contributions include foundational studies on computational geometry problems, algorithmic complexity, and practical applications in energy equity and infrastructure design. Publications highlight contributions to solving extremal equations, polygon transformations, and the quadratic assignment problem. He has been active in academic leadership, mentoring students, and contributing to computational science communities. His email is rote@inf.fu-berlin.de, and his office is located at Takustraße 9 in Berlin.
Mohsen Lesani is an Associate Professor in the Computer Science and Engineering Department at the University of California, Santa Cruz's Baskin School of Engineering. His research focuses on reliability and security of software systems, particularly concurrent and distributed systems, with recent emphasis on secure replicated systems and distributed machine learning. Dr. Lesani received his PhD from UCLA, MS in artificial intelligence from Sharif University of Technology, and BS in software engineering from University of Tehran. He was previously a postdoc at MIT. His educational background provides a strong foundation for his interdisciplinary research spanning programming languages, distributed systems, and security. His research interests center on creating reliable and secure distributed systems. Current projects include resilient and secure distributed systems, heterogeneous and reconfigurable secure distributed systems, automatic analysis and synthesis of replicated objects, verification of distributed systems, data analytics, secure exchange across blockchains, machine learning for performance models, domain-specific languages and type systems, and automatic fence insertion for concurrent systems. His work bridges theoretical foundations with practical implementations to address real-world challenges in distributed computing. Lesani's research has been recognized with several prestigious awards including the NSF CAREER award in 2020 and DARPA YFA award in 2022. His work has also received the SIGPLAN Research Highlight in 2019, a distinguished paper award at OOPSLA 2018, and a best paper award at ISSRE 2015. These accolades reflect the impact and quality of his contributions to the field. He actively mentors PhD students in the Safe and Secure Software (S3) lab, including Xiao Li, Eric Chan, Javad Saber-Latibari, and Tejas Mane. His research has been supported by multiple NSF grants, demonstrating sustained funding for his innovative work. Lesani serves on program committees for major conferences including POPL, PLDI, OOPSLA, and DISC, contributing to the academic community. Lesani leads the Safe and Secure Software (S3) lab at UC Santa Cruz, where his team works on cutting-edge research in distributed systems, programming languages, and security. The lab fosters a collaborative environment where theoretical insights are translated into practical systems that address real-world challenges in reliability and security of distributed applications.
Yiming Yang is a Professor at the Language Technologies Institute and Machine Learning Department within the School of Computer Science at Carnegie Mellon University , where he has held faculty positions since 2003. His research spans foundational and applied aspects of machine learning , artificial intelligence , and scientific computing . Professor, Carnegie Mellon University (2003–Present) Associate Professor, Carnegie Mellon University (1996–2003) Yang's research focuses on LLM-based problem-solving agents , combinatorial optimization , and scalable oversight frameworks . His work explores diffusion models, Langevin dynamics, and Fourier neural operators for NP-hard problems, while advancing reinforcement learning techniques for self-play supervision and principle-driven fine-tuning of large language models. Recent publications highlight his contributions to code synthesis , PDE solving , and multi-agent reinforcement learning . Key methodologies include demonstration-guided control, retrieval-augmented reasoning, and test-time scaling laws. His team has developed frameworks like FEEDER for efficient in-context learning and μTransfer-FNO for zero-shot hyperparameter transfer in PDE solvers. Notable scientific achievements include: Best Student Paper Runner Up (2013) Best Theoretical Paper Award (1994) Best Theoretical Paper Award (1993) Yang has mentored over 20 PhD students and postdocs, including Shengyu Feng , Zhiqing Sun , and Aman Madaan , across domains like graph learning , extreme multi-label classification , and language model alignment .
Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.
Patrick H. Madden is an Associate Professor and Director of the MS Information Systems program at the School of Computing, Binghamton University. His research focuses on combinatorial optimization, VLSI physical design automation, and algorithmic solutions for NP-Hard problems. He is also involved in interdisciplinary work in cryptography and biology-related optimization. Education: BS and MS from New Mexico Institute of Mining and Technology PhD from University of California, Los Angeles (UCLA) Professional Roles: Chair of ACM/SIGDA (Design Automation Special Interest Group) Chair of Design Automation Conference (DAC) Sponsors Committee Advisor to Binghamton ACM Student Chapter Coach for ICPC Programming Contest Teams Member of Watson School Graduation Committee Research Contributions: Leads the Optimality Research Group, developing optimization algorithms for VLSI CAD and medical software applications. Notable contributions include the Feng Shui placement tool and medical reference apps for iOS/Android platforms. Awards: SUNY Chancellor's Award for Excellence in Professional Service (2015) Grants & Collaborations: Collaborates with Prof. Monte McCollum (Cinema Department) on hybrid cinema projects and Dr. Joshua Steinberg (Physician) on medical software. Active in ACM committees and EDA conferences (DAC, ICCAD, ISPD). Labs/Teams: Directs the Optimality Research Group and oversees medical software collaborations through CS441/580 projects.
Matthew Stephenson is a Lecturer at Flinders University's College of Science and Engineering, specializing in Artificial Intelligence applications for games. He leads the Data for Decisions initiative within the Factory of the Future Transdisciplinary Hub, focusing on AI-powered scenario generation for smart digital twins. Additionally, he is a member of IRL CROSSING, an international lab studying human-autonomous agent teaming dynamics. PhD in Computer Science (Australian National University, 2019) B.Sc.(Hons) in Computer Science (University of Canterbury, 2015) His research applies AI, Machine Learning, and Data Science to game domains, including intelligent agent development for physics-based environments, procedural content generation, and game analytics. He also investigates deceptive behaviors in multi-agent systems and leverages games as testbeds for real-world AI solutions. Recent publications focus on large language models for game benchmarking, physical reasoning challenges, and evolutionary game generation. Scientific awards include an honourable mention at Foundations of Digital Games (FDG'18). He supervises students in procedural generation, game AI, and physics-based task creation, with teaching roles in computational intelligence and neural networks courses.
Cristopher Moore is a Professor at the Santa Fe Institute, where he conducts interdisciplinary research at the intersection of physics, computer science, and mathematics. His work focuses on understanding phase transitions in computational problems, statistical inference, and network analysis. Moore has made significant contributions to the fields of complex systems, quantum computing, and algorithmic justice. Moore's primary research areas include phase transitions in computational problems and statistical inference, where he investigates how problems suddenly become hard or impossible to solve when certain thresholds are crossed. His work spans social networks, big data analysis, quantum computing, algorithmic transparency, and decarbonization efforts. He is particularly known for applying physics-inspired approaches to computational problems, using techniques from spin glass theory, network theory, and computational complexity. His recent publications reveal a strong focus on community detection in networks, phase transitions in data science problems, algorithmic fairness in criminal justice systems, and quantum computing applications. Moore's work demonstrates consistent patterns across multiple disciplines, with recurring themes of phase transitions, computational limits, and the application of physics concepts to computational problems. Moore actively mentors students and has advised numerous PhD and Master's students who have gone on to successful careers in academia and industry. His work on algorithmic justice has influenced policy discussions in New Mexico and beyond, particularly regarding risk assessment in the criminal justice system.
Omar Rifki is an Associate Professor (Maître de Conférences) specializing in combinatorial optimization and artificial intelligence applications. His research bridges theoretical computer science with practical logistics challenges, focusing on routing problems, process mining, and machine learning integration for complex decision systems. His core research interests include phase transitions in NP-hard problems, vehicle routing optimization under time constraints, and healthcare process modeling. Rifki's work demonstrates a consistent pattern of integrating reinforcement learning with traditional optimization techniques to solve large-scale real-world problems in transportation and logistics, with particular emphasis on spatio-temporal data effects and collaborative systems. Analysis of his 15 publications (2019-2025) reveals three dominant research thrusts: (1) Fundamental studies of combinatorial problem hardness using phase transition frameworks, (2) Practical applications of deep reinforcement learning in vehicle routing and taxi assignment, and (3) Healthcare process optimization through advanced process mining techniques. His work consistently addresses scalability challenges in real-world implementations while maintaining theoretical rigor. No scientific awards were documented in the provided materials. His collaborative work with researchers like Christine Solnon and Thierry Garaix indicates active participation in European operations research communities, though specific grant details remain unreported. Rifki's research shows increasing integration of graph theory and machine learning in transportation applications, particularly evident in his Lyon City case studies on autonomous ride-sharing systems.
Professor Damien Woods is a faculty member at Maynooth University's Faculty of Science & Engineering, specifically affiliated with the Department of Computer Science and the Hamilton Institute. He leads groundbreaking research in DNA computing, molecular programming, and optical computing, focusing on self-assembly, algorithmic design, and computational complexity. ERC Consolidator Grant: 'Computationally Active DNA Nanostructures' SFI ERC Support Award EIC Pathfinder Challenge Grant: 'DISCO - DNA Infrastructure for Storage and Computation' His research projects explore programmable DNA storage, molecular robotics, and robust self-assembly systems. Recent publications span diverse topics like algorithmic DNA tile assembly, thermodynamic stability, and computational universality in nanosystems. Awards include ERC and SFI grants, with a focus on bridging theoretical computer science and experimental molecular biology. Scientific Contributions include: 2022: 'Turning Machines' - Molecular Robotics 2019: 'Diverse Molecular Algorithms' in Nature 2017: 'A Cargo-Sorting DNA Robot' in Science
Prashant Sankaran is an Assistant Professor in the Department of Industrial and Systems Engineering at the University at Buffalo (School of Engineering and Applied Sciences). He holds a PhD in Mechanical & Industrial Engineering from Rochester Institute of Technology (2023), an MS in Industrial & Systems Engineering from RIT (2020), and a BTech in Mechanical Engineering from Sharda University (2014). His research focuses on artificial intelligence for reasoning under uncertainty, explainable AI, and applications in healthcare, energy management, transportation, and space exploration. He integrates operations research and AI techniques to address complex optimization challenges. Research interests include computational design of bioelectronic materials, kidney exchange optimization via graph machine learning, and solving NP-hard combinatorial problems with hybrid learning-optimization frameworks. His work bridges theoretical advancements (e.g., genetic algorithms) with real-world applications like autonomous logistics systems and renewable energy management. No scientific awards have been mentioned. While no advisees are listed, his publications reflect collaborations across AI, robotics, and healthcare sectors. His research spans topics from deep reinforcement learning in warehouse automation to synthetic data generation for transplant systems.
Erik Demaine is a Professor in the Department of Electrical Engineering and Computer Science at MIT, affiliated with the Computer Science and Artificial Intelligence Laboratory (CSAIL), the Theory of Computation group, and the Algorithms Group. His research spans algorithms, computational geometry, folding, robotics, complexity theory, and interdisciplinary connections between mathematics and art. He received the MacArthur Fellowship ("genius grant") for his work on folding and computation. Demaine's work includes co-authoring books such as Geometric Folding Algorithms and Games, Puzzles, and Computation . His art collaborations with his father Martin Demaine, including curved-crease sculptures, are in the permanent collections of the Museum of Modern Art (MoMA) and the Renwick Gallery. He is also involved in software projects like Coauthor and Cocreate, supporting collaborative research and education. His research interests include folding and unfolding of geometric structures, computational complexity of games, protein folding, and algorithm design. He has contributed to areas like data structures, robotics, and network computing, with a focus on bridging theoretical computer science and tangible applications. Demaine holds patents and has been recognized with numerous awards, including the NSERC Doctoral Prize and the Gödel Prize. His work often involves supercollaboration, emphasizing open problem-solving and interdisciplinary approaches.
Dr. Leila Moslemi Naeni is a Senior Lecturer at the University of Technology Sydney (UTS), School of Built Environment, with a dual appointment in the Faculty of Design, Architecture and Building. She previously served as a Lecturer at UTS (2016-2018) and Sessional Lecturer at Curtin University (2015-2016). PhD in Computer Science (University of Newcastle, 2017) MSc in Industrial Engineering (Sharif University of Technology, 2007) BSc in Industrial Engineering (Iran University of Science and Technology, 2004) Her research focuses on project management under uncertainty, integrating fuzzy systems and mathematical modeling with applications in construction, ESG reporting, and disruptive technologies. She developed innovative methods for statistical control charts in project monitoring and leads research on leveraging blockchain and digital tools for sustainable infrastructure. Recent publications highlight her work on resource-constrained scheduling algorithms, ESG integration in megaprojects, and gamification in project management education. She serves as Review Editor for Frontiers in Environmental Science and on the Editorial Board of Smart and Sustainable Built Environment . 2016 PMI NSW Research Award 2022 Walt Lipke Award 2013 FEBE Postgraduate Research Prize As an active research mentor, she supervises PhD students in machine learning applications, disaster management technologies, and social infrastructure investments. Her teaching emphasizes simulation-based learning, collaborating with Oulo University (Finland) to quantify educational value.
Daniel G. Brown is a Professor at the David R. Cheriton School of Computer Science , University of Waterloo. He holds a Ph.D. in Computer Science (Cornell, 2000) and an S.B. in Mathematics with Computer Science (MIT, 1995). Research interests include: Computational Creativity : Exploring algorithmic modeling of creativity through AI, generative art, and poetry analysis. Bioinformatics : Developing algorithms like QTree and LSHtree for phylogenetic tree reconstruction, sequence correction (PANDASeq2), and solving NP-hard problems in biological sequence analysis. Music and Lyrics : Creating tools like RhymeAnalyzer for rap lyric analysis and cross-cultural music studies. Computational Ethics : Focused on equity, labor rights, and ethics of generative AI. Problem Gambling : Affiliated with Waterloo's Gambling Research Lab, studying slot machine interventions. Teaching includes courses like Computing and Discrimination , Computational Techniques in Biological Sequence Analysis , and Algorithmic Methods in Phylogenetics . He has served in major administrative roles, including FAUW President and Acting Director of the School of Computer Science. Non-academic affiliations : Co-founder of a dog-centric photo archive for his late dog Rover and current dog River. A Quaker, he sings with choirs like the Grand Philharmonic Choir and maintains a food blog with detailed reviews of Kitchener/Waterloo restaurants and grocery stores.
