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.
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.
Nori Franco serves as Professor in the Department of Physics at the University of Michigan and Chief Scientist at RIKEN's Theoretical Quantum Physics Laboratory in Japan. His dual appointments reflect his significant contributions to both American and Japanese academic communities, with continuous service at Michigan since 1990 and at RIKEN since 2002. His research spans quantum information, condensed matter physics, and quantum optics, with particular focus on light-matter interactions, superconducting qubits, optomechanics, and quantum open systems. Franco's work bridges theoretical foundations with experimental implementations, especially in circuit quantum electrodynamics and quantum computing applications. Analysis of his recent publications reveals a strong emphasis on non-Hermitian quantum systems, quantum control techniques, and applications of quantum information science to fundamental physics problems. His research group consistently produces highly cited work, with publications appearing in top journals across quantum physics and condensed matter disciplines. Scientific Awards: Charles Hard Townes Medal (2024) - sole recipient for fundamental contributions to quantum optics and quantum information processing Research Doctorate Honoris Causa from University of Messina (2024) Highly Cited Researcher for eight consecutive years (2017-2024) Member of Academia Europaea (2023) Willis E. Lamb Medal (2023) for quantum electronics research Throughout his career, Franco has secured significant research funding and mentored numerous students and postdoctoral researchers. His work has received international recognition through invitations to deliver prestigious lectures including the Stanislav Ulam Lecture and Sir Nevill Mott Lecture in 2024. His research group maintains strong collaborations across multiple continents, reflecting his global impact on quantum physics. At RIKEN, Franco leads the Quantum Information Physics Theory Research Team within the Quantum Computing Center, directing cutting-edge theoretical work that complements experimental efforts in quantum computing hardware development.
Christian Bargetz is a Professor of Functional Analysis at the University of Innsbruck, Austria, affiliated with the Faculty of Mathematics, Computer Science, and Physics (MIP). His primary research focuses on nonlinear functional analysis, Banach space theory, and distribution theory. He teaches advanced courses such as Optimization, Distribution Theory, and Functional Analysis, demonstrating his expertise in both theoretical and applied aspects of his field. Education: Completed his PhD in 2012 at the University of Innsbruck under the supervision of Norbert Ortner. His diploma thesis (2008) explored differential behaviors with Ulrich Oberst. Bargetz has held continuous academic positions since 2008, including roles as a lecturer and researcher. Research Interests: Specializes in iterative projection methods, generic properties of nonexpansive mappings, Fréchet spaces, and vector-valued distributions. His work bridges functional analysis with geometric measure theory and optimization, with applications in metric geometry and topological tensor products. Publications: Over 30 peer-reviewed articles in prestigious journals such as Canadian Journal of Mathematics , Journal of Mathematical Analysis and Applications , and Proceedings of the American Mathematical Society . Recent work includes studies on extremal nonexpansive mappings and Lipschitz function spaces. Grants & Projects: Principal investigator in FWF-funded projects on nonexpansive mappings and Banach spaces. Collaborates internationally, including with institutions in Israel, Poland, and Serbia. Teaching: Leads advanced courses in functional analysis, optimization, and distribution theory. Supervises bachelor's theses and master's projects on topics like extension operators for Lipschitz functions. Affiliations: Active member of the Functional Analysis working group and regularly participates in international conferences such as the Banach Afternoon, Winter School in Abstract Analysis, and DMV-ÖMG Annual Conferences.
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.
Dr. Quirin Thomas Simon Vogel is a Senior Lecturer at the Department of Statistics, University of Klagenfurt. He previously held postdoctoral positions at the Technical University of Munich, New York University Shanghai, and served as an Interim Professor at Ludwig-Maximilians University of Munich. His research bridges probability theory with statistical mechanics and algorithmic applications. Current role: Senior Lecturer (2025) Previous roles: Postdoc (TUM, NYU Shanghai), Interim Professor (LMU Munich) His research focuses on: Random walks and their geometric/stochastic properties Randomized algorithms with applications in statistical models Quantum-inspired probabilistic systems (e.g. interacting bosonic loop soups) Large deviation theory for complex systems Percolation and phase transitions in particle models The articles reflect trends in probability theory, mathematical physics, and algorithmic applications. Key topics include high-dimensional percolation, Bose gas models, neural network theory, and stochastic geometry. The work combines rigorous mathematical analysis with interdisciplinary applications in physics and computer science. Scientific awards and functions cannot be determined from the provided data, as they describe other researchers. The department's research activities include projects on statistical learning, quantum models, and algorithmic probability, though Vogel's direct involvement in these specific funded projects isn't explicitly stated.
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.
Nelson Nicolas Higuera Ruiz is a PreDoc Researcher at the Vienna University of Technology, affiliated with the Faculty of Informatics' Knowledge-Based Systems research group. His work bridges logic programming and deep learning for explainable AI. Research Focus: Neurosymbolic AI, Visual Question Answering (VQA), Answer Set Programming (ASP), and hybrid reasoning systems Projects: Leads optimization research in the LCS (2017–2025) project, developing neurosymbolic approaches for intelligent systems Key Contributions: Pioneering adaptive large-neighbourhood search algorithms for ASP optimization, modular neurosymbolic architectures, and contrastive explainability frameworks for VQA Collaborations: Active in international workshops and conferences including IJCAI, AAAI, and CLeaR, frequently collaborating with researchers like Thomas Eiter and Johannes Oetsch Publications: Focus on neurosymbolic integration, optimization algorithms, and explainability across AI, logic programming, and computer vision domains
Sophie N. Parragh is Professor and Head of the Institute of Production and Logistics Management at Johannes Kepler University Linz, where she also serves as program director of the master's degree program in Economic and Business Analytics. She received her PhD from the University of Vienna in 2009 and completed her habilitation in 2016, following postdoctoral research at the IBM Center for Advanced Studies in Porto and a visiting professorship at the Vienna University of Economics and Business. Her research focuses on developing exact and heuristic optimization algorithms for complex logistics and transportation problems. Key areas include vehicle routing, green logistics, disaster relief distribution planning, scheduling, and multi-objective optimization. She has particular expertise in branch-and-bound, branch-and-price, column generation, and metaheuristics approaches to solve challenging combinatorial optimization problems. Dr. Parragh's publication record shows a consistent trend toward increasingly complex multi-objective problems, with recent work focusing on electric vehicle routing, multi-echelon production planning under uncertainty, and bi-objective facility location problems with applications in disaster relief. Her research bridges theoretical optimization methods with practical applications in logistics and transportation. Scientific Awards: ÖGOR (Austrian Society for Operations Research) dissertation prize doc.award from the University of Vienna Hertha Firnberg Postdoc fellowship from the Austrian Science Fund (FWF) Dr. Parragh has served as department editor for OR Spectrum and as associate editor for Transportation Science, Transportation Research Part B: Methodological, INFORMS Journal on Computing, and Networks. She has led and participated in numerous third-party funded research projects in operations research, including work in healthcare logistics, field staff routing, production planning, and electric vehicle routing. In 2021-2022, she co-organized the monthly VeRoLog webinar series, demonstrating her active engagement with the international operations research community. She maintains strong research collaborations across Europe, evidenced by her co-authored publications with researchers from institutions in Austria, France, Portugal, Denmark, and beyond. Her work consistently addresses both theoretical challenges in optimization and practical applications in industry and public service contexts.
Dr. Adel Aazami is an Assistant Professor at the Institute of Transport Economics and Logistics at Vienna University of Economics and Business (WU Vienna) since 2023. His academic journey began with a B.Sc. in Industrial Engineering from University of Tehran (2010-2014), followed by an M.Sc. (2014-2016) and Ph.D. (2016-2021) from Iran University of Science and Technology (IUST), Tehran. Prior to his current position, he worked as a Postdoctoral Researcher at Sharif University of Technology (2021-2022) and was a Visiting Researcher at the University of Toronto (2020). His educational background includes: Ph.D. in Industrial Engineering (2016-2021) - Iran University of Science and Technology (IUST), Tehran, Iran M.Sc. in Industrial Engineering (2014-2016) - Iran University of Science and Technology (IUST), Tehran, Iran B.Sc. in Industrial Engineering (2010-2014) - University of Tehran, Tehran, Iran Dr. Aazami's research spans multiple interconnected domains within operations research and supply chain management. His primary focus areas include Operations Research and Optimization, Supply Chain and Logistics, Production and Distribution/Transportation Planning, Competition and Game Theory, Stochastic Programming, and Decomposition Algorithms. His work demonstrates a strong emphasis on developing mathematical models and optimization algorithms for complex supply chain problems, particularly those involving perishable goods, competitive environments, and sustainability considerations. He has made significant contributions to integrating environmental factors into traditional logistics problems and developing robust optimization approaches for supply chain networks. Analysis of Dr. Aazami's publication record reveals a consistent trajectory of increasingly sophisticated research in supply chain optimization. His work shows a clear progression from foundational mathematical optimization techniques to increasingly complex integrated problems involving multiple stakeholders, uncertainty, and environmental considerations. A notable trend is his focus on perishable products within supply chains, developing models that account for limited product lifetimes while optimizing across multiple echelons of the supply chain. More recently, his research has expanded to incorporate green logistics considerations, developing algorithms that balance economic and environmental objectives in transportation and distribution problems. His notable scientific achievements include: Winner of the 'Best Student' award among nationwide students evaluated by the Iranian Ministry of Science (2020) Winner of the Iranian Nobel Prize (known as the Alborz National Foundation Prize) (2019) Winner of the Best Student Award at IUST (2018) Winner of the Top Researcher Award at IUST (2018) Annual Awards of the National Elites Foundation Iran (2015-2020) Dr. Aazami has extensive teaching experience across multiple Iranian universities including Tehran University, Amirkabir Technical University, Isfahan University, Yazd University, Zanjan University, Damghan University, Abrar University and Iran Technical University. His peer review activities include reviewing for prestigious journals such as Soft Computing, Expert Systems with Applications, and Annals of Operations Research. While specific grant information isn't detailed in the provided text, his research output suggests active engagement with complex optimization problems relevant to transportation and logistics industries. At WU Vienna, Dr. Aazami is part of the research team at the Institute of Transport Economics and Logistics, working alongside other faculty members including Prof. Kummer and Prof. Wakolbinger. His research integrates theoretical optimization methods with practical applications in transportation and logistics, contributing to the institute's focus on sustainable and efficient supply chain solutions.
Martin Bridson serves as President of the Clay Mathematics Institute since 2018 and holds the Whitehead Professorship of Pure Mathematics at the University of Oxford's Mathematical Institute, where he has been a Fellow of Magdalen College since 2007. Previously, he was Head of Oxford's Mathematical Institute (2015-2018), Professor of Pure Mathematics at Imperial College London (2002-2007), and Professor of Topology at Oxford (1999-2002). His academic journey began with undergraduate studies at Hertford College, Oxford, followed by PhD work at Cornell University. Bridson's research centers on Geometric Group Theory, Topology, and Spaces of Non-Positive Curvature. His work explores the deep connections between algebraic structures and geometric properties, particularly focusing on metric geometry, profinite completions, and the topology of non-positively curved spaces. His influential monograph "Metric Spaces of Non-Positive Curvature" (co-authored with André Haefliger) has become a foundational text in the field. His recent publications (2024-2025) demonstrate continued leadership in geometric group theory, with significant contributions to profinite rigidity, CAT(0) geometry, and automorphism groups. These works reveal evolving research directions toward computational aspects of group theory and deeper connections with low-dimensional topology. Steele Prize for Mathematical Exposition (2020, with Haefliger) Fellow of the Royal Society (2016) Fellow of the American Mathematical Society (2015) Royal Society Wolfson Research Merit Award (2012) London Mathematical Society Whitehead Prize (1999) Bridson has secured major research funding including EPSRC Senior Fellowships (2007-2012, 1997-2002), EPSRC Platform Grants (2010-2015), and multiple NSF grants. His leadership extends to directing the Mathematical Institute at Oxford and presiding over the Clay Mathematics Institute, where he influences global mathematical research directions. His collaborative work spans institutions including Princeton, Geneva, and Lausanne, reflecting his international research network.
Leonhard Summerer is an Associate Professor at the Faculty of Mathematics, Department of Mathematics . His research primarily focuses on Diophantine Approximation , Geometry of Numbers , and Parametric Approximation . His work explores the Approximation Property in parametric settings, Lattice Theory , and Linear Dependence in number theory. Recent publications include studies on Jarník’s identity, simultaneous approximation to multiple reals, and geometric interpretations of number-theoretic problems. He has authored numerous peer-reviewed articles and contributed chapters to educational books such as 77-mal Mathematik für Zwischendurch , emphasizing mathematical outreach and pedagogical innovation . Active in academic discourse, he has delivered talks on topics like Packings and Tilings in Z and Simultane Approximation m reeller Zahlen since 2006.
Christos H. Papadimitriou is a prominent academic currently serving as the Donovan Family Professor of Computer Science at Columbia University. He has held prestigious positions at institutions including UC Berkeley, UC San Diego, Stanford University, and MIT. His research spans the theory of algorithms, computational complexity, and game theory, with significant contributions to databases and optimization. Education: Electrical Engineering at National Technical University of Athens, Ph.D. in Computer Science from Princeton University. Papadimitriou's work bridges computer science with economics, focusing on computational complexity and game theory. His influential textbooks, such as Elements of the Theory of Computation and Computational Complexity and Combinatorial Optimization , remain foundational resources. Awards: Knuth Prize, Gödel Prize (jointly with Elias Koutsoupias), IEEE Charles Babbage Award, Kalai Game Theory and Computer Science Prize, IEEE John von Neumann Medal, and multiple honorary doctorates from institutions like ETH Zurich and EPFL. Memberships: American Academy of Arts and Sciences, US National Academy of Engineering, Academia Europaea, and US National Academy of Sciences. With over 300 publications and 25,000 citations, his novel Turing (2003) also highlights his interdisciplinary creativity.
