关注
Daniel Hathcock
Daniel Hathcock
在 andrew.cmu.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Toppleable permutations, excedances and acyclic orientations
A Ayyer, D Hathcock, P Tetali
arXiv preprint arXiv:2010.11236, 2020
72020
One tree to rule them all: Poly-logarithmic universal steiner tree
O Busch, A Filtser, D Hathcock, DE Hershkowitz, R Rajaraman
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 60-76, 2023
62023
Maintaining matroid intersections online
N Buchbinder, A Gupta, D Hathcock, AR Karlin, S Sarkar
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
42024
On the hypergraph connectivity of skeleta of polytopes
D Hathcock, J Yu
Discrete & Computational Geometry 69 (2), 593-596, 2023
12023
The Online Submodular Assignment Problem
D Hathcock, B Jin, K Patton, S Sarkar, M Zlatin
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024
2024
The Telephone -Multicast Problem
D Hathcock, G Kortsarz, R Ravi
arXiv preprint arXiv:2410.01048, 2024
2024
Online Matroid Intersection: Submodular Water-Filling and Matroidal Welfare Maximization
D Hathcock, B Jin, K Patton, S Sarkar, M Zlatin
arXiv preprint arXiv:2401.06981, 2024
2024
Approximation Algorithms for Steiner Connectivity Augmentation
D Hathcock, M Zlatin
32nd Annual European Symposium on Algorithms (ESA 2024), 2024
2024
Improved Approximation Algorithms for Steiner Connectivity Augmentation Problems
D Hathcock, M Zlatin
arXiv preprint arXiv:2308.08690, 2023
2023
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
D Hathcock, DE Hershkowitz, R Rajaraman
系统目前无法执行此操作,请稍后再试。
文章 1–10