![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Florian Wetzels
Person information
- affiliation: TU Kaiserslautern, Germany
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j4]Jonas Lukasczyk
, Michael Will
, Florian Wetzels
, Gunther H. Weber
, Christoph Garth
:
ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs. IEEE Trans. Vis. Comput. Graph. 30(1): 1085-1094 (2024) - [j3]Florian Wetzels
, Mathieu Pont
, Julien Tierny
, Christoph Garth
:
Merge Tree Geodesics and Barycenters with Path Mappings. IEEE Trans. Vis. Comput. Graph. 30(1): 1095-1105 (2024) - 2022
- [j2]Florian Wetzels
, Heike Leitte
, Christoph Garth
:
Branch Decomposition-Independent Edit Distances for Merge Trees. Comput. Graph. Forum 41(3): 367-378 (2022) - 2020
- [j1]Anna Pia Lohfink
, Florian Wetzels
, Jonas Lukasczyk
, Gunther H. Weber
, Christoph Garth
:
Fuzzy Contour Trees: Alignment and Joint Layout of Multiple Contour Trees. Comput. Graph. Forum 39(3): 343-355 (2020)
Conference and Workshop Papers
- 2021
- [c2]Markus Anders, Pascal Schweitzer, Florian Wetzels
:
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. ICALP 2021: 15:1-15:15 - [c1]Anna Pia Lohfink, Frederike Gartzky, Florian Wetzels, Luisa Vollmer, Christoph Garth
:
Time-Varying Fuzzy Contour Trees. IEEE VIS (Short Papers) 2021: 86-90
Informal and Other Publications
- 2023
- [i6]Florian Wetzels, Mathieu Pont, Julien Tierny, Christoph Garth
:
Merge Tree Geodesics and Barycenters with Path Mappings. CoRR abs/2308.03672 (2023) - [i5]Florian Wetzels, Markus Anders, Christoph Garth
:
Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance. CoRR abs/2308.08484 (2023) - 2022
- [i4]Florian Wetzels, Heike Leitte, Christoph Garth
:
Branch Decomposition-Independent Edit Distances for Merge Trees. CoRR abs/2204.02919 (2022) - [i3]Florian Wetzels, Christoph Garth
:
A Deformation-based Edit Distance for Merge Trees. CoRR abs/2208.05850 (2022) - 2021
- [i2]Markus Anders, Pascal Schweitzer, Florian Wetzels:
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. CoRR abs/2103.10244 (2021) - [i1]Anna Pia Lohfink, Frederike Gartzky, Florian Wetzels, Luisa Vollmer, Christoph Garth:
Time-Varying Fuzzy Contour Trees. CoRR abs/2107.12682 (2021)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint