Toppleable permutations, excedances and acyclic orientations. - Arvind Ayyer; Daniel Hathcock; Prasad Tetali (Comb. Theory, 2022)

One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. - Costas Busch; Da Qi Chen; Arnold Filtser; Daniel Hathcock; D. Ellis Hershkowitz; Rajmohan Rajaraman (FOCS, 2023)

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

On the Hypergraph Connectivity of Skeleta of Polytopes. - Daniel Hathcock; Josephine Yu (Discret. Comput. Geom., 2023)

The Telephone k-Multicast Problem. - Daniel Hathcock; Guy Kortsarz; R. Ravi 001 (APPROX/RANDOM, 2024)

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)

Maintaining Matroid Intersections Online. - Niv Buchbinder; Anupam Gupta 001; Daniel Hathcock; Anna R. Karlin; Sherry Sarkar (SODA, 2024)

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

The Telephone k-Multicast Problem. - Daniel Hathcock; Guy Kortsarz; R. Ravi 001 (CoRR, 2024)