The edit distance is a fundamental measure of sequence similarity, defin...
We study reachability and shortest paths problems in dynamic directed gr...
For the well-known Survivable Network Design Problem (SNDP) we are given...
Reachability, distance, and matching are some of the most fundamental gr...
Shapley values are one of the main tools used to explain predictions of ...
We construct in Logspace non-zero circulations for H-minor free graphs w...
This paper bridges discrete and continuous optimization approaches for
d...
In 2015, it was shown that reachability for arbitrary directed graphs ca...
Continuing the recent trend, in this article we design several
space-eff...
Recently it was shown that the transitive closure of a directed graph ca...
The well-known k-disjoint path problem (k-DPP) asks for pairwise
vertex-...
Read-only memory model is a classical model of computation to study
time...
In this work, a novel solution to the speaker identification problem is
...