We present a linear-time algorithm that, given as input (i) a bipartite
...
Given a directed graph, we show how to efficiently find a shortest (dire...
We present a polynomial space Monte Carlo algorithm that given a directe...
Given as input two n-element sets 𝒜,ℬ⊆{0,1}^d
with d=clog n≤(log n)^2/(l...
We show that computing the Tutte polynomial of a linear matroid of dimen...
Given an undirected graph and two disjoint vertex pairs s_1,t_1 and
s_2,...
We introduce new and simple algorithms for the calculation of the number...