Остановите войну!
for scientists:
default search action
Johann Gamper
- > Home > Persons > Johann Gamper
Publications
- 2022
- [j32]David B. Blumenthal, Sébastien Bougleux, Anton Dignös, Johann Gamper:
Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching. Inf. Sci. 596: 202-221 (2022) - [c76]Christina Khnaisser, Hind Hamrouni, David B. Blumenthal, Anton Dignös, Johann Gamper:
Querying Temporal Anomalies in Healthcare Information Systems and Beyond. ADBIS 2022: 209-222 - 2021
- [j28]David B. Blumenthal, Johann Gamper, Sébastien Bougleux, Luc Brun:
Upper Bounding Graph Edit Distance Based on Rings and Machine Learning. Int. J. Pattern Recognit. Artif. Intell. 35(8): 2151008:1-2151008:32 (2021) - [j27]David B. Blumenthal, Nicolas Boria, Sébastien Bougleux, Luc Brun, Johann Gamper, Benoit Gaüzère:
Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing. Inf. Syst. 100: 101766 (2021) - 2020
- [j25]David B. Blumenthal, Johann Gamper:
On the exact computation of the graph edit distance. Pattern Recognit. Lett. 134: 46-57 (2020) - [j24]David B. Blumenthal, Nicolas Boria, Johann Gamper, Sébastien Bougleux, Luc Brun:
Comparing heuristics for graph edit distance computation. VLDB J. 29(1): 419-458 (2020) - [j23]Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser, David B. Blumenthal:
Finding k-shortest paths with limited overlap. VLDB J. 29(5): 1023-1047 (2020) - 2019
- [c70]David B. Blumenthal, Sébastien Bougleux, Johann Gamper, Luc Brun:
GEDLIB: A C++ Library for Graph Edit Distance Computation. GbRPR 2019: 14-24 - [i3]David B. Blumenthal, Sébastien Bougleux, Johann Gamper, Luc Brun:
Upper Bounding GED via Transformations to LSAPE Based on Rings and Machine Learning. CoRR abs/1907.00203 (2019) - 2018
- [j18]David B. Blumenthal, Johann Gamper:
Improved Lower Bounds for Graph Edit Distance. IEEE Trans. Knowl. Data Eng. 30(3): 503-516 (2018) - [c67]Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser, David B. Blumenthal:
Finding k-dissimilar paths with minimum collective length. SIGSPATIAL/GIS 2018: 404-407 - [c66]David B. Blumenthal, Évariste Daller, Sébastien Bougleux, Luc Brun, Johann Gamper:
Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem. ICPR 2018: 934-939 - [c64]David B. Blumenthal, Sébastien Bougleux, Johann Gamper, Luc Brun:
Ring Based Approximation of Graph Edit Distance. S+SSPR 2018: 293-303 - [i2]Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser, David B. Blumenthal:
Finding k-Dissimilar Paths with Minimum Collective Length. CoRR abs/1809.06831 (2018) - 2017
- [c57]David B. Blumenthal, Johann Gamper:
Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs. GbRPR 2017: 211-221 - [c56]David B. Blumenthal, Johann Gamper:
Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance. ICDE 2017: 131-134
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-21 17:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint