DREAM: An Algorithm for Mitigating the Overhead of Robust Rescheduling. - Jordan R. Abrahams; David A. Chu; Grace Diehl; Marina Knittel; Judy Lin; William Lloyd; James C. Boerkoel Jr.; Frank Jeremy (ICAPS, 2019)

Streaming and Massively Parallel Algorithms for Edge Coloring. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Marina Knittel; Hamed Saleh (ESA, 2019)

Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Marina Knittel; Hamed Saleh (DISC, 2019)

Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees. - MohammadTaghi Hajiaghayi; Marina Knittel (AAMAS, 2020)

Fair Hierarchical Clustering. - Sara Ahmadian; Alessandro Epasto; Marina Knittel; Ravi Kumar 001; Mohammad Mahdian; Benjamin Moseley; Philip Pham; Sergei Vassilvitskii; Yuyan Wang (NeurIPS, 2020)

Scalable Equilibrium Computation in Multi-agent Influence Games on Networks. - Fotini Christia; Michael J. Curry; Constantinos Daskalakis; Erik D. Demaine; John P. Dickerson; MohammadTaghi Hajiaghayi; Adam Hesterberg; Marina Knittel; Aidan Milliff (AAAI, 2021)

Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees. - MohammadTaghi Hajiaghayi; Marina Knittel (CoRR, 2021)

Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model. - Haoxing Du; Yi Sheng Ong; Marina Knittel; Ross Mawhorter; Nuo Liu; Gianluca Gross; Reiko Tojo; Ran Libeskind-Hadas; Yi-Chieh Wu (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

The Dichotomous Affiliate Stable Matching Problem: Approval-Based Matching with Applicant-Employer Relations. - Marina Knittel; Samuel Dooley; John P. Dickerson (IJCAI, 2022)

Adaptive Massively Parallel Constant-Round Tree Contraction. - MohammadTaghi Hajiaghayi; Marina Knittel; Hamed Saleh; Hsin-Hao Su (ITCS, 2022)

Adaptive Massively Parallel Algorithms for Cut Problems. - MohammadTaghi Hajiaghayi; Marina Knittel; Jan Olkowski; Hamed Saleh (SPAA, 2022)

Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. - Marina Knittel; John P. Dickerson; MohammadTaghi Hajiaghayi (CoRR, 2022)

Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. - Marina Knittel; Max Springer; John P. Dickerson; MohammadTaghi Hajiaghayi (ICML, 2023)

Fair, Polylog-Approximate Low-Cost Hierarchical Clustering. - Marina Knittel; Max Springer; John P. Dickerson; MohammadTaghi Hajiaghayi (NeurIPS, 2023)

Massively Parallel Tree Embeddings for High Dimensional Spaces. - AmirMohsen Ahanchi; Alexandr Andoni; MohammadTaghi Hajiaghayi; Marina Knittel; Peilin Zhong (SPAA, 2023)

Fair and Scalable Algorithms on Massive Graphs. - Marina Knittel (2023)