David B. Blumenthal

According to our database, David B. Blumenthal authored at least 35 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Federated singular value decomposition for high-dimensional data.

Anne Hartebrodt, Richard Röttger, David B. Blumenthal

Data Min. Knowl. Discov., May, 2024

2023

On the role of network topology in German-Jewish recommendation letter networks in the early twentieth century.

Lisa Gerlach, David B. Blumenthal

Appl. Netw. Sci., December, 2023

The edge-preservation similarity for comparing rooted, unordered, node-labeled trees.

Nicolas Boria, Jana Kiederle, Florian Yger, David B. Blumenthal

Pattern Recognit. Lett., March, 2023

2022

Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching.

David B. Blumenthal, Sébastien Bougleux, Anton Dignös, Johann Gamper

Inf. Sci., 2022

Robust disease module mining via enumeration of diverse prize-collecting Steiner trees.

Judith Bernett, Dominik Krupke, Sepideh Sadegh, Jan Baumbach, Sándor P. Fekete, Tim Kacprowski, Markus List, David B. Blumenthal

Bioinform., 2022

Online <i>in silico</i> validation of disease and gene sets, clusterings or subnetworks with DIGEST.

Klaudia Adamowicz, Andreas Maier, Jan Baumbach, David B. Blumenthal

Briefings Bioinform., 2022

Querying Temporal Anomalies in Healthcare Information Systems and Beyond.

Christina Khnaisser, Hind Hamrouni, David B. Blumenthal, Anton Dignös, Johann Gamper

Proceedings of the Advances in Databases and Information Systems, 2022

2021

Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing.

David B. Blumenthal, Nicolas Boria, Sébastien Bougleux, Luc Brun, Johann Gamper, Benoit Gaüzère

Inf. Syst., 2021

Upper Bounding Graph Edit Distance Based on Rings and Machine Learning.

David B. Blumenthal, Johann Gamper, Sébastien Bougleux, Luc Brun

Int. J. Pattern Recognit. Artif. Intell., 2021

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version].

Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal

CoRR, 2021

BiCoN: network-constrained biclustering of patients and omics data.

Olga Lazareva, Stefan Canzar, Kevin Yuan, Jan Baumbach, David B. Blumenthal, Paolo Tieri, Tim Kacprowski, Markus List

Bioinform., 2021

On the limits of active module identification.

Olga Lazareva, Jan Baumbach, Markus List, David B. Blumenthal

Briefings Bioinform., 2021

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.

Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal

Proceedings of the Similarity Search and Applications - 14th International Conference, 2021

Metric Indexing for Graph Similarity Search.

Franka Bause, David B. Blumenthal, Erich Schubert, Nils M. Kriege

Proceedings of the Similarity Search and Applications - 14th International Conference, 2021

On the Privacy of Federated Pipelines.

Reza Nasirigerdeh, Reihaneh Torkzadehmahani, Jan Baumbach, David B. Blumenthal

Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

Federated Principal Component Analysis for Genome-Wide Association Studies.

Anne Hartebrodt, Reza Nasirigerdeh, David B. Blumenthal, Richard Röttger

Proceedings of the IEEE International Conference on Data Mining, 2021

2020

Finding k-shortest paths with limited overlap.

Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser, David B. Blumenthal

VLDB J., 2020

Comparing heuristics for graph edit distance computation.

David B. Blumenthal, Nicolas Boria, Johann Gamper, Sébastien Bougleux, Luc Brun

VLDB J., 2020

What is meaningful research and how should we measure it?

Sven Helmer, David B. Blumenthal, Kathrin Paschen

Scientometrics, 2020

Fast linear sum assignment with error-correction and no cost constraints.

Sébastien Bougleux, Benoit Gaüzère, David B. Blumenthal, Luc Brun

Pattern Recognit. Lett., 2020

Improved local search for graph edit distance.

Nicolas Boria, David B. Blumenthal, Sébastien Bougleux, Luc Brun

Pattern Recognit. Lett., 2020

On the exact computation of the graph edit distance.

David B. Blumenthal, Johann Gamper

Pattern Recognit. Lett., 2020

Federated Multi-Mini-Batch: An Efficient Training Approach to Federated Learning in Non-IID Environments.

Mohammad Bakhtiari, Reza Nasirigerdeh, Reihaneh Torkzadehmahani, Amirhossein Bayat, David B. Blumenthal, Markus List, Jan Baumbach

CoRR, 2020

Privacy-preserving Artificial Intelligence Techniques in Biomedicine.

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

CoRR, 2020

EpiGEN: an epistasis simulation pipeline.

David B. Blumenthal, Lorenzo Viola, Markus List, Jan Baumbach, Paolo Tieri, Tim Kacprowski

Bioinform., 2020

2019

New Techniques for Graph Edit Distance Computation.

David B. Blumenthal

CoRR, 2019

Upper Bounding GED via Transformations to LSAPE Based on Rings and Machine Learning.

David B. Blumenthal, Sébastien Bougleux, Johann Gamper, Luc Brun

CoRR, 2019

GEDLIB: A C++ Library for Graph Edit Distance Computation.

David B. Blumenthal, Sébastien Bougleux, Johann Gamper, Luc Brun

Proceedings of the Graph-Based Representations in Pattern Recognition, 2019

2018

Improved Lower Bounds for Graph Edit Distance.

David B. Blumenthal, Johann Gamper

IEEE Trans. Knowl. Data Eng., 2018

Finding k-Dissimilar Paths with Minimum Collective Length.

Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser, David B. Blumenthal

CoRR, 2018

Ring Based Approximation of Graph Edit Distance.

David B. Blumenthal, Sébastien Bougleux, Johann Gamper, Luc Brun

Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2018

Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem.

David B. Blumenthal, Évariste Daller, Sébastien Bougleux, Luc Brun, Johann Gamper

Proceedings of the 24th International Conference on Pattern Recognition, 2018

Finding <i>k</i>-dissimilar paths with minimum collective length.

Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser, David B. Blumenthal

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

2017

Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance.

David B. Blumenthal, Johann Gamper

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs.

David B. Blumenthal, Johann Gamper

Proceedings of the Graph-Based Representations in Pattern Recognition, 2017