default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnrico Facca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Enrico Facca, Gabriele Todeschi, Andrea Natale
, Michele Benzi:
Efficient Preconditioners for Solving Dynamical Optimal Transport via Interior Point Methods. SIAM J. Sci. Comput. 46(3): 1397- (2024)- [i11]Enrico Facca, Jan Martin Nordbotten, Erik Andreas Hanson:
Network Inpainting via Optimal Transport. CoRR abs/2405.13520 (2024) - 2023
- [i10]Federico Piazzon, Enrico Facca, Mario Putti:
Computing the L1 optimal transport density: a FEM approach. CoRR abs/2304.14047 (2023) - 2022
- [j7]Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande:
Physarum-inspired multi-commodity flow dynamics. Theor. Comput. Sci. 920: 1-20 (2022) - [i9]Daniela Leite, Diego Baptista, Abdullahi Adinoyi Ibrahim, Enrico Facca, Caterina De Bacco:
Community Detection in networks by Dynamical Optimal Transport Formulation. CoRR abs/2205.08468 (2022) - [i8]Enrico Facca, Gabriele Todeschi, Andrea Natale, Michele Benzi:
Efficient preconditioners for solving dynamical optimal transport via interior point methods. CoRR abs/2209.00315 (2022) - 2021
- [j6]Enrico Facca, Franco Cardin, Mario Putti:
Branching structures emerging from a continuous optimal transport model. J. Comput. Phys. 447: 110700 (2021) - [j5]Enrico Facca, Michele Benzi:
Fast Iterative Solution of the Optimal Transport Problem on Graphs. SIAM J. Sci. Comput. 43(3): A2295-A2319 (2021) - [i7]Luca Berti, Enrico Facca, Mario Putti:
Numerical Solution of the L1-Optimal Transport Problem on Surfaces. CoRR abs/2106.06479 (2021) - [i6]Enrico Facca, Luca Berti, Francesco Fassò, Mario Putti:
Computing the Cut Locus of a Riemannian Manifold via Optimal Transport. CoRR abs/2106.07510 (2021) - 2020
- [j4]Enrico Facca, Sara Daneri, Franco Cardin, Mario Putti:
Numerical Solution of Monge-Kantorovich Equations via a Dynamic Formulation. J. Sci. Comput. 82(3): 68 (2020) - [j3]Enrico Facca, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Convergence of the non-uniform directed Physarum model. Theor. Comput. Sci. 816: 184-194 (2020) - [i5]Diego Baptista, Daniela Leite, Enrico Facca, Mario Putti, Caterina De Bacco:
Network extraction by routing optimization. CoRR abs/2005.02805 (2020) - [i4]Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande:
Physarum Multi-Commodity Flow Dynamics. CoRR abs/2009.01498 (2020) - [i3]Enrico Facca, Michele Benzi:
Fast Iterative Solution of the Optimal Transport Problem on Graphs. CoRR abs/2009.13478 (2020) - [i2]Alessandro Lonardi, Enrico Facca, Mario Putti, Caterina De Bacco:
Optimal transport for multi-commodity routing on networks. CoRR abs/2010.14377 (2020)
2010 – 2019
- 2019
- [j2]Luca Bergamaschi, Enrico Facca, Angeles Martinez, Mario Putti:
Spectral preconditioners for the efficient numerical solution of a continuous branched transport model. J. Comput. Appl. Math. 354: 259-270 (2019) - [i1]Enrico Facca, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Convergence of the Non-Uniform Directed Physarum Model. CoRR abs/1906.07781 (2019) - 2018
- [j1]Enrico Facca, Franco Cardin, Mario Putti:
Towards a Stationary Monge-Kantorovich Dynamics: The Physarum Polycephalum Experience. SIAM J. Appl. Math. 78(2): 651-676 (2018)
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 2024-06-19 21:04 CEST 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:
