Floris Geerts
Scholar

Floris Geerts

Google Scholar ID: SGay8u4AAAAJ
University of Antwerp
Graph LearningDatabase Theory
Citations & Impact
All-time
Citations
2,378
 
H-index
24
 
i10-index
46
 
Publications
20
 
Co-authors
83
list available
Resume (English only)
Academic Achievements
  • - Towards Bridging Generalization and Expressivity of Graph Neural Networks, ICLR 2025
  • - Covered Forest: Fine-grained generalization analysis of graph neural networks, ICML 2025 (Spotlight poster)
  • - Data Management in the Noisy Intermediate-Scale Quantum Era, End. VLDB 2025
  • - DeepGraphLog for Layered Neurosymbolic AI, ECAI 2025
  • - From Features to Structure: Task-Aware Graph Construction for Relational and Tabular Learning with GNNs, Third International Workshop on Tabular Data Analysis 2025
  • - A neuro-symbolic framework for answering conjunctive queries, LOG 2024 (Best Paper Honorable Mention)
  • - A note on the VC dimension of 1-dimensional GNNs, 2024
  • - Weisfeiler-Leman at the margin: When more expressivity matters, ICML 2024
  • - The Power of Graph Learning, 2023 (Richard M. Karp Distinguished Lecture)
  • - The Expressive Power of Graph Learning, 2023 (Invited Tutorial at ACM Summer School on Data Science)
  • - A Query Language Perspective on Graph Learning, PODS 2023 (Invited Tutorial)
  • - WL meet VC, ICML 2023
  • - Ordered Subgraph Aggregation Networks, NeurIPS 2022
  • - Expressiveness and Approximation Properties of Graph Neural Networks, ICLR 2022 (Outstanding Paper Award)
  • - On the expressive power of message-passing neural networks as global feature map transformers, FoIKS 2022
  • - Graph Neural Networks with Local Graph Parameters, NeurIPS 2021
  • - On the Expressive Power of Linear Algebra on Graphs, Theory Comput. Syst. 2021 (Invited)
Research Experience
  • Organizing DBDBD 2025 in Antwerp this year.
Background
  • Professor at the University of Antwerp in the Department of Computer Science, part of Adrem Data Lab. Research focuses on the principles of data management and graph learning.