Daniel Hathcock

According to our database, Daniel Hathcock authored at least 11 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

The Steiner path aggregation problem.

Da Qi Chen, Daniel Hathcock, D. Ellis Hershkowitz, R. Ravi

Inf. Process. Lett., 2026

2024

The Telephone <i>k</i>-Multicast Problem.

Daniel Hathcock, Guy Kortsarz, R. Ravi

CoRR, 2024

Online Matroid Intersection: Submodular Water-Filling and Matroidal Welfare Maximization.

Daniel Hathcock, Billy Jin, Kalen Patton, Sherry Sarkar, Michael Zlatin

CoRR, 2024

Maintaining Matroid Intersections Online.

Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

The Online Submodular Assignment Problem.

Daniel Hathcock, Billy Jin, Kalen Patton, Sherry Sarkar, Michael Zlatin

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Approximation Algorithms for Steiner Connectivity Augmentation.

Daniel Hathcock, Michael Zlatin

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

The Telephone k-Multicast Problem.

Daniel Hathcock, Guy Kortsarz, R. Ravi

Proceedings of the Approximation, 2024

2023

On the Hypergraph Connectivity of Skeleta of Polytopes.

Daniel Hathcock, Josephine Yu

Discret. Comput. Geom., March, 2023

Improved Approximation Algorithms for Steiner Connectivity Augmentation Problems.

Daniel Hathcock, Michael Zlatin

CoRR, 2023

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

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Toppleable permutations, excedances and acyclic orientations.

Arvind Ayyer, Daniel Hathcock, Prasad Tetali

Comb. Theory, 2022