Despite extensive research on distance oracles, there are still large ga...
An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch
...
We study the problem of estimating the ST-diameter of a graph that is
su...
An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch
...
We construct data structures for extremal and pairwise distances in dire...
We combine ideas from distance sensitivity oracles (DSOs) and fixed-para...
In this paper, we consider reachability oracles and reachability preserv...
We study the Budgeted Dominating Set (BDS) problem on uncertain graphs,
...
In this paper, we consider the question of computing sparse subgraphs fo...
We study graph realization problems from a distributed perspective and w...
We consider the problem of realizable interval-sequences. An interval
se...
The classical problem of degree sequence realizability asks whether or n...
The diameter, vertex eccentricities, and the radius of a graph are some ...