default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFloor Eijkelboom
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c7]Floor Eijkelboom, Heiko Zimmermann, Sharvaree Vadgama, Erik J. Bekkers, Max Welling, Christian A. Naesseth, Jan-Willem van de Meent:
Controlled Generation with Equivariant Variational Flow Matching. ICML 2025- [c6]Andrés Guzmán-Cordero, Floor Eijkelboom, Jan-Willem van de Meent:
Exponential Family Variational Flow Matching for Tabular Data Generation. ICML 2025 - [i9]Olga Zaghen, Floor Eijkelboom, Alison Pouplin, Erik J. Bekkers:
Towards Variational Flow Matching on General Geometries. CoRR abs/2502.12981 (2025) - [i8]Andrés Guzmán-Cordero, Floor Eijkelboom, Jan-Willem van de Meent:
Exponential Family Variational Flow Matching for Tabular Data Generation. CoRR abs/2506.05940 (2025) - [i7]Floor Eijkelboom, Heiko Zimmermann, Sharvaree Vadgama, Erik J. Bekkers, Max Welling, Christian A. Naesseth, Jan-Willem van de Meent:
Controlled Generation with Equivariant Variational Flow Matching. CoRR abs/2506.18340 (2025) - [i6]Razvan-Andrei Matisan, Vincent Tao Hu, Grigory Bartosh, Björn Ommer, Cees G. M. Snoek, Max Welling, Jan-Willem van de Meent, Mohammad Mahdi Derakhshani, Floor Eijkelboom:
Purrception: Variational Flow Matching for Vector-Quantized Image Generation. CoRR abs/2510.01478 (2025) - 2024
- [c5]Cong Liu, David Ruhe, Floor Eijkelboom, Patrick Forré:
Clifford Group Equivariant Simplicial Message Passing Networks. ICLR 2024 - [c4]Floor Eijkelboom, Grigory Bartosh, Christian Andersson Naesseth, Max Welling, Jan-Willem van de Meent:
Variational Flow Matching for Graph Generation. NeurIPS 2024 - [i5]Cong Liu, David Ruhe, Floor Eijkelboom, Patrick Forré:
Clifford Group Equivariant Simplicial Message Passing Networks. CoRR abs/2402.10011 (2024) - [i4]Veljko Kovac, Erik J. Bekkers, Pietro Liò, Floor Eijkelboom:
E(n) Equivariant Message Passing Cellular Networks. CoRR abs/2406.03145 (2024) - [i3]Floor Eijkelboom, Grigory Bartosh, Christian Andersson Naesseth, Max Welling, Jan-Willem van de Meent:
Variational Flow Matching for Graph Generation. CoRR abs/2406.04843 (2024) - 2023
- [c3]Floor Eijkelboom, Rob Hesselink, Erik J. Bekkers:
E(n) Equivariant Message Passing Simplicial Networks. ICML 2023: 9071-9081 - [c2]Floor Eijkelboom, Erik J. Bekkers, Michael M. Bronstein, Francesco Di Giovanni:
Can strong structural encoding reduce the importance of Message Passing? TAG-ML 2023: 278-288 - [i2]Floor Eijkelboom, Rob Hesselink, Erik J. Bekkers:
E(n) Equivariant Message Passing Simplicial Networks. CoRR abs/2305.07100 (2023) - [i1]Floor Eijkelboom, Erik J. Bekkers, Michael M. Bronstein, Francesco Di Giovanni:
Can strong structural encoding reduce the importance of Message Passing? CoRR abs/2310.15197 (2023) - 2022
- [c1]Piyush Bagad, Floor Eijkelboom, Mark Fokkema, Danilo de Goede, Paul Hilders
, Miltiadis Kofinas:
C-3PO: Towards Rotation Equivariant Feature Detection and Description. ECCV Workshops (4) 2022: 694-705
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-12-08 11:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
