Daniel Hathcock

Orcid: 0000-0002-2514-4735

According to our database1, Daniel Hathcock authored at least 10 papers between 2022 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

2022
2023
2024
0
1
2
3
4
5
6
7
2
2
1
4
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Telephone <i>k</i>-Multicast Problem.
CoRR, 2024

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

Maintaining Matroid Intersections Online.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

The Online Submodular Assignment Problem.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Approximation Algorithms for Steiner Connectivity Augmentation.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

The Telephone k-Multicast Problem.
Proceedings of the Approximation, 2024

2023
On the Hypergraph Connectivity of Skeleta of Polytopes.
Discret. Comput. Geom., March, 2023

Improved Approximation Algorithms for Steiner Connectivity Augmentation Problems.
CoRR, 2023

One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Toppleable permutations, excedances and acyclic orientations.
Comb. Theory, 2022


  Loading...