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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI