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
...
The study of algorithmic fairness received growing attention recently. T...
We construct data structures for extremal and pairwise distances in dire...
We combine ideas from distance sensitivity oracles (DSOs) and fixed-para...
We design f-edge fault-tolerant diameter oracles (f-FDOs). We preprocess...
Given a graph with a source vertex s, the Single Source Replacement Path...
Multi-column dependencies in relational databases come associated with t...
Modern time series classifiers display impressive predictive capabilitie...
We investigate the maximum-entropy model B_n,m,p for random
n-vertex, m-...
Given a public transportation network of stations and connections, we wa...
It is a long-standing open problem whether there exists an output-polyno...