Prof. Dr. Wolfgang Nejdl is a Professor at the Institute for Data Science within the Faculty of Electrical Engineering and Computer Science at Leibniz University Hannover. He serves as Executive Director of the L3S Research Centre and Leibniz Forschungszentrum Inclusive Citizenship. Web Science Information Retrieval Artificial Intelligence Deep Learning His recent research focuses on AI applications in medicine , multimodal data fusion , and ethical AI systems . Projects include CAIMed (AI in Causal Medicine) and DAISEC (AI & Cybersecurity). His publications span conferences like AAMAS, WWW, and SIGIR. Notable awards include membership in the National Academy of Science and Engineering (acatech) . Former students hold positions at institutions like Stanford, TU Dresden, and ETH Zürich. Current projects involve climate resilience AI , federated learning for healthcare , and quantum-inspired data science .
Ignasi Sau Valls is a Directeur de Recherche (DR2) at CNRS, affiliated with the LIRMM laboratory at Université de Montpellier, France. He is a member of the AlGCo team, focusing on algorithms for graphs and combinatorics. His academic background includes dual degrees in Mathematics and Telecommunications Engineering from UPC (Barcelona), a PhD in joint supervision between UPC and Projet Mascotte (Sophia Antipolis), and a postdoctoral position at the Technion (Israel). He has been with CNRS since 2010 and was promoted to his current role in October 2024. He also served as a Visiting Professor at UFC (Brazil) from 2016–2017. His research interests lie primarily in Graph Theory and Parameterized Complexity , with a focus on structural graph properties, kernelization, and algorithm design. He has made significant contributions to problems involving minor-closed graph classes, treewidth, and graph modification. His work bridges theoretical foundations with algorithmic applications, particularly in discrete optimization and network problems. The recent articles highlight a strong trend in parameterized algorithms, especially for graph modification, kernelization, and structural graph problems. Topics such as hitting minors, dynamic programming on tree decompositions, and edge contractions reflect a deep engagement with structural parameterizations and fixed-parameter tractability. His publications frequently appear in top-tier journals like SIAM Journal on Computing, Journal of Combinatorial Theory, and Algorithmica, as well as major conferences such as ICALP, SODA, and IPEC. Best paper award of Track C of ICALP'10 Best student paper award of WG'09 Ignasi Sau has been a principal investigator of the ANR JCJC project ELIT (ANR-20-CE48-0008-01), funded with 169k€ from 2021 to 2026. He serves as an editor for DMTCS and Information and Computation , and has held significant organizational roles, including PC member of numerous conferences (MFCS, WG, IPEC, COCOON) and as co-chair and main organizer of WG 2019, ICGT 2022, and JCALM 2023. He has delivered invited courses at international schools in France, Argentina, and Brazil. He is actively involved in the research community through editorial duties, conference organization, and collaborative research. His lab affiliation is the AlGCo team at LIRMM, a leading group in algorithmic graph theory and combinatorics.
Gerd Stumme is a Full Professor of Computer Science at University of Kassel , leading the Chair on Knowledge and Data Engineering . He serves as Executive Director of the Research Center for Information Systems Design (ITeG) , director of the International Centre for Higher Education Research (INCHER) , and founding member of the Hessian Institute for Artificial Intelligence (hessian.AI) . His research spans the intersection of Data Science, AI, and Mathematics , focusing on semantic/structural analysis of social networks, concept hierarchies, and mathematical structures (graphs, ordered sets) for knowledge acquisition. He pioneered work on Semantic Web, Web Mining, Social Bookmarking , and Recommender Systems , and has recently revisited mathematical foundations for knowledge representation. Recent publications analyze ordinal motifs in lattices , controversy mapping , and social network structures , with applications to business models, journalism, and AI. His work often integrates graph theory and formal concept analysis . He is a core developer of BibSonomy , a social bookmarking and publication-sharing system, and has contributed to FolkRank and TriAS algorithms for collaborative knowledge management.
Maximilian Egger is a Doctoral Researcher at the Institute for Communications Engineering under Prof. Antonia Wachter-Zeh at the Technical University of Munich (TUM). His research focuses on distributed machine learning, privacy-preserving computing, and information theory. He holds an M.Sc. in Electrical Engineering and Information Technology (2022, TUM) and a B.Eng. in Electrical Engineering (2020). He has conducted research stays at École Polytechnique Fédérale de Lausanne (2024) and Imperial College London (2023). Egger has received several awards, including the DAAD Scholarship (2023) and the VDE Award Bavaria (2020). His work emphasizes secure federated learning, Byzantine-resilient systems, and efficient distributed algorithms. He is affiliated with the Chair of Coding and Cryptography and actively contributes to advancements in decentralized learning systems. Recent publications highlight breakthroughs in privacy preservation, channel capacity estimation, and scalable federated edge learning.
Yen-Chi Chen is an Associate Professor in the Department of Statistics at the University of Washington. He also holds positions as a Data Science Fellow at the UW eScience Institute and as a co-investigator and statistician at the National Alzheimer's Coordinating Center. His academic career spans multiple interdisciplinary fields including statistics, data science, and astrostatistics. Chen's educational background includes a Ph.D. from Carnegie Mellon University, where he received prestigious awards including the Umesh K. Gavasakar Thesis Award (2017) and the William S. Dietrich II Presidential Ph.D. Fellowship Award (2015). His research focuses on nonparametric statistics, topological data analysis, missing data methodologies, cluster analysis, manifold learning, and applications in large-scale structure analysis and astrostatistics. Chen has made significant contributions to the development of statistical methods for analyzing cosmic web structures, GPS data, and causal inference with continuous treatments. His work bridges theoretical statistics with practical applications in astronomy, neuroscience, and public health. Analysis of his recent publications reveals a strong emphasis on developing novel statistical frameworks for complex data structures, particularly focusing on density-based methods, manifold learning, and approaches that address challenges in missing data and causal inference without standard assumptions. ASA Noether Early Career Scholar Award, American Statistical Association (2022) CAREER Award, National Science Foundation (2022-2027) Umesh K. Gavasakar Thesis Award, Carnegie Mellon University (2017) William S. Dietrich II Presidential Ph.D. Fellowship Award, Carnegie Mellon University (2015) Chen has advised numerous graduate students across multiple publications, with a focus on developing new statistical methodologies. His research has been supported by major funding agencies including the National Science Foundation and the National Institutes of Health. He is actively involved in several research groups including the UW Geometric Data Analysis Group, the UW Center for Statistics and the Social Sciences, and the National Alzheimer's Coordinating Center.
John van de Wetering is an Assistant Professor at the Theoretical Computer Science group of the Informatics Institute, University of Amsterdam, working with the QuSoft research center. He co-authored the open-access book Picturing Quantum Software and developed the PyZX quantum compiler. His research spans quantum computation and quantum foundations, focusing on diagrammatic methods like the ZX-calculus and ZH-calculus. Quantum circuit optimization and verification Quantum foundations via algebraic/compositional methods Co-creator of PyZX His recent publications explore multi-qutrit systems, completeness of graphical calculi, and quantum state representations. Supervises students in quantum computing, including Lia Yeh and Sarah Li. Directs the new Master's program in Quantum Computer Science at UvA. Actively contributes to open-source projects and international conferences. Notable collaborations include Aleks Kissinger, Neil J. Ross, and QuSoft researchers. Uses GitHub for DiZX development (qudit extension of PyZX). No explicit scientific awards mentioned.
Dr. Jing Wang is a Professor in the Department of Bioinformatics at Southern Medical University's School of Medicine, with extensive research at the intersection of artificial intelligence and biomedical applications. Her work demonstrates strong cross-disciplinary collaboration across medical institutions, engineering departments, and computer science research groups. Her primary research interests include Artificial Intelligence in Healthcare , Biomedical Engineering , and Traditional Chinese Medicine Informatics , with recent publications showing particular expertise in medical imaging analysis, diagnostic assistance systems, and clinical decision support. Her work spans both theoretical algorithm development and practical clinical implementations. Analysis of her 15 most recent publications (2025-2026) reveals a strong trend toward clinically applicable AI systems, with approximately 60% of publications focused on medical diagnostics and treatment support systems. The remaining publications demonstrate expertise in industrial applications of computer vision and fundamental AI research. Her work shows consistent collaboration with both domestic Chinese institutions and international research groups. Notable scientific contributions include: Development of 'Tianyi', a traditional Chinese medicine language model for clinical practice Innovations in bionic soft robotics for rehabilitation assistance Novel approaches to medical image analysis for cancer diagnostics Her research program appears well-funded with consistent publication output across high-impact journals in biomedical engineering, AI, and medical informatics. Current work suggests strong emphasis on translating AI research into clinical practice, particularly in diagnostic support systems and rehabilitation technology.
Martin Grohe is a Professor at the School of Logic and Theory of Discrete Systems , part of the Department of Computer Science at RWTH Aachen University . His research spans Algorithms and Complexity , Logic , Database Theory , Graph Theory , and Machine Learning , with a focus on integrating logical frameworks into computational models. His recent work explores graph neural networks , Weisfeiler-Leman algorithms , and parameterized complexity , as seen in publications on isomorphism testing , database repairing , and probabilistic query evaluation . While no specific scientific awards are mentioned, his contributions to graph theory and machine learning are widely recognized through numerous peer-reviewed publications.
Prof. Laura Vargas Koch serves as Junior Professor at RWTH Aachen University, leading the Teaching and Research Unit of Algorithmic Game Theory and Discrete Mathematics (GDM). Her interdisciplinary work bridges mathematics, computer science, and economics through rigorous theoretical frameworks. Her research focuses on: Algorithmic Game Theory : Analyzing fair pricing mechanisms and equilibrium structures in traffic flow systems Combinatorial Optimization : Developing approximation algorithms for clustering problems and graph-based optimization Analysis of her 2021-2025 publications reveals evolving expertise in dynamic traffic modeling, routing game equilibria, and auction mechanism design. Her work consistently addresses theoretical foundations while maintaining practical relevance to transportation networks and resource allocation systems. The GDM unit under her direction provides specialized coursework and fosters collaborative research at the intersection of discrete mathematics and economic modeling.
Hao Liu is a researcher affiliated with institutions like Chinese Academy of Sciences , Beihang University , and Stanford University . His work spans Computer Science , Artificial Intelligence , and Robotics . Key affiliations: National Space Science Center (Beijing), School of Astronautics (Beihang), Key Laboratory of Pervasive Computing (Tsinghua) Research interests include Machine Learning , Image Processing , Graph Neural Networks , and Wireless Communication Optimization His recent publications focus on: Advanced control systems for fuzzy models Medical imaging via hyperspectral analysis Transformer-based approaches in NLP and vision Quantum-safe and edge computing protocols
Nicole Megow is a Professor holding the chair for Combinatorial Optimization in the Faculty of Mathematics and Computer Science at the University of Bremen since 2016. She is affiliated with several research clusters including Humans on Mars Initiative, Minds, Media, Machines, and Dynamics in Logistics. Her academic journey includes positions at TU Berlin, Max Planck Institute for Informatics, TU Darmstadt, and TU Munich. Professor Megow's research focuses on mathematical optimization, algorithm design and analysis, and operations research. Her specific interests span combinatorial and discrete optimization, efficient algorithms, scheduling theory, resource allocation, packing problems, network design, routing, and uncertainty models including online, stochastic, robust, and explorable approaches. Her work bridges theoretical foundations with practical applications in logistics and decision-making systems. Her recent publications demonstrate a strong trend toward integrating prediction models with traditional optimization frameworks, particularly in scheduling and matching problems. She has made significant contributions to understanding the role of uncertainty in optimization problems, developing algorithms that work effectively with incomplete or uncertain information. Her work spans multiple prestigious venues including Mathematical Programming, Algorithmica, SODA, STACS, and NeurIPS. Dissertation Award by the German Operations Research Society (2007) Berlin Science Award for Young Researchers (2013) Heinz Maier-Leibnitz Prize (2013) Listed among Germany's top 40 researchers below 40 (Capital, 2014, 2015) Professor Megow actively supervises PhD students and postdocs, including Max Stahlberg, Joes Biburger, Sarah Morell, Bart Zondervan, Zhenwei Liu, and Alexander Lindermayr. She serves on numerous program committees for major conferences including SODA, IPCO, and STOC, and holds editorial positions for several prestigious journals. Her current research projects include Optimization under Explorable Uncertainty (DFG funded), How robots learn how to use structure (seed grant from MMM research cluster), and Scheduling Invasive Multicore Programs Under Uncertainty (within TCRC 89).
Dr. Kevin G. Jamieson is a faculty member at the University of Washington , School of Computer Science , with prior affiliations at the University of California, Berkeley (Department of Electrical Engineering and Computer Sciences) and the University of Wisconsin-Madison (Department of Electrical and Computer Engineering). His work spans machine learning, reinforcement learning, bandit algorithms, and robotics. Current university: University of Washington Academic rank: Professor His research focuses on: Bandit algorithms and sequential decision-making Optimization in non-stationary environments Reinforcement learning with real-world applications Multi-agent systems and game theory Efficient data selection for multimodal learning Human-in-the-loop AI systems Recent publications highlight his expertise in pure exploration strategies, robotic manipulation, and bridging simulation-to-reality gaps in RL. He has mentored numerous collaborators, though formal student advising details are not explicitly listed here. No scientific awards are mentioned in the provided data.
Professor Asaf Shapira is a faculty member in the Department of Theoretical Mathematics at Tel Aviv University's School of Mathematical Sciences. He has been actively contributing to combinatorics and graph theory research for over a decade, with numerous publications in top journals including Journal of the ACM, Advances in Mathematics, and Geometric and Functional Analysis. Professor Shapira's research focuses on extremal combinatorics, graph theory, and property testing. His work explores fundamental questions in Ramsey theory, hypergraph theory, and probabilistic methods in combinatorics. He has made significant contributions to the study of graph regularity, removal lemmas, and extremal problems in dense and sparse graphs. His recent publications demonstrate a consistent focus on theoretical aspects of combinatorics with connections to theoretical computer science. A notable trend is his work on developing polynomial bounds for various combinatorial theorems and exploring connections between combinatorial structures and computational complexity. His research often bridges pure mathematics with theoretical computer science applications. Professor Shapira teaches advanced courses at Tel Aviv University including Extremal Graph Theory, Basic Combinatorics, and seminars on specialized topics in combinatorics. His teaching spans undergraduate and graduate levels, reflecting his commitment to educating the next generation of mathematicians.
Akash Kumar is a Professor at Ruhr University Bochum, Germany, with affiliations to multiple institutions including TU Dresden and National University of Singapore. His research focuses on computer architecture, hardware acceleration, and approximate computing, with a strong emphasis on FPGA-based systems and neural network optimization. He has contributed extensively to embedded systems, mixed-criticality systems, and security in emerging technologies like reconfigurable nanodevices. His work spans cross-layer approximation methodologies, graph neural networks, and energy-efficient processing for edge AI. Collaborations with industry and academia highlight his leadership in VLSI design and secure hardware implementations. Notable contributions include frameworks for bounding time in mixed-criticality systems and resilient logic locking techniques. Research interests include hardware-software co-design, real-time systems, and efficient neural network architectures. His publications in top-tier conferences (DAC, DATE, FCCM) and journals (IEEE Trans. CAD, ACM TECS) underscore his impact in the field.
Tibor Szabó is a Professor in the Combinatorics and Graph Theory group at the Department of Mathematics, Freie Universität Berlin. He holds a PhD from The Ohio State University, advised by Ákos Seress. Prior to his current position, he held roles at McGill University, ETH Zürich, the Institute for Advanced Study (Princeton), and the University of Illinois (UIUC) as a J.L. Doob Research Assistant Professor. Research Interests: His work focuses on combinatorics and combinatorial optimization, including extremal problems, random structures and algorithms, pseudorandom graphs, positional games, and the combinatorics of linear programming. He explores tools from algebra, probability theory, and topology applied to combinatorics. Teaching: He teaches courses such as Algorithmic Combinatorics, Extremal Combinatorics, and runs the Combinatorics Seminar. His lecture notes include works on positional games and explicit constructions in extremal combinatorics. Students & Postdocs: Notable PhD advisees include Yamaan Attwa, Silas Rathke, Simona Boyadzhiyska, and Patrick Morris. Postdoctoral fellows include Olaf Parczyk and Anurag Bishnoi. His research has involved collaborations with over 50 co-authors. Funding & Grants: Supported by grants from the Swiss National Science Foundation (SNF) and German Research Foundation (DFG), focusing on topics like positional games and extremal graph theory.
