25 citations · 57 across the 24 of their papers we have counts for
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017
Distance-preserving graph contractions
Aaron Bernstein, Karl Däubel, Yann Disser +3
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a…
cs.DS2017★ 1 cited
Robust and adaptive search
Yann Disser, Stefan Kratsch
Binary search finds a given element in a sorted array with an optimal number of queries. However, binary search fails even when the array is only slightly disordered or ac…
cs.DS2017
Scheduling Maintenance Jobs in Networks
Fidaa Abed, Lin Chen, Yann Disser +5
We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focu…