Author of the publication

Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model.

, , , , , , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 18 (6): 2144-2156 (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

Fair Polylog-Approximate Low-Cost Hierarchical Clustering., , , and . CoRR, (2023)Scalable Equilibrium Computation in Multi-agent Influence Games on Networks., , , , , , , , and . AAAI, page 5277-5285. AAAI Press, (2021)Streaming and Massively Parallel Algorithms for Edge Coloring., , , , and . ESA, volume 144 of LIPIcs, page 15:1-15:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Adaptive Massively Parallel Constant-Round Tree Contraction., , , and . ITCS, volume 215 of LIPIcs, page 83:1-83:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Fair Hierarchical Clustering., , , , , , , , and . NeurIPS, (2020)Adaptive Massively Parallel Constant-round Tree Contraction., , , and . CoRR, (2021)The Dichotomous Affiliate Stable Matching Problem: Approval-Based Matching with Applicant-Employer Relations., , and . IJCAI, page 356-362. ijcai.org, (2022)Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model., , , , , , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 18 (6): 2144-2156 (2021)DREAM: An Algorithm for Mitigating the Overhead of Robust Rescheduling., , , , , , , and . ICAPS, page 3-12. AAAI Press, (2019)Adaptive Massively Parallel Algorithms for Cut Problems., , , and . SPAA, page 23-33. ACM, (2022)