We study the time complexity of computing the (min,+) matrix
product o...
(I) We revisit the algorithmic problem of finding all triangles in a gra...
We consider geometric problems on planar n^2-point sets in the congested...
A monotone Boolean circuit is composed of OR gates, AND gates and input ...
A garden G is populated by n≥ 1 bamboos b_1, b_2, ..., b_n with the
resp...
We consider the fundamental problem of detecting/counting copies of a fi...
The parallel time of a population protocol is defined as the average
num...
A straightforward dynamic programming method for the single-source short...
We consider the fundamental problem of assigning distinct labels to agen...
We present implications from the known conjectures like APSP, 3SUM and E...
The problem of finding maximum (or minimum) witnesses of the Boolean pro...
We study the problem of determining the Boolean product of two n× n
Bool...
We study several problems of clearing subgraphs by mobile agents in digr...