Dr. Michal Klincewicz is an Assistant Professor at Tilburg University's Department of Cognitive Science and Artificial Intelligence, affiliated with the Tilburg School of Humanities and Digital Sciences. He also holds a part-time position as an Assistant Professor at Jagiellonian University. His research focuses on AI ethics, cognitive science, and the intersection of video games with well-being and decision-making. Klincewicz completed his PhD in Philosophy at the CUNY Graduate Center and conducted postdoctoral research at the Berlin School of Mind and Brain. His work addresses ethical challenges in AI applications, including mental healthcare chatbots, generative AI's societal impacts, and consciousness theories. He leads projects like 'Moral Video Games Collaboration' and 'Understanding the associations between online video games and well-being.' Klincewicz is also involved in serious games development, such as 'The Sustainable Port,' to study real-world decision-making dynamics. Key collaborations include MindLabs and the Port of Rotterdam Authority. His research spans over 47 publications, with recent focus on AI ethics, cognitive neuroscience, and video game expertise analysis using eye-tracking and machine learning. He actively participates in conferences and networks like the Netherlands Research School for Information and Knowledge Systems (SIKS).
Ramin Javadi is an Associate Professor of Mathematics at Isfahan University of Technology and a Visiting Professor at the Laboratoire de l'Informatique du Parallélisme (LIP) at ENS Lyon from June to July 2025. His research focuses on graph theory and combinatorics, with notable contributions to structural graph theory and algorithm design. He holds a Ph.D. in Mathematics from Sharif University of Technology (thesis: 'Isoperimetric problems on graphs'), and an M.Sc. from Isfahan University of Technology (thesis: 'Chip-firing game and b-coloring of graphs'). His collaboration with LIP aims to strengthen scientific exchange in structural graph theory and expand institutional ties. Key research areas include parameterized complexity, Ramsey numbers, and graph coloring. Despite no explicit mention of awards, his extensive publication record reflects impactful contributions to discrete mathematics. He has advised multiple students from Isfahan University of Technology, though specific names are not listed. His work bridges theoretical computer science and pure mathematics, particularly through interdisciplinary studies in graph algorithms and combinatorial optimization.
J.A. La Poutré is a Full Professor at Delft University of Technology and a Scientific Staff Member at CWI (Centrum Wiskunde & Informatica) in the Intelligent and Autonomous Systems group. He holds part-time positions and is involved in research on multi-agent systems and computational intelligence for smart energy systems, with a focus on market-based optimization and fairness in network congestion management. PhD in computer science (Utrecht University, 1991) MSc in mathematics (TU Eindhoven, 1986) His research spans algorithm design, game theory, and reinforcement learning applied to energy systems, particularly smart grids and market mechanisms. Recent publications address cybersecurity threats in power networks, auction-based energy trading, and AI integration in media sectors. The 2019–2025 publications highlight his work in combining game theory with smart grid optimization , covering topics such as topology attacks , demand-side bidding , and fair congestion management . Papers frequently involve reinforcement learning , metaheuristics , and market mechanisms . Scientific Awards : Best paper award at GECCO-2015 KNAW fellow (Utrecht University, 1991–1997) He has led funded projects like Computational Capacity Planning in Electricity Networks (STW program) and co-chairs the Commit2Data Energy division. La Poutré also serves as Vice President of ERCIM (European Research Consortium for Informatics and Mathematics).
Félix García is a prominent professor at the University of Castilla-La Mancha in Ciudad Real, Spain, with extensive contributions to software engineering, sustainable computing, and business process management. His research spans over two decades with 187 publications indexed in dblp, demonstrating consistent scholarly productivity and leadership in multiple research areas. Dr. García's research interests focus on critical contemporary challenges in software development, particularly green software engineering, energy efficiency in computing systems, and sustainable software development practices. His work bridges theoretical foundations with practical applications, addressing how software design, implementation, and maintenance impact environmental sustainability. He has pioneered research connecting software quality attributes with energy consumption, examining how design patterns, code smells, and refactoring techniques affect resource usage. His recent publications (2023-2025) reveal a strong focus on cutting-edge topics including Green AI, quantum computing sustainability, and energy-aware programming language design. These works demonstrate his ability to anticipate and address emerging challenges at the intersection of software engineering and environmental sustainability. Dr. García has received significant recognition through numerous collaborations, particularly with Mario Piattini (133 co-authored papers), Francisco Ruiz (63 papers), and María Ángeles Moraga (30 papers), establishing him as a central figure in his research community. His work has appeared in prestigious venues including IEEE Transactions on Software Engineering, Journal of Systems and Software, and ACM Computing Surveys. He has mentored numerous researchers who have become established scholars in their own right, including Javier Mancebo, Laura Sánchez-González, and César Jesús Pardo Calvache. His contributions to gamification in software engineering education through serious games like GLOBAL-MANAGER demonstrate his commitment to innovative teaching approaches.
Yackolley Amoussou-Guenou is a Professor in Computer Science at Paris-Panthéon-Assas University, affiliated with the Center for Research in Economics and Law (CRED). His work focuses on blockchain technologies, consensus algorithms, distributed systems, and algorithmic game theory. He earned a Doctorate in Computer Science from Sorbonne University in 2020. His research explores the intersection of game theory and blockchain security, analyzing rational player behaviors, fairness mechanisms, and consensus robustness. His publications highlight trends in committee-based blockchain design, adversarial modeling, and formal verification of consensus protocols. He has contributed to venues including The Review of Financial Studies and conferences like OPODIS, NETYS, and AAMAS. His teaching includes Data Science, Python programming, and Computer Science Fundamentals, reflecting his expertise in both theoretical and applied distributed systems research.
André Nichterlein is a Permanent Research Associate at the Technical University of Berlin, specializing in Algorithmics and Complexity Theory. He completed his PhD at TU Berlin (2014) and holds a Diploma from Friedrich Schiller University Jena (2010). His career includes postdoctoral research at Durham University (UK) under a DAAD fellowship and extensive work as a research assistant at TU Berlin. Research Focus: Nichterlein's work centers on parameterized algorithms , kernelization techniques , graph problem optimization , and algorithm engineering . His research addresses fundamental challenges in computational complexity through practical algorithmic solutions, particularly in graph theory and network optimization. Publication Trends: His recent articles (2020-2023) demonstrate a strong focus on parameterized complexity frontiers, efficient data reduction methods for NP-hard problems, and applications in network design. Recurring themes include kernelization innovations, graph modification problems, and experimental algorithmics, with consistent contributions to theoretical foundations of computer science.
Artem Kaznatcheev is an Assistant Professor at Utrecht University in the Department of Mathematics and Department of Information and Computing Sciences within the Science faculty. His research bridges theoretical computer science and evolutionary biology to analyze biological and social systems through an algorithmic lens. Current role since January 2023 Recruiting PhD students and postdocs Previously: James S. McDonnell postdoctoral fellow at University of Pennsylvania His work focuses on: Computational complexity of evolution Evolutionary game theory Algorithmic biology Mathematical modeling of cancer dynamics Cultural evolution of science Selected article trends show: Interdisciplinary integration of computer science and cancer biology Key themes: fitness landscapes, evolutionary games, treatment optimization 2021-2020 publications dominate Mathematical formalisms applied to biological and social phenomena Scientific contributions include: James S. McDonnell Foundation Independent Postdoctoral Fellowship 2019 Genetics paper on computational complexity as evolutionary constraint 2017 Nature Ecology & Evolution study on fibroblast-drug interactions in cancer Collaborative environments: Worked with Theory, Evolution and Games Group Previous affiliations: Oxford University, University of Pennsylvania, Moffitt Cancer Center, McGill University Developed teaching roles at Oriel College (Oxford)
Dr. N.R. Aravind is an Associate Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Hyderabad. Holding a Ph.D. in Theoretical Computer Science from The Institute of Mathematical Sciences, Chennai, he is affiliated with the College of Engineering. His research spans algorithms, graph theory, combinatorics, and determinantal complexity, with a focus on parameterized algorithms and approximation techniques for NP-hard problems. Education: Ph.D., The Institute of Mathematical Sciences, Chennai (Advisor: Prof. C.R. Subramanian) Postdoctoral research under Prof. Sundar Vishwanathan at IIT Bombay Aravind's research explores structural questions in graph theory, social network modeling, and complexity bounds. His work on parameterized algorithms addresses tractable instances via input parameters, while his studies in graph coloring and forbidden subgraphs contribute to theoretical understanding. Recent publications focus on matching cut problems, happy coloring, and determinantal complexity. His 15 most recent publications (2010-2024) span computational complexity, graph algorithms, coloring problems, and determinantal complexity. These works emphasize parameterized approaches, structural graph theory, and algorithmic bounds for intractable problems. Scientific Awards: Aravind has mentored numerous PhD and MTech students, including Roopam Saxena, Anjeneya Swami Kare, and R.B. Sandeep, now holding academic positions at prestigious institutions. He has taught courses like Algorithms, Probability in Computing, and Cryptology, often collaborating with co-instructors such as Dr. Rakesh Venkat. His office is located in Room CS-408, Indian Institute of Technology Hyderabad.
Jugal Garg is an Associate Professor in the Department of Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana-Champaign, with an affiliate appointment in the Department of Computer Science. His work bridges theoretical computer science, economics, and operations research, focusing on fundamental problems in market design and resource allocation. Dr. Garg earned his BTech and PhD in Computer Science from IIT-Bombay. Following his doctoral studies, he completed postdoctoral research at the Algorithms and Randomness Center at Georgia Tech and the Algorithms and Complexity group at Max-Planck-Institut für Informatik in Saarbrücken. His academic journey has positioned him at the forefront of research at the intersection of computation and economics. His research focuses on the computational aspects of economics and game theory, with particular emphasis on fair division problems and market equilibrium computation. Dr. Garg has made significant contributions to understanding envy-free allocation mechanisms, maximin share guarantees, and competitive equilibrium computation in various market settings. His work combines deep theoretical insights with practical algorithmic approaches, addressing fundamental questions in resource allocation where computational complexity meets economic efficiency. Analysis of Dr. Garg's recent publications reveals a strong focus on fair division problems, particularly envy-free allocation (EFX), maximin share (MMS) approximations, and market equilibrium computation. His research spans both goods and chores allocation, with increasing attention to more complex settings involving mixed manna (both goods and chores), heterogeneous agents, and specialized utility functions. A notable trend is his development of combinatorial algorithms for market equilibrium computation and his work on improving approximation guarantees for fairness concepts in resource allocation. NSF CAREER Award (2020) - Recognizing his potential for leadership in research and education INFORMS Koopman Prize (2021) - For the paper 'Multi-Agent UAV Routing: A Game Theory Analysis with Tight Price of Anarchy Bounds' Exemplary Theory Paper Award (2020) - For 'EFX Exists for Three Agents' at ACM EC Dean's Award for Excellence in Research (2022) James Franklin Sharp Outstanding Teaching Award (2019) NSF CRII Award (2018) Dr. Garg has successfully advised numerous PhD students including Peter McGlaughlin, Timothy Murray, Setareh Taki, John Qin, Eklavya Sharma, Yuang (Eric) Shen, Pooja Kulkarni, and Aniket Murhekar. He has also mentored postdoctoral researchers such as Bhaskar Ray Chaudhury (now an assistant professor at UIUC) and Vishnu V. Narayan. His research has been supported by prestigious grants including the NSF CAREER and CRII awards, and he serves on program committees for leading conferences in theoretical computer science, artificial intelligence, and operations research including EC, STOC, SODA, and AAAI. Dr. Garg maintains active collaborations with researchers across institutions worldwide, as evidenced by his frequent invited talks at international venues including the University of Bonn, LSE, and TIFR Mumbai.
Behzad Maleki Vishkaei serves as a Research Fellow in Strategy and Operations at Bocconi University in Milan, Italy. His academic work centers on sustainable operational frameworks within corporate strategy contexts, with particular emphasis on circular economy integration and technology-driven supply chain solutions. He maintains active research collaborations with Professor P. De Giovanni across multiple high-impact publications. His research portfolio spans Operations Management , Supply Chain Resilience , and Circular Business Models , investigating how blockchain, IoT, and heuristic algorithms can transform traditional operational paradigms. Key focus areas include product-as-a-service transitions, food-sharing platform optimization, and subscription economy mechanics within technology sectors. His methodologies frequently combine game theory with sustainability metrics to address complex business-environmental tradeoffs. Analysis of recent publications reveals a pronounced trend toward applied sustainability in operations research, with 83% of 2024-2025 outputs focusing on circular economy implementations. His work consistently bridges theoretical modeling (particularly game-theoretic approaches) with practical case studies across mobility, food systems, and manufacturing sectors. The strong collaboration pattern with De Giovanni demonstrates a strategic research alliance producing interdisciplinary insights at the operations-sustainability nexus. No scientific awards were documented in the available materials. Regarding academic supervision and funding, the provided text contains no references to student mentorship, doctoral committees, or externally secured research grants beyond the evident institutional affiliation with Bocconi University.
Laura Bofferding is a Professor of Mathematics Education in the Department of Curriculum and Instruction at Purdue University's College of Education. Her career spans over a decade of progressive academic appointments, including Assistant Professor (2011-2017), Associate Professor (2017-2024), and current Professor (2024-present). She maintains active research and teaching roles focused on early mathematics cognition. Her educational background includes: Ph.D. in Curriculum Studies and Teacher Education from Stanford University (2011) M.A. in Learning, Design, and Technology in Education from Stanford University (2007) B.S. in Elementary Education from University of Wisconsin, River Falls (2002) Bofferding's research centers on cognitive development in early mathematics, particularly children's understanding of negative numbers, spatial reasoning through tangram puzzles, and the application of contrasting cases in instruction. Her work bridges theoretical cognitive science with practical classroom applications, emphasizing game-based learning and emergent bilingual education. Recent projects explore AI-generated word problems and programming debugging in elementary contexts, demonstrating her commitment to innovative pedagogical approaches. Her publication trends reveal sustained focus on integer conceptualization (2014-2023), expanding into spatial reasoning (2022-2023) and AI integration (2024). Key thematic clusters include measurement misconceptions, tangram-based shape transformation, and debugging strategies in computational thinking. Notable awards include: Purdue Faculty Engagement Scholar (2021) Purdue Faculty Scholar (2019) AMTE STaR Fellow (2012) Bofferding secures significant grant funding including an NSF CAREER award ($680,504) for integer understanding research and a Purdue Launch the Future Grant ($25,000) investigating AI-generated word problems. Her advising focuses on mathematics education doctoral students through courses like EDCI 62000 (Developing as a Mathematics Researcher), with grant collaborations spanning computational thinking (NSF ITEST) and emergent bilingual education (Purdue Small Research Grant).
George Vairaktarakis is a Professor at the Department of Operations, Weatherhead School of Management, Case Western Reserve University. His research focuses on subcontracting, production chain coordination, and project management, with impactful findings reducing production costs by 30% while improving service efficiency. He holds the William E. Umstattd Professorship in Industrial Economics and serves as Director of the Master of Science in Management - Operations Research and Supply Chain Management program. Education: PhD in Operations (University of Florida, 1994) MSc in Industrial Engineering (University of Florida, 1992) MSc in Applied Mathematics (University of South Carolina, 1990) BS in Applied Mathematics (University of Patras, 1988) Vairaktarakis investigates time/cost-sensitive project management, third-party logistics, and workforce planning using mathematical models like integer programming and game theory. His work addresses decentralized production coordination, contract design for subcontracting, and resource flexibility in manufacturing systems. His publications span top journals including Management Science, Operations Research, and Naval Research Logistics. Key research trends include optimization of outsourced operations, game-theoretic analysis of supply chain collaboration, and robust scheduling methodologies. His editorial roles include Senior Editor at Production & Operations Management and Associate Editor at Naval Research Logistics. Awards: William E. Umstattd Professorship (2014), Alcoa Teaching Excellence Award (2013) Teaching: Developed Lean Operations and project management courses for MBA/executive programs globally Service: Held leadership roles in Faculty Council, Academic Integrity Office, and editorial boards
Bruce H. Thomas is a Professor at the University of South Australia, specializing in Augmented Reality (AR), Virtual Reality (VR), and immersive systems. His research focuses on spatial computing, human-computer interaction, and the application of mixed reality in domains like collaborative analytics, architectural design, and healthcare. Key contributions include foundational work on ARQuake (the first outdoor AR game), spatial interaction techniques, and immersive analytics frameworks. He has authored over 280 publications across venues like IEEE Transactions on Visualization and Computer Graphics (TVCG), ISMAR, and CHI. His work spans theoretical studies on cognitive load and EEG responses to AR, as well as applied systems like GeoGate for geo-temporal data visualization. Dr. Thomas collaborates extensively with industry partners (e.g., automotive, energy sectors) and academic institutions globally. His projects emphasize real-world applications, including crime scene reconstruction for legal evidence presentation, VR-based architectural reviews, and haptic interfaces for surgical training. He co-edited the seminal book Emerging Technologies of Augmented Reality (2007) and serves on editorial boards for top journals. His lab's innovations include adaptive portals in VR, proxy-based situated visualizations, and systems for collaborative decision-making in high-stakes environments. Current research explores AI integration with immersive systems and AR-driven solutions for complex data analysis tasks.
Michael Krivelevich is a Full Professor at the School of Mathematical Sciences, Tel Aviv University, holding this position since 2005. He previously served as Associate Professor (2002-2005) and Senior Lecturer (1999-2002) at the same institution. From 2015 to 2020, he acted as Dean of the Faculty of Exact Sciences at Tel Aviv University. Research Interests: Probabilistic and extremal combinatorics Random structures Applications of combinatorics to computer science Scientific Contributions: Authored two books: Positional Games (2014) and Random Graphs, Geometry and Asymptotic Structure (2016) Published over 200 research papers in combinatorics and related fields Editor-in-Chief of the Journal of Combinatorial Theory Series B (JCTB) Recognitions: Clay Lecturer (2019) Fellow of the American Mathematical Society (2017) Invited Speaker at ICM (2014) Pazy Memorial Award (2007) Academic Leadership: Dean of Faculty of Exact Sciences (2015-2020) Supervised 9 PhD and 16 MSc students at Tel Aviv University
Ignacio Rios Uribe is an Assistant Professor at the Naveen Jindal School of Management (University of Texas at Dallas) specializing in Operations Management . He holds a PhD in Operations, Information and Technology (2020) from Stanford University, with additional MA in Economics from Stanford and MS/BS in Operations Research and Industrial Engineering from Universidad de Chile. PhD in Operations, Information and Technology (2020) - Stanford University MA in Economics (2020) - Stanford University MS in Operations Management (2014) - Universidad de Chile BS in Industrial Engineering (2014) - Universidad de Chile His research focuses on Behavioral Operations Management , particularly in matching markets , college admissions systems, and online platform optimization . Current projects examine mechanism design for dating apps, strategic behavior in college applications, team-building incentives, and charity donation systems. He employs mathematical modeling, field experiments, and structural estimation techniques. Recent publications analyze platform design for curated dating markets (M&SOM, 2023), stable matching with contingent priorities (Management Science, 2023), and capacity planning in school choice (Operations Research, 2022). His work combines theoretical analysis with empirical validation using real-world data from Chilean education systems and industry partners. Awards include First Place in Doing Good with Good OR (2018) and BOM Best Working Paper Competition (2023) Published in top journals like Management Science, M&SOM, Operations Research Professional affiliations with INFORMS and Manufacturing & Service Operations Management Society
