Author:
Henzinger Monika,Krinninger Sebastian,Nanongkai Danupon
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Deterministic Fully Dynamic SSSP and More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Approximating Edit Distance in the Fully Dynamic Model;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover;SIAM Journal on Computing;2023-10-06