Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.
Maria Chudnovsky is a Professor of Mathematics at Princeton University and a former Professor of IEOR and Mathematics at Columbia University (2006-2014). Her research focuses on graph theory and combinatorics, with significant contributions to structural graph theory, perfect graphs, and algorithmic applications. Education: B.A. Summa Cum Laude (1996) and M.Sc. (1999) from Technion, Ph.D. (2003) from Princeton University Her work addresses fundamental problems in graph coloring, forbidden induced subgraphs, and combinatorial optimization, including the proof of the Strong Perfect Graph Theorem and development of algorithms for detecting graph structures. Notable awards include the MacArthur Foundation Fellowship (2013-2017), D.R. Fulkerson Prize (2009), and Henry Burchard Fine Professor of Mathematics (2022). She has held prestigious fellowships such as the Clay Mathematics Institute Research Fellowship (2003-2008). Grants: NSF DMS-EPSRC Grant DMS-2120644 (2021-2024), US Army Research Office Grant W911NF-16-1-0404 (2016-2020), and multiple NSF grants She has advised numerous PhD/MSc students and postdocs, including Sophie Spirkl, Mingxian Zhong, and Tara Abrishami. Her outreach includes popular science communication on YouTube's Numberphile and participation in initiatives promoting women in STEM.
Huamin Qu is a Chair Professor in the Department of Computer Science and Engineering at the Hong Kong University of Science and Technology (HKUST). He serves as the Founding Dean of the Academy of Interdisciplinary Studies (AIS), Founding Head of the Division of Emerging Interdisciplinary Areas (EMIA), and was the Founding Acting Head of Computational Media and Arts (CMA) at HKUST(GZ). Qu directs the VisLab and coordinates the Human-Computer Interaction (HCI) group. He obtained his BS in Mathematics from Xi'an Jiaotong University and MS/PhD in Computer Science from Stony Brook University. Qu's research integrates Data Visualization , Human-Computer Interaction , and Human-Centered AI , with applications in urban informatics, social networks, and explainable AI. His work focuses on developing interactive systems for big data analytics, visual storytelling, and AI-driven decision support. Research extends to multimodal communication, fintech, and augmented reality applications. His publications emphasize visual analytics for complex datasets (mobility, social media, financial), interaction techniques for immersive environments, and AI-enhanced visualization tools. Recent works explore explainable AI interfaces and large-scale data communication frameworks. IEEE Visualization Academy (2020) IEEE VGTC Technical Achievement Award AI 2000 Most Influential Scholar (2019, 2023, 2024) 21 Best Paper/Honorable Mention awards IBM Faculty Award (2009) APICTA Merit Award (2015) Yelp Dataset Grand Prize (2018) Qu has advised 48 PhD graduates (21 now faculty at institutions like UC Davis, University of Minnesota, Texas A&M) and 30 MPhil students. He secured major grants including RGC theme-based projects (digital citizenship, air pollution), UGC AoE (slope safety), and China's 973 Program. As VisLab director, he leads 20+ researchers in visualization/HCI projects adopted by Microsoft, IBM, Huawei, and Tencent.
Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.
Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.
Jiao Licheng is a Distinguished Professor and Doctoral Supervisor at Xidian University, leading the School of Artificial Intelligence and the Department of Computer Science and Technology. He holds prominent roles such as Director of the Key Laboratory of Intelligent Perception and Image Understanding (Ministry of Education) and the International Joint Research Center for Intelligent Perception and Computing. His research focuses on Artificial Intelligence, Deep Learning, Evolutionary Computation, and Remote Sensing, with significant contributions to image understanding and brain-inspired computing. Education: B.E. (1982) from Shanghai Jiao Tong University, M.E. (1984) and Ph.D. (1990) from Xi'an Jiaotong University. Postdoctoral research at Xidian University (1990–1992). Research Interests include AI, Machine Learning, Image Processing, and Big Data Analysis. His work bridges theoretical advancements and practical applications, such as medical imaging, SAR image analysis, and autonomous systems. Recent articles emphasize innovations in remote sensing, deep learning architectures, and evolutionary algorithms. Awards include IEEE Fellow, IET Fellow, and the Wu Wenjun Artificial Intelligence Outstanding Contribution Award. Labs/Teams: Key Lab of Intelligent Perception, International Joint Research Center, and leadership in national innovation bases. Active in academic societies, including editorial roles in IEEE Transactions on Cybernetics and Geoscience and Remote Sensing.
Professor Thomas Lukasiewicz is a Full Professor and Head of the Artificial Intelligence Techniques research group at the Faculty of Informatics, Vienna University of Technology (TU Wien). His research focuses on enabling machines to mimic human-like intelligence through techniques spanning deep learning, symbolic reasoning, and predictive coding. Key areas include explainable AI, hybrid neurosymbolic systems, and applications in healthcare and law. He teaches courses such as Deep Learning for Natural Language Processing, Scientific Research and Writing, and multiple seminars in artificial intelligence and knowledge representation. His research projects include Explainable AI in Healthcare (2023–2027) and foundational work on predictive coding networks. His publications (15+ recent articles) address medical image segmentation, neurosymbolic frameworks, and language model evaluation in mathematics. Notable work includes neurosymbolic hybrid models (CCN⁺), reinforcement learning for medical report generation, and theoretical foundations of predictive coding networks.
Noga Alon is a Professor at Princeton University (previously at Tel Aviv University since 1985), renowned for transformative contributions to Combinatorics and Theoretical Computer Science. His work bridges deep mathematical theory with computational applications, earning him the 2024 Wolf Prize and 2022 Shaw Prize in Mathematical Sciences. Education Ph.D. in Mathematics, Hebrew University of Jerusalem, Israel (1983) Research Interests Alon pioneers combinatorial methods with profound impacts across mathematics and computer science. His expertise spans Graph Theory, Combinatorial Algorithms (including Streaming Algorithms), Circuit Complexity, and Combinatorial Geometry/Number Theory. He innovatively applies Algebraic and Probabilistic Methods to solve fundamental problems, such as necklace splitting and signrank applications, driving advancements in both pure and applied domains. Scientific Awards 1989 Erdos Prize, Israel 1991 Feher Prize, Israel 1997 Member of the Israel National Academy of Sciences 2000 Polya Prize, SIAM, USA 2001 Bruno Memorial Award, Israel 2005 Landau Prize, Israel 2005 EATCS-ACM Goedel Prize 2008 Israel Prize in Mathematics 2008 Member of the Academia Europaea 2011 EMET Prize 2015 Fellow of the American Mathematical Society 2015 Łojasiewicz Lecture at Jagiellonian University 2017 Fellow of the Association for Computing Machinery 2021 Leroy P. Steele Prize for Mathematical Exposition (with Joel Spencer) 2022 Shaw Prize in Mathematical Sciences 2024 Wolf Prize in Mathematics Advising and Grants While Alon has undoubtedly mentored numerous students during his tenure at Tel Aviv University and MIT, specific advisee names are not documented in the source material. Similarly, grant funding details remain unspecified despite his extensive research output.
Claudia Plant is a Professor in the Faculty of Computer Science , leading the Research Group Data Mining and Machine Learning . Her research focuses on clustering algorithms, data mining, and machine learning applications in areas like biomedical data, wind energy, and causality inference. She has contributed to projects such as Knowledge-infused Deep Learning for Natural Language Processing (2020–2028) and Hybrid Computational Sciences (2021–2021). Plant has authored over 160 publications, with recent work emphasizing deep learning, anomaly detection, and GPU-optimized algorithms. She actively engages in academic activities, including talks on clustering methods and interdisciplinary projects like Governing Algorithms: The Politics of Data and Decision-Making . Her research interests span clustering algorithms , graph neural networks , causality discovery , and ethical digital transformation . Notable projects include causal analysis of wind farm dynamics and AI-enhanced education tools. Plant’s work bridges computational methods with societal challenges, such as empowering marginalized communities through ethical technology adoption.
Emanuel Sallinger is a Full Professor at TU Wien's Databases and Artificial Intelligence Group and Vice Dean of Academic Affairs for Business Informatics and Data Science. He leads the Knowledge Graph Lab, focusing on scalable knowledge-based systems, reasoning in knowledge graphs, and AI integration. His research spans computational logic, database theory, and blockchain applications. Education: PhD in Computer Science (awarded 'sub auspiciis praesidentis rei publicae'), Master's degrees in Computational Intelligence and Informatics Management, and a Bachelor's in Software and Information Engineering. Research Interests: Knowledge graphs (construction, reasoning, scalability), logic-based systems, AI/ML integration with databases, enterprise architecture modeling, and financial knowledge systems. His work emphasizes practical applications like enterprise modeling, sustainable waste management, and regulatory compliance. Grants & Projects: Lead Vienna Science and Technology Fund (WWTF)-funded Knowledge Graph Lab. Involved in projects like 'Knowledge Graph-driven Tour Management' (sustainability), 'SustainGraph' (waste processing), and 'Enterprise Architecture Knowledge Graphs'. Teaching: Offers courses on Knowledge Graphs, Generative AI, Database Systems, and research methodology. Supervises doctoral and master's students in AI, databases, and knowledge representation. Labs/Teams: Knowledge Graph Lab at TU Wien, collaborating with industry on blockchain-based systems, financial AI, and enterprise architecture frameworks.
Hongbo Jiang is a Distinguished Professor and Vice Dean of the College of Computer Science and Electronic Engineering at Hunan University, China. He holds concurrent roles as Director of the Trusted Systems and Networking Key Laboratory of Hunan Province and Director of the Hunan International Technical Cooperation Base for High-Performance Computing and Distributed Systems. His academic journey includes tenures as a Professor at Huazhong University of Science and Technology and a Hong Kong Scholar Research Fellow at The Chinese University of Hong Kong. Education: PhD in Computer Science (Case Western Reserve University, 2008), B.S./M.S. in Mathematics (Huazhong University of Science and Technology, 2002). Research Interests: Distributed systems, mobile computing, smart sensing, wireless networks, IoT, and edge computing. Ongoing projects include mobile/wireless applications, data science in IoT, and edge computing platforms. His work emphasizes practical implementations such as DriverSonar for driving safety and SmileAuth for biometric authentication. Key Achievements: Elected Member of Academia Europaea (2022), Fellow of AAIA, IET, and BCS. Notable awards include the Wu Wenjun Science and Technology Award (2020) and multiple best paper recognitions. Over 100+ publications in top venues like ACM MobiCom, IEEE/ACM Transactions. Professional Contributions: Editorial roles across 8+ journals including IEEE Transactions on Mobile Computing and ACM Transactions on Sensor Networks. Conference leadership includes co-founding ACM TURC and EAI ICECI. Active in technical committees for INFOCOM, MOBIHOC, and ICDCS. Labs/Teams: Leads research groups focused on networking, IoT, and edge computing. Current openings for PhD/MSc students and PostDoc researchers with strong mathematical and systems backgrounds.
Viktor Prasanna is the Charles Lee Powell Chair in Engineering and Professor of Electrical and Computer Engineering and Computer Science at the University of Southern California. He holds courtesy appointments in Computer Science and leads the Center for Energy Informatics, focusing on interdisciplinary research linking energy technologies, computer science, and engineering. Education: BE in Electronics (Bangalore University), ME (Indian Institute of Science), PhD in Computer Science (Pennsylvania State University) His research spans reconfigurable computing, FPGA accelerators, parallel and distributed systems, and big data applications. He has pioneered high-performance architectures and algorithms using FPGAs, impacting domains like networking, security, HPC, and machine learning. Prasanna has published over 600 papers, received 22 best paper awards, and secured >$50M in grants. His work emphasizes energy-efficient computing, with recent grants totaling $12.9M (2016–2021). His h-index is 73, with 23,454 total citations. Scientific Awards: IEEE Fellow, ACM Fellow, AAAS Fellow, W. Wallace McDowell Award, multiple Distinguished Alumnus Awards He has advised over 70 doctoral students and led major centers including CiSoft (Big Data in oilfield tech) and CAST. His editorial roles include Editor-in-Chief of IEEE Transactions on Computers and Journal of Parallel and Distributed Computing.
Stefan Woltran is a Full Professor in the Databases and Artificial Intelligence department at TU Wien. He serves as Vice Dean of Academic Affairs for the Informatics Master program and leads the Research Unit for Databases and Artificial Intelligence. His research focuses on logic-based AI, including Propositional Logic, Nonmonotonic Reasoning, Argumentation frameworks, Knowledge Representation, and Logic Programming. He coordinates the Double-Degree Program Logic and Computation. His research projects include analyzing formal properties of logic-based AI approaches, complexity analysis, and developing algorithms via logic and dynamic programming. Notable projects include the HYPAR and REVEAL-AI initiatives exploring abstract argumentation and AI problem-solving. He has contributed to over 150 publications since 2001, focusing on argumentation frameworks, computational complexity, and formal methods. Woltran teaches courses such as Abstract Argumentation, Formal Methods in Computer Science, and Theoretical Computer Science. His work integrates theoretical advancements with practical solver development, such as the ASPARTIX system for argumentation tasks. He actively participates in international conferences and competitions in computational argumentation, emphasizing the application of formal methods to real-world problems.
Tamara Drucks is a PreDoc Researcher at the Department of Machine Learning, Technische Universität Wien. She specializes in machine learning, with a focus on graph neural networks, bioinformatics, and optimization algorithms. Drucks teaches courses including 'Introduction to Machine Learning' and 'Theoretical Foundations and Research Topics in Machine Learning.' Her research explores expressive power of graph networks and applications in phylogenetic modeling. Key projects include the StruDL initiative (2023–2027) focusing on maximally expressive GNNs for outerplanar graphs. She has advised one PhD student, Martin Plattner, on optimization techniques in machine learning. Publications span theoretical advancements in GNNs and practical applications in computational biology. Drucks holds a Diploma in Technical Mathematics from TU Wien (2021) and is involved in interdisciplinary research at the intersection of AI and biological data analysis.
Mihyun Kang is a Professor in the Institute of Discrete Mathematics at Graz University of Technology (TU Graz), leading the Combinatorics Group. She holds significant academic positions and has been recognized with a Heisenberg Fellowship (German Research Foundation) and a Friedrich Wilhelm Bessel Research Award (Alexander von Humboldt Foundation). Her research focuses on combinatorics, discrete probability, and algorithms, with a specialization in random graph theory. She contributes to editorial boards, including Random Structures & Algorithms . Her research interests emphasize high-dimensional graphs, percolation processes, and structural properties of random graphs. She explores topics such as phase transitions, graph enumeration, and algorithmic applications in combinatorial problems. Her work bridges theoretical foundations with practical applications in algorithm design and probabilistic modeling. Dr. Kang’s scientific achievements include pioneering studies on hypergraphs, bootstrap percolation, and the evolution of random graph processes. Her recent publications highlight advancements in understanding graph components, connectivity thresholds, and universality phenomena in random structures. She collaborates widely, contributing to conferences and international initiatives like the SFB “Discrete random structures: enumeration and scaling limits.” Her professional activities include advising doctoral students and supervising research projects at TU Graz. She leads the Combinatorics Group, which hosts the Graz Combinatorics Seminar and actively engages in academic outreach. Her contributions extend to textbook authorship, including Diskrete Mathematik für die Informatik , and she maintains an active presence in discrete mathematics education and research.
