default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBarbara Di Fabio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c8]Barbara Di Fabio, Claudia Landi:
Reeb Graphs of Piecewise Linear Functions. GbRPR 2017: 23-35- 2016
- [j4]Barbara Di Fabio, Claudia Landi
:
The Edit Distance for Reeb Graphs of Surfaces. Discret. Comput. Geom. 55(2): 423-461 (2016) - [c7]Ulrich Bauer, Barbara Di Fabio, Claudia Landi:
An Edit Distance for Reeb Graphs. 3DOR@Eurographics 2016 - [c6]Mattia G. Bergomi, Adriano Baratè, Barbara Di Fabio:
Towards a Topological Fingerprint of Music. CTIC 2016: 88-100 - [i5]Mattia G. Bergomi, Adriano Baratè, Barbara Di Fabio:
Towards a topological fingerprint of music. CoRR abs/1602.00739 (2016) - 2015
- [c5]Barbara Di Fabio, Massimo Ferri:
Comparing Persistence Diagrams Through Complex Vectors. ICIAP (1) 2015: 294-305 - [i4]Barbara Di Fabio, Massimo Ferri:
Comparing persistence diagrams through complex vectors. CoRR abs/1505.01335 (2015) - 2014
- [j3]Andrea Cerri, Barbara Di Fabio, Grzegorz Jablonski, Filippo Medri:
Comparing shapes through multi-scale approximations of the matching distance. Comput. Vis. Image Underst. 121: 43-56 (2014) - [c4]Barbara Di Fabio, Claudia Landi:
Stable Shape Comparison of Surfaces via Reeb Graphs. DGCI 2014: 202-213 - [i3]Barbara Di Fabio, Claudia Landi:
The edit distance for Reeb graphs of surfaces. CoRR abs/1411.1544 (2014) - 2013
- [i2]Barbara Di Fabio, Patrizio Frosini:
Filtrations induced by continuous functions. CoRR abs/1304.1268 (2013) - 2012
- [j2]Barbara Di Fabio, Claudia Landi:
Persistent homology and partial similarity of shapes. Pattern Recognit. Lett. 33(11): 1445-1450 (2012) - [c3]Andrea Cerri, Barbara Di Fabio, Filippo Medri:
Multi-scale Approximation of the Matching Distance for Shape Retrieval. CTIC 2012: 128-138 - [e1]Massimo Ferri, Patrizio Frosini, Claudia Landi, Andrea Cerri, Barbara Di Fabio:
Computational Topology in Image Context - 4th International Workshop, CTIC 2012, Bertinoro, Italy, May 28-30, 2012. Proceedings. Lecture Notes in Computer Science 7309, Springer 2012, ISBN 978-3-642-30237-4 [contents] - 2011
- [j1]Barbara Di Fabio, Claudia Landi:
A Mayer-Vietoris Formula for Persistent Homology with an Application to Shape Recognition in the Presence of Occlusions. Found. Comput. Math. 11(5): 499-527 (2011) - 2010
- [c2]Barbara Di Fabio, Claudia Landi:
Stability of Reeb Graphs of Closed Curves. GETCO 2010: 71-76 - [i1]Barbara Di Fabio, Claudia Landi:
Stability of Reeb graphs under function perturbations: the case of closed curves. CoRR abs/1003.4610 (2010)
2000 – 2009
- 2009
- [c1]Barbara Di Fabio, Claudia Landi, Filippo Medri:
Recognition of Occluded Shapes Using Size Functions. ICIAP 2009: 642-651
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-04-24 22:51 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:
