Unique Rectification in d-Complete Posets: Towards the K-Theory of Kac-Moody Flag Varieties. - Rahul Ilango; Oliver Pechenik; Michael Zlatin (Electron. J. Comb., 2018)

New and improved approximation algorithms for Steiner Tree Augmentation Problems. - R. Ravi 001; Weizhong Zhang; Michael Zlatin (CoRR, 2022)

On small-depth tree augmentations. - Ojas Parekh; R. Ravi 001; Michael Zlatin (Oper. Res. Lett., 2022)

Approximation Algorithms for Steiner Tree Augmentation Problems. - R. Ravi 001; Weizhong Zhang; Michael Zlatin (SODA, 2023)

Improved Approximation Algorithms for Steiner Connectivity Augmentation Problems. - Daniel Hathcock; Michael Zlatin (CoRR, 2023)

On Packing Dijoins in Digraphs and Weighted Digraphs. - Ahmad Abdi; Gérard Cornuéjols; Michael Zlatin (SIAM J. Discret. Math., 2023)

Approximation Algorithms for Steiner Connectivity Augmentation. - Daniel Hathcock; Michael Zlatin (ESA, 2024)

The Online Submodular Assignment Problem. - Daniel Hathcock; Billy Jin; Kalen Patton; Sherry Sarkar; Michael Zlatin (FOCS, 2024)

Online Matroid Intersection: Submodular Water-Filling and Matroidal Welfare Maximization. - Daniel Hathcock; Billy Jin; Kalen Patton; Sherry Sarkar; Michael Zlatin (CoRR, 2024)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids. - Stephen Arndt; Benjamin Moseley; Kirk Pruhs; Michael Zlatin (CoRR, 2025)