Author:
Gamlath Buddhima,Kapralov Michael,Maggiori Andreas,Svensson Ola,Wajc David
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic Euclidean bottleneck matching;Theoretical Computer Science;2024-10
2. Learning Minimum Linear Arrangement of Cliques and Lines;2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS);2024-07-23
3. Almost tight bounds for online hypergraph matching;Operations Research Letters;2024-07
4. AdWords in a Panorama;SIAM Journal on Computing;2024-06-17
5. Online Edge Coloring Is (Nearly) as Easy as Offline;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10