Despite extensive research on distance oracles, there are still large ga...
An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch
...
Most networks are not static objects, but instead they change over time....
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
...
One of the most fundamental graph problems is finding a shortest path fr...
We construct data structures for extremal and pairwise distances in dire...
We study the fundamental problem of selecting optimal features for model...
Bayesian inference allows machine learning models to express uncertainty...
Dimensionality reduction algorithms are standard tools in a researcher's...
Combinatorial optimization lies at the core of many real-world problems....
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...
Optical character recognition (OCR) systems performance have improved
si...
In this work we derandomize two central results in graph algorithms,
rep...
We present a simple randomized reduction from fully-dynamic integral mat...