Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel. - Yixin Chen 007; Tonmoy Dey; Alan Kuhnle (NeurIPS, 2021)

DASH: Distributed Adaptive Sequencing Heuristic for Submodular Maximization. - Tonmoy Dey; Yixin Chen 007; Alan Kuhnle (CoRR, 2022)

DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization. - Tonmoy Dey; Yixin Chen 007; Alan Kuhnle (AAAI, 2023)

Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time. - Yixin Chen 007; Alan Kuhnle (KDD, 2023)

Discretely beyond 1/e: Guided Combinatorial Algortihms for Submodular Maximization. - Yixin Chen 007; Ankur Nath; Chunli Peng; Alan Kuhnle (NeurIPS, 2024)

Discretely Beyond 1/e: Guided Combinatorial Algorithms for Submodular Maximization. - Yixin Chen 007; Ankur Nath; Chunli Peng; Alan Kuhnle (CoRR, 2024)

Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models. - Yixin Chen 007; Tonmoy Dey; Alan Kuhnle (J. Artif. Intell. Res., 2024)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint. - Yixin Chen 007; Alan Kuhnle (J. Artif. Intell. Res., 2024)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and 1/e Approximation. - Yixin Chen 007; Wenjing Chen; Alan Kuhnle (CoRR, 2025)