No. Title Author Year
1 Massively Parallel Approximate Distance Sketches Dinitz, Michael et al. 2020
2 Approximating the Norms of Graph Spanners Chlamtác, Eden et al. 2019
3 Brief Announcement: Massively Parallel Approximate Distance Sketches Dinitz, Michael et al. 2019
4 The Capacity of Smartphone Peer-To-Peer Networks Dinitz, Michael et al. 2019
5 The Norms of Graph Spanners Chlamtác, Eden et al. 2019
6 Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network Babay, Amy et al. 2018
7 Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network Babay, Amy et al. 2018
8 Distributed Distance-Bounded Network Design Through Distributed Convex Programming Dinitz, Michael et al. 2018
9 Large Low-Diameter Graphs are Good Expanders Dinitz, Michael et al. 2018
10 Approximating Approximate Distance Oracles Dinitz, Michael et al. 2017
11 Computing Approximate PSD Factorizations Basu, Amitabh et al. 2016
12 The Densest k-Subhypergraph Problem Chlamtac, Eden et al. 2016
13 Towards Resistance Sparsifiers Dinitz, Michael et al. 2015
14 Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights Dinitz, Michael et al. 2014
15 Lowest Degree k-Spanner: Approximation and Hardness Chlamtác, Eden et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 15


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