No. Title Author Year
1 Faster Algorithms for All-Pairs Bounded Min-Cuts Abboud, Amir et al. 2019
2 The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern Krauthgamer, Robert et al. 2019
3 On Solving Linear Systems in Sublinear Time Andoni, Alexandr et al. 2018
4 Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems Filtser, Arnold et al. 2018
5 Conditional Lower Bounds for All-Pairs Max-Flow Krauthgamer, Robert et al. 2017
6 Color-Distance Oracles and Snippets Kopelowitz, Tsvi et al. 2016
7 Approximate Nearest Neighbor Search in Metrics of Planar Graphs Abraham, Ittai et al. 2015
8 Towards Resistance Sparsifiers Dinitz, Michael et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 8


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