research
∙
11/01/2022
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs
We investigated the computational power of a single mobile agent in an n...
share
research
∙
09/05/2022
Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices
We investigate the computational power of the deterministic single-agent...
research
∙
05/30/2022
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
We consider global problems, i.e. problems that take at least diameter t...
research
∙
05/08/2021
Fast Neighborhood Rendezvous
In the rendezvous problem, two computing entities (called agents) locate...
research
∙
04/25/2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
For a graph G=(V,E), finding a set of disjoint edges that do not share a...
research
∙
08/26/2019