25 citations · 44 across the 5 of their papers we have counts for
8 papers · 1 filter
Collective fast delivery by energy-efficient agents
Andreas Bärtschi, Daniel Graf, Matus Mihalak
We consider k mobile agents initially located at distinct nodes of an undirected graph (on n nodes, with edge lengths) that have to deliver a single item from a given source node s…
Faster Algorithms for All-Pairs Bounded Min-Cuts
Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano +5
The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum - cut (or just its value) for all pairs of vertices . We study this problem in directed…
A Framework for Searching in Graphs in the Presence of Errors
Dariusz Dereniowski, Stefan Tiegel, Przemysław Uznański +1
We consider the problem of searching for an unknown target vertex in a (possibly edge-weighted) graph. Each \emph{vertex-query} points to a vertex and the response either a…
Hamming distance completeness and sparse matrix multiplication
Daniel Graf, Karim Labib, Przemysław Uznański
We show that a broad class of vector products (for binary integer functions ) are equivalent under one-to-polylog reductions to the computation of the Hamm…
All-Pairs 2-Reachability in Time
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano +2
In the -reachability problem we are given a directed graph and we wish to determine if there are two (edge or vertex) disjoint paths from to , for a given pair of ver…
Energy-efficient Delivery by Heterogeneous Mobile Agents
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das +4
We consider the problem of delivering messages between specified source-target pairs in a weighted undirected graph, by mobile agents initially located at distinct nodes of…
Collaborative Delivery with Energy-Constrained Mobile Robots
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das +5
We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a l…
On computing the total displacement number via weighted Motzkin paths
Andreas Bärtschi, Barbara Geissmann, Daniel Graf +3
Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen, 2014). The former comb…