research
∙
08/31/2018
Collective fast delivery by energy-efficient agents
We consider k mobile agents initially located at distinct nodes of an un...
share
research
∙
07/16/2018
Faster Algorithms for All-Pairs Bounded Min-Cuts
Given a directed graph, the vertex connectivity from u to v is the maxim...
research
∙
04/05/2018
A Framework for Searching in Graphs in the Presence of Errors
We consider two types of searching models, where the goal is to design a...
research
∙
11/10/2017