Author of the publication

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

, , , , and . SISAP, volume 13058 of Lecture Notes in Computer Science, page 337-351. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections., , , , and . SISAP, volume 13058 of Lecture Notes in Computer Science, page 337-351. Springer, (2021)Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem., , , , and . ICPR, page 934-939. IEEE Computer Society, (2018)Federated Principal Component Analysis for Genome-Wide Association Studies., , , and . ICDM, page 1090-1095. IEEE, (2021)Querying Temporal Anomalies in Healthcare Information Systems and Beyond., , , , and . ADBIS, volume 13389 of Lecture Notes in Computer Science, page 209-222. Springer, (2022)Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching., , , and . Inf. Sci., (2022)The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections Extended Version., , , , and . CoRR, (2021)Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing., , , , , and . Inf. Syst., (2021)BiCoN: Network-constrained biclustering of patients and omics data, , , , , , , , and . bioRxiv, (2020)Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance., and . ICDE, page 131-134. IEEE Computer Society, (2017)Robust disease module mining via enumeration of diverse prize-collecting Steiner trees, , , , , , , and . Bioinformatics, 38 (6): 1600-1606 (January 2022)