No. | Title | Author | Year |
---|---|---|---|
1 | O(1) Steiner Point Removal in Series-Parallel Graphs | Hershkowitz, D. Ellis et al. | 2022 |
2 | Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs | He, Zhiyang et al. | 2021 |
3 | On the Fixed-Parameter Tractability of Capacitated Clustering | Cohen-Addad, Vincent et al. | 2019 |
4 | Tight FPT Approximations for k-Median and k-Means | Cohen-Addad, Vincent et al. | 2019 |
5 | Faster Distributed Shortest Path Approximations via Shortcuts | Haeupler, Bernhard et al. | 2018 |
6 | New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms | Ghaffari, Mohsen et al. | 2018 |
7 | Non-Preemptive Flow-Time Minimization via Rejections | Gupta, Anupam et al. | 2018 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 7 |