default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid B. Blumenthal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Anne Hartebrodt
, Richard Röttger, David B. Blumenthal:
Federated singular value decomposition for high-dimensional data. Data Min. Knowl. Discov. 38(3): 938-975 (2024)- [i10]Michael Hartung, Andreas Maier, Fernando Delgado-Chaves, Yuliya Burankova, Olga I. Isaeva, Fábio Malta de Sá Patroni, Daniel He, Casey Shannon, Katharina Kaufmann, Jens Lohmann, Alexey Savchik, Anne Hartebrodt, Zoe Chervontseva, Farzaneh Firoozbakht, Niklas Probul, Evgenia Zotova, Olga Tsoy, David B. Blumenthal, Martin Ester, Tanja Laske, Jan Baumbach, Olga I. Zolotareva:
UnPaSt: unsupervised patient stratification by differentially expressed biclusters in omics data. CoRR abs/2408.00200 (2024) - 2023
- [j17]Lisa Gerlach, David B. Blumenthal:
On the role of network topology in German-Jewish recommendation letter networks in the early twentieth century. Appl. Netw. Sci. 8(1): 24 (2023) - [j16]Nicolas Boria, Jana Kiederle, Florian Yger, David B. Blumenthal:
The edge-preservation similarity for comparing rooted, unordered, node-labeled trees. Pattern Recognit. Lett. 167: 189-195 (2023) - 2022
- [j15]Klaudia Adamowicz, Andreas Maier, Jan Baumbach, David B. Blumenthal:
Online in silico validation of disease and gene sets, clusterings or subnetworks with DIGEST. Briefings Bioinform. 23(4) (2022) - [j14]Judith Bernett, Dominik Krupke, Sepideh Sadegh, Jan Baumbach, Sándor P. Fekete, Tim Kacprowski, Markus List, David B. Blumenthal:
Robust disease module mining via enumeration of diverse prize-collecting Steiner trees. Bioinform. 38(6): 1600-1606 (2022) - [j13]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) - [c11]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 - [i9]Anne Hartebrodt, Richard Röttger, David B. Blumenthal:
Federated singular value decomposition for high dimensional data. CoRR abs/2205.12109 (2022) - 2021
- [j12]Olga Lazareva, Jan Baumbach, Markus List, David B. Blumenthal:
On the limits of active module identification. Briefings Bioinform. 22(5) (2021) - [j11]Olga Lazareva, Stefan Canzar, Kevin Yuan, Jan Baumbach, David B. Blumenthal, Paolo Tieri, Tim Kacprowski, Markus List:
BiCoN: network-constrained biclustering of patients and omics data. Bioinform. 37(16): 2398-2404 (2021) - [j10]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) - [j9]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) - [c10]Anne Hartebrodt, Reza Nasirigerdeh, David B. Blumenthal, Richard Röttger:
Federated Principal Component Analysis for Genome-Wide Association Studies. ICDM 2021: 1090-1095 - [c9]Reza Nasirigerdeh, Reihaneh Torkzadehmahani, Jan Baumbach, David B. Blumenthal:
On the Privacy of Federated Pipelines. SIGIR 2021: 1975-1979 - [c8]Franka Bause, David B. Blumenthal, Erich Schubert, Nils M. Kriege:
Metric Indexing for Graph Similarity Search. SISAP 2021: 323-336 - [c7]Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal:
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. SISAP 2021: 337-351 - [i8]Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal:
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]. CoRR abs/2107.14525 (2021) - [i7]Franka Bause, David B. Blumenthal, Erich Schubert, Nils M. Kriege:
Metric Indexing for Graph Similarity Search. CoRR abs/2110.01283 (2021) - 2020
- [j8]David B. Blumenthal, Lorenzo Viola, Markus List, Jan Baumbach, Paolo Tieri, Tim Kacprowski:
EpiGEN: an epistasis simulation pipeline. Bioinform. 36(19): 4957-4959 (2020) - [j7]Nicolas Boria, David B. Blumenthal, Sébastien Bougleux, Luc Brun:
Improved local search for graph edit distance. Pattern Recognit. Lett. 129: 19-25 (2020) - [j6]Sébastien Bougleux, Benoit Gaüzère, David B. Blumenthal, Luc Brun:
Fast linear sum assignment with error-correction and no cost constraints. Pattern Recognit. Lett. 134: 37-45 (2020) - [j5]David B. Blumenthal, Johann Gamper:
On the exact computation of the graph edit distance. Pattern Recognit. Lett. 134: 46-57 (2020) - [j4]Sven Helmer, David B. Blumenthal, Kathrin Paschen:
What is meaningful research and how should we measure it? Scientometrics 125(1): 153-169 (2020) - [j3]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) - [j2]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) - [i6]Reihaneh Torkzadehmahani, Reza Nasirigerdeh, David B. Blumenthal, Tim Kacprowski, Markus List, Julian O. Matschinske, Julian Späth, Nina Kerstin Wenke, Béla Bihari, Tobias Frisch, Anne Hartebrodt, Anne-Christin Hauschild, Dominik Heider, Andreas Holzinger, Walter Hötzendorfer, Markus Kastelitz, Rudolf Mayer, Cristian Nogales, Anastasia Pustozerova, Richard Röttger, Harald H. H. W. Schmidt, Ameli Schwalber, Christof Tschohl, Andrea Wohner, Jan Baumbach:
Privacy-preserving Artificial Intelligence Techniques in Biomedicine. CoRR abs/2007.11621 (2020) - [i5]Mohammad Bakhtiari, Reza Nasirigerdeh, Reihaneh Torkzadehmahani, Amirhossein Bayat, David B. Blumenthal, Markus List, Jan Baumbach:
Federated Multi-Mini-Batch: An Efficient Training Approach to Federated Learning in Non-IID Environments. CoRR abs/2011.07006 (2020)
2010 – 2019
- 2019
- [c6]David B. Blumenthal, Sébastien Bougleux, Johann Gamper, Luc Brun:
GEDLIB: A C++ Library for Graph Edit Distance Computation. GbRPR 2019: 14-24 - [i4]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) - [i3]Nicolas Boria, David B. Blumenthal, Sébastien Bougleux, Luc Brun:
Improved local search for graph edit distance. CoRR abs/1907.02929 (2019) - [i2]David B. Blumenthal:
New Techniques for Graph Edit Distance Computation. CoRR abs/1908.00265 (2019) - 2018
- [j1]David B. Blumenthal, Johann Gamper:
Improved Lower Bounds for Graph Edit Distance. IEEE Trans. Knowl. Data Eng. 30(3): 503-516 (2018) - [c5]Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser, David B. Blumenthal:
Finding k-dissimilar paths with minimum collective length. SIGSPATIAL/GIS 2018: 404-407 - [c4]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 - [c3]David B. Blumenthal, Sébastien Bougleux, Johann Gamper, Luc Brun:
Ring Based Approximation of Graph Edit Distance. S+SSPR 2018: 293-303 - [i1]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
- [c2]David B. Blumenthal, Johann Gamper:
Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs. GbRPR 2017: 211-221 - [c1]David B. Blumenthal, Johann Gamper:
Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance. ICDE 2017: 131-134
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-09-11 00:33 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:
