Pierre-Antoine Absil is a Full Professor at the Louvain Polytechnic School (EPL) , part of the Université catholique de Louvain (UCLouvain) , affiliated with the Mathematical Engineering Center (INMA) and the Institute of Information and Communication Technologies, Electronics and Applied Mathematics (ICTEAM) . His research spans Riemannian optimization , matrix manifolds , and low-rank approximation with applications in astronomical imaging , signal processing , and environmental data imputation . His work emphasizes Riemannian optimization algorithms matrix and tensor completion geometric data analysis applications in astrophysics and bioinformatics Recent publications focus on Stiefel and Grassmann manifolds , variable projection methods , and exoplanet detection via alternating minimization . While no explicit scientific awards are listed, his collaborations with institutions like IEEE and Springer highlight his impact in computational mathematics and engineering. He has supervised researchers such as Simon Vary , Guillaume Olikier , and Valentin Christiaens through projects in direct imaging , economic dispatch , and graph-based data processing . His laboratory, INMA , drives methodological advances in manifold-valued data analysis and nonlinear optimization .
Peter Bienstman is a full professor at Ghent University, working in the Department of Information Technology (INTEC) where he has been since 1997. He is affiliated with the Photonics Research Group and also collaborates with imec. His research spans nanophotonics, neuromorphic computing, and biosensing applications. Bienstman received his electrical engineering degree from Ghent University in 1997 and completed his Ph.D. at the same institution in 2001. His doctoral work focused on "Rigorous and efficient modelling of wavelength scale photonic components." His research interests primarily revolve around nanophotonics and its applications, with specific focus areas including: Photonic Reservoir Computing for neuromorphic information processing Optical label-free biosensors based on ring resonators TE/TM biosensors for measuring conformational changes SiN biosensors operating in the visible spectrum Optical spiking neurons and neuromorphic architectures Nanophotonic information processing systems Analysis of his recent publications reveals a strong focus on advancing photonic reservoir computing for practical applications, particularly in communications signal processing and biomedical sensing. His work demonstrates how photonic systems can implement neuromorphic computing paradigms with energy efficiency advantages over traditional electronics. Recent trends show increasing integration of phase-change materials and exploration of quantum-inspired photonic computing approaches. Bienstman has received significant recognition for his work, most notably an ERC Starting Grant for the Naresco-project: "Novel paradigms for massively parallel nanophotonic information processing." This prestigious European grant supports his innovative research at the intersection of photonics and computing. As an advisor, Bienstman has supervised numerous doctoral students to completion and currently mentors a large research group with nine active PhD students and two postdoctoral researchers. His research is supported by multiple grants that enable the development of novel photonic computing architectures and biosensing platforms. The group's work bridges fundamental photonics research with practical applications in communications, healthcare, and computing. The Photonics Research Group at Ghent University, where Bienstman works, maintains state-of-the-art facilities for nanophotonic device design, fabrication, and characterization. The group collaborates extensively with imec and other international research institutions, creating a vibrant ecosystem for advancing photonic technologies from fundamental research to potential commercial applications.
Chris Cornelis is a full-time Professor in fuzziness and uncertainty modelling at Ghent University's Department of Applied Mathematics, Computer Science and Statistics. His research integrates fuzzy logic and rough set theory to advance machine learning methodologies for complex data analysis. Education: M.Sc. in Computer Science, Ghent University (2000) Ph.D. in Computer Science, Ghent University (2004) Research Focus: Cornelis pioneers fuzzy-rough hybrid systems for uncertainty handling in machine learning. His work spans theoretical foundations (e.g., implication operators, granular approximations) and practical applications including emotion detection, medical diagnosis, and imbalanced data classification. Key innovations include FRNN-OWA classifiers and polar encoding for missing values, demonstrating exceptional versatility in bridging abstract mathematics with real-world AI challenges. Publication Trends: Recent work (2023-2025) reveals intensified exploration of topological data analysis (Mapper-based rough sets), advanced granular computing (disjoint/adjacent fuzzy granules), and ethical AI ("No Imputation Without Representation"). His research shows consistent progression from foundational fuzzy-rough theory toward multi-disciplinary applications while maintaining mathematical rigor, particularly in Choquet integration and quantifier-based frameworks. Scientific Awards: No specific awards were documented in the provided sources. Research Support: Cornelis has secured competitive funding including FWO postdoctoral mandates, a Ramón y Cajal contract at the University of Granada, and an FWO Odysseus Type II project at Ghent University. These grants enabled foundational work in fuzzy-rough set theory and its applications to complex data problems. Research Unit: He leads research within Ghent University's Computational Web Intelligence (CWI) unit, focusing on intelligent data analysis systems that leverage fuzzy-rough methodologies for web-scale information processing.
Samuel Fiorini is Associate Professor in the Department of Mathematics at the Université libre de Bruxelles (ULB) , member of the Algebra and Combinatorics group (CP 216). His research centres on polyhedral combinatorics, extended formulations, combinatorial optimisation and approximation algorithms , with frequent overlap into structural graph theory. Research in depth: Fiorini’s work explores how high-dimensional polytopes can sometimes be expressed compactly through extended formulations, proving exponential lower bounds when they cannot. He has contributed new approximation algorithms for classical problems such as vertex cover, clique transversal and odd-cycle packing, and has advanced the understanding of sorting and entropy in partially ordered sets. His papers often combine tools from graph minors, communication complexity and polyhedral theory. Scientific recognition: Best Paper Award, 44th ACM Symposium on Theory of Computing (STOC 2012) Programme committees: FOCS, IPCO, APPROX, STACS, WAOA Organiser, Sixth Cargese Workshop on Combinatorial Optimization Advising & grants: He currently supervises PhD students Carole Muller and Matthew Drescher and has mentored six completed PhDs as well as more than a dozen post-doctoral researchers. His group has been supported by an ERC starting grant and other national and international projects focusing on polyhedral approaches to hard optimisation problems. Lab & team: Fiorini leads a vibrant team within the Algebra and Combinatorics cluster at ULB, maintaining active collaborations with researchers worldwide and hosting frequent visitors working on discrete optimisation and polyhedral combinatorics.
Bart Bogaerts is an Associate Professor in the Department of Computer Science at KU Leuven's Faculty of Engineering Science. He is affiliated with the Declarative Languages and Artificial Intelligence (DTAI) research unit and is a member of Leuven.AI - KU Leuven Institute for Artificial Intelligence. Bogaerts serves on the Council of the Faculty of Engineering Science as senior academic staff and participates in the Programme Committee for Artificial Intelligence curriculum development. His research focuses on foundational aspects of logic programming and knowledge representation, with particular expertise in approximation fixpoint theory, higher-order logic programming, and non-monotonic reasoning. Bogaerts investigates the theoretical underpinnings of stable model semantics, justification frameworks, and executable query languages. His work bridges theoretical computer science with practical applications in artificial intelligence and knowledge-based systems. Bogaerts' publication record demonstrates consistent contributions to top venues in logic programming and artificial intelligence. His recent work shows increasing focus on category-theoretic approaches to approximation theory, distributed web traversal specifications, and certified model expansion techniques. The publications reveal a strong emphasis on formal methods with applications spanning from theoretical mathematics to practical AI systems. As a promotor for multiple significant research projects, Bogaerts leads investigations into certified answer set programming (CertifASP), first-order model expansion (CertiFOX), proof generation for combinatorial optimization, distributed configuration problems, and knowledge integration paradigms. These projects, funded through 2028-2029, demonstrate his leadership in advancing the theoretical foundations of AI and logic programming. Bogaerts is actively involved in teaching courses on knowledge representation and reasoning, contributing to the development of next-generation AI researchers. His work within the DTAI research unit positions him at the forefront of declarative AI approaches in Belgium's leading research university.
Nicolas Cerf is a Full Professor at the Ecole Polytechnique de Bruxelles, Université Libre de Bruxelles (ULB), where he heads the Centre for Quantum Information and Communication (QuIC). He has been a faculty member at ULB since 1998, initially as an associate professor and promoted to full professor in 2009. Cerf maintains visiting appointments at Caltech, MIT, and the University of Arizona, demonstrating his international standing in the quantum information community. His educational background includes a M.Eng. in Electronics and Telecommunication (1987), M.Sc. in Physics (1988), and Ph.D. in Physics (1993), all from ULB. After his PhD, he was awarded a Marie Curie fellowship and worked at the University of Paris XI, followed by research faculty positions at Caltech before returning to ULB. Nicolas Cerf's research focuses on quantum information science, with significant contributions including the discovery of the role of negative (conditional) entropies in quantum information theory, development of continuous-variable quantum cloning and cryptographic protocols, invention of the adiabatic quantum search algorithm, and establishing the fundamental quantum limit on information transmission via Gaussian bosonic channels. His work spans quantum information theory, quantum cryptography, quantum computation, quantum optics, and quantum foundations. His recent publications (2023-2025) demonstrate continued innovation in quantum information processing, particularly in boson sampling validation, Wigner entropy theory, majorization applications, and quantum channel capacities. These works show a consistent focus on both theoretical foundations and practical applications of quantum information principles. Marie Curie Excellence Award (2006) Caltech President's Fund award (1997) Alcatel-Bell scientific prize (1999) Prize of the Wernaers fund awarded by the Belgian National Fund for Scientific Research (FNRS) (2000) Elected member of the Royal Academies for Science and the Arts of Belgium (2009) COVAQIAL project nominee for 2007 Descartes Prize Nicolas Cerf has supervised numerous PhD students including Sofyan Iblisdir, Jérémie Roland, Gilles Van Assche, and many others. He has hosted many postdocs and senior scientists. His research has been supported by numerous European projects across multiple Framework Programs, including EQUIP, CHIC, RESQ, SECOQC, COVAQIAL, QAP, COMPAS, HIPERCOM, QALGO, QUCHIP, ShoQC, and AppQInfo. As head of QuIC, Cerf leads a research team exploring cutting-edge topics in quantum information. The group maintains strong international collaborations and has been instrumental in establishing Belgium as a significant player in quantum information research. The team's work bridges theoretical developments with potential applications in quantum communication, quantum computing, and quantum cryptography.
Sophie de Buyl is an Associate Professor at the Vrije Universiteit Brussel (VUB), actively contributing to interdisciplinary research bridging theoretical physics and biological systems. She is affiliated with the Department of Bio-engineering Sciences and the VUB Data Lab, focusing on mathematical modeling of biological processes, synthetic biology, and biophysics. PhD in Theoretical Physics (2006, Université Libre de Bruxelles) Postdoctoral experience at IHES, UC Santa Barbara, Harvard University Her research spans cosmological singularities, gauge/gravity correspondence, and black hole entropy in her early career, evolving to integrate theoretical physics with experimental biology. Current projects include synthetic gene regulatory circuits, microbial community dynamics, and embryonic development precision. Key publication trends (2025–2019) reflect dual expertise in mathematical physics (Kac-Moody algebras, black holes) and biological systems (microbial ecology, synthetic biology, circadian clocks). Awards highlight early-career recognition by the Belgian Physics Society and Belspo. Supervised FWO PhD projects on dynamic pathway regulation and microbial systems Director of the Interuniversity Institute of Bioinformatics in Brussels since 2020 Her work emphasizes data-driven discovery of general laws in biological systems, with collaborations spanning bioinformatics, microbiology, and computational modeling.
Ronald Cools is a Professor in the Department of Computer Science within the Science & Technology Group at KU Leuven (Katholieke Universiteit Leuven) in Belgium. His research spans numerical analysis, approximation theory, and computational mathematics, with a particular focus on lattice rules and quasi-Monte Carlo methods for high-dimensional problems. His work has significant applications in scientific computing, financial mathematics, and solving partial differential equations. Professor Cools' research interests center on developing efficient algorithms for high-dimensional integration and approximation. His work on lattice rules, component-by-component construction methods, and tent-transformed lattices has advanced the field of numerical analysis. He has made significant contributions to understanding the trigonometric degree of exactness, worst-case error analysis in various function spaces, and the development of practical algorithms for multivariate problems. His research bridges theoretical mathematical analysis with practical computational methods that address the curse of dimensionality in scientific computing. The analysis of his recent publications reveals a consistent focus on lattice-based algorithms for approximation and integration in high dimensions. His work demonstrates increasing sophistication in handling general weight parameters, extending methods to non-periodic settings, and developing faster construction algorithms. The research trajectory shows a progression from theoretical foundations to practical implementations with applications in PDEs, financial mathematics, and scientific computing. The publications exhibit strong international collaboration, particularly with researchers like Frances Kuo, Dirk Nuyens, and Ian Sloan. Professor Cools has supervised numerous PhD students, including Weiwen Mo, Laurence Wilkes, Yuya Suzuki, T. Nguyen, and Gowri Suryanarayana. His mentorship has produced significant contributions to the field of numerical analysis. While specific grant information isn't detailed in the provided text, his extensive publication record spanning multiple decades suggests sustained research funding supporting his work in computational mathematics. His research group at KU Leuven appears to be a hub for advanced computational mathematics, focusing on quasi-Monte Carlo methods, lattice rules, and high-dimensional approximation techniques. The collaborative nature of his publications indicates an active research team working on both theoretical aspects of numerical methods and their practical implementations.
Ben Page is an Associate Professor in the Department of Physics and Astronomy at Ghent University's Faculty of Sciences. His research focuses on theoretical particle physics, particularly in high-energy physics and scattering amplitudes. His research interests center around scattering amplitudes , Feynman integrals , and multi-loop calculations in quantum field theory. Page has made significant contributions to the development of computational methods for calculating scattering processes in quantum chromodynamics (QCD) and beyond. His work often involves the application of advanced mathematical techniques from algebraic geometry and p-adic numbers to solve complex problems in particle physics. An analysis of his recent publications reveals a strong focus on two-loop and higher-order calculations for multi-particle processes at hadron colliders. His research spans both standard model processes (like top quark, Higgs boson, and W/Z boson production) and more theoretical explorations of quantum gravity. Page frequently collaborates with an international team of researchers, particularly with Samuel Abreu, Harald Ita, and others in the field of amplitude calculations. Page has been actively developing computational frameworks like Caravel, a C++ framework for multi-loop amplitude calculations using numerical unitarity methods. His work has important applications for precision physics at the Large Hadron Collider and future colliders, where higher-order corrections are essential for matching experimental precision.
Bart Bogaerts is a Professor at the Vrije Universiteit Brussel , affiliated with the Federated Labs AI and Robotics and the Department of Informatics and Applied Informatics . His research centers on Approximation Theory , Logic Programming , Knowledge Representation , and Constraint Satisfaction Problems , with a focus on formalizing reasoning methods and optimizing computational systems. His recent publications emphasize certified algorithms, semantic web traversal, and formal verification, reflecting collaborations with institutions like KU Leuven and Maastricht University. Key themes include: Algorithm Certification : Integrating Coq for verified logic programming and optimization techniques. Web Technologies : Distributed subweb specifications and query processing frameworks. Nonmonotonic Reasoning : Advancing approximation fixpoint theory in knowledge representation. Scientific recognitions include the AAAI 2022 Distinguished Paper Award and the IJCAI 2021 Distinguished Paper Award . Dr. Bogaerts supervises PhD students such as Samuele Pollaci, Robbe Van Den Eede, and Dirk Vandesande in joint programs with VUB and KU Leuven.
Federico Holik serves as a Research Fellow at Argentina's National Scientific and Technical Research Council (CONICET) with primary affiliation to Vrije Universiteit Brussel (VUB) in Belgium. His institutional presence is anchored through VUB's CRIS profile and publications portal, reflecting active engagement in quantum research despite the absence of specified departmental or school affiliations within the university structure. His research program critically examines the logical, algebraic, and geometrical frameworks underpinning quantum mechanics, with concentrated efforts in quantum information theory and foundational probability interpretations. Key investigations include quantum resource management for NISQ-era devices, ontological indistinguishability of quantum entities, and the development of quantum mereology to address part-whole relationships in quantum systems. His interdisciplinary reach extends to quantum-inspired AI through quasi-set theory and epidemiological applications via information quantifiers in pandemic data analysis. Analysis of his 2023-2025 publications reveals two dominant trajectories: (1) practical quantum computing challenges centered on resource optimization, error mitigation, and software engineering frameworks for noisy hardware, and (2) deep foundational inquiries into quantum ontology, probability structures, and mereological paradoxes. This dual focus bridges theoretical rigor with emerging quantum technologies while maintaining strong connections to philosophical questions about quantum identity and agency.
Philippe CARA is a Professor at the Vrije Universiteit Brussel (VUB), affiliated with the Department of Mathematics & Data Science . His expertise spans algebra, geometry, computer algebra, and mathematical typesetting (LaTeX). He has contributed to research in near-vector spaces, semisymmetric graphs, and incidence geometry, with recent work on direct sums and quotient spaces of near-vector spaces. Expertise: Computer Algebra , Finite Incidence Geometry , Graph Theory , Mathematical Education . His research explores the interplay between algebraic structures, geometric representations, and computational methods. Notable projects include the FinInG package for finite incidence geometry and studies on generalized total colorings of planar graphs. Scientific awards include the AT&T Research Award 2001 , the Gold Medal of the European Cultural Renaissance (Research Category, 2003) , and the VUB Ingace Vanderschueren Award 2002 . He has supervised master’s theses by A. Darras and L. Vandewalle , and participated in organizing events like the Conference 'Finite Geometry and Friends' (2019). His work also includes collaborations with institutions such as the University of The Free State (postdoctoral fellowship, 2017–2019).
Tim Seynnaeve is a postdoctoral researcher at KU Leuven, holding a dual affiliation with the Department of Computer Science and Mathematics. He serves as an FWO special research associate within the Numerical Analysis and Applied Mathematics (NUMA) research unit at the Arenberg campus. Previously, he completed his PhD at the Max Planck Institute for Mathematics in the Sciences in Leipzig under the supervision of Mateusz Michałek and held a postdoctoral position at the Mathematical Institute of the University of Bern. His research focuses on the intersection of algebraic geometry with computational mathematics, particularly applied and combinatorial algebraic geometry. Seynnaeve's work bridges theoretical mathematics with practical applications in quantum information theory, tensor networks, and computational complexity. His approach combines deep theoretical insights with computational techniques to solve problems in matrix analysis, representation theory, and combinatorial structures. Seynnaeve's recent publications reveal a strong trend toward interdisciplinary work connecting algebraic geometry with quantum information science, statistical models, and computational complexity. His research on matrix product states, tensor spaces, and algebraic structures demonstrates how geometric methods can advance our understanding of quantum systems and computational algorithms. The recurring themes in his work include the application of Schubert calculus to statistical models, the geometry of tensor networks, and the algebraic foundations of matrix multiplication complexity. Seynnaeve actively contributes to the academic community through organizing seminars, including the NUMA seminar at KU Leuven since Fall 2022. He has mentored students such as Jonas Adams on projects related to Group-Invariant Tree Tensor Networks. His teaching experience spans multiple institutions, including courses on Algebra II, Representation Theory, and specialized workshops on nonlinear algebra and tensor applications. His academic work is organized around collaborative research projects with institutions including the Max Planck Institute for Mathematics in the Sciences and participation in numerous international conferences on algebraic geometry and its applications. Seynnaeve maintains active collaborations with researchers across Europe, particularly in the Netherlands, Germany, and Switzerland, contributing to a vibrant network focused on the applications of algebraic geometry to real-world problems.
Valentin Delchevalerie is a researcher at the Faculty of Computer Science, University of Namur , affiliated with the Research Center on Information Systems Engineering and the Namur Institute for Complex Systems. Their work focuses on integrating mathematical and physical principles into deep learning architectures. Key projects: Bessel-CNNs (rotation-invariant image recognition), Quaternion Convolutions for 3D imaging, and Cycle-Consistent GANs for anomaly detection. Research spans machine learning , image processing , and computational physics , with applications in both industrial process monitoring and medical diagnostics . Their publications emphasize rotation equivariance , fairness constraints , and visualization techniques . Notable collaborations include work with Benoît Frénay (UNamur), Adrien Mayer (UNamur), and teams in medical imaging and materials science . The 15 most recent articles highlight advancements in 3D image analysis , medical anomaly detection , and physics-informed neural networks .
Natacha Gesquière is a researcher affiliated with the University of Ghent (UGent), focusing on computational thinking, artificial intelligence in education, and interdisciplinary STEM learning. Her work bridges technology and pedagogy, particularly in K-12 contexts. Key research areas: Computational Thinking, Social Robotics, and AI-Driven Education Collaborates with UGent colleagues like Francis wyffels and Tom Neutens Active in developing educational frameworks and tools for teachers Her publications highlight applications of physical computing, social robotics, and universal quadratic forms in educational settings. She contributes to open-access resources and interdisciplinary teacher design teams.
