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


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