default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabien Evrard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]Akshay Chandran, Fabien Evrard, Berend G. M. van Wachem:
A semi-analytical transient undisturbed velocity correction scheme for wall-bounded two-way coupled Euler-Lagrange simulations. J. Comput. Phys. 520: 113496 (2025)- 2023
- [j10]Christian Gorges, Azur Hodzic, Fabien Evrard, Berend G. M. van Wachem, Clara M. Velte
, Fabian Denner:
Efficient reduction of vertex clustering using front tracking with surface normal propagation restriction. J. Comput. Phys. 491: 112406 (2023) - [j9]Fabien Evrard, Robert Chiodi, Austin Han, Berend G. M. van Wachem, Olivier Desjardins:
First Moments of a Polyhedron Clipped by a Paraboloid. SIAM J. Sci. Comput. 45(5): 2250- (2023) - [c3]Julia Reuter, Hani Elmestikawy, Fabien Evrard, Sanaz Mostaghim, Berend G. M. van Wachem:
Graph Networks as Inductive Bias for Genetic Programming: Symbolic Models for Particle-Laden Flows. EuroGP 2023: 36-51 - 2022
- [j8]Christian Gorges, Fabien Evrard, Berend G. M. van Wachem, Fabian Denner:
Reducing volume and shape errors in front tracking by divergence-preserving velocity interpolation and parabolic fit vertex positioning. J. Comput. Phys. 457: 111072 (2022) - [j7]Fabian Denner, Fabien Evrard, Berend G. M. van Wachem:
Breaching the capillary time-step constraint using a coupled VOF method with implicit surface tension. J. Comput. Phys. 459: 111128 (2022) - [c2]Julia Reuter, Manoj Cendrollu, Fabien Evrard, Sanaz Mostaghim, Berend G. M. van Wachem:
Towards Improving Simulations of Flows around Spherical Particles Using Genetic Programming. CEC 2022: 1-8 - 2021
- [c1]Heiner Zille, Sanaz Mostaghim, Fabien Evrard, Berend G. M. van Wachem:
Unit-aware multi-objective genetic programming for the prediction of the stokes flow around a sphere. GECCO Companion 2021: 327-328 - 2020
- [j6]Fabian Denner, Fabien Evrard, Berend G. M. van Wachem:
Conservative finite-volume framework and pressure-based algorithm for flows of incompressible, ideal-gas and real-gas fluids at all speeds. J. Comput. Phys. 409: 109348 (2020) - [j5]Fabien Evrard, Fabian Denner, Berend G. M. van Wachem:
Height-function curvature estimation with arbitrary order on non-uniform Cartesian grids. J. Comput. Phys. X 7: 100060 (2020) - [j4]Fabien Evrard, Fabian Denner, Berend G. M. van Wachem:
Euler-Lagrange modelling of dilute particle-laden flows with arbitrary particle-size to mesh-spacing ratio. J. Comput. Phys. X 8: 100078 (2020)
2010 – 2019
- 2019
- [j3]Mohd Hazmil Abdol-Azis, Fabien Evrard, Berend G. M. van Wachem:
An immersed boundary method for incompressible flows in complex domains. J. Comput. Phys. 378: 770-795 (2019) - [j2]Fabien Evrard, Fabian Denner, Berend G. M. van Wachem:
Surface Reconstruction from Discrete Indicator Functions. IEEE Trans. Vis. Comput. Graph. 25(3): 1629-1635 (2019) - 2017
- [j1]Fabien Evrard, Fabian Denner, Berend G. M. van Wachem:
Estimation of curvature from volume fractions using parabolic reconstruction on two-dimensional unstructured meshes. J. Comput. Phys. 351: 271-294 (2017)
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-01-09 13:10 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:
