Author:
van den Brand Jan,Nanongkai Danupon,Saranurak Thatchaphol
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. How fast can we play Tetris greedily with rectangular pieces?;Theoretical Computer Science;2024-04
3. Solving Tensor Low Cycle Rank Approximation;2023 IEEE International Conference on Big Data (BigData);2023-12-15
4. Deterministic Fully Dynamic SSSP and More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. The Bit Complexity of Efficient Continuous Optimization;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06