5 citations · 16 across the 10 of their papers we have counts for
4 papers · 1 filter
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
Taisuke Izumi, Samia Souissi, Yoshiaki Katayama +4
Anonymous mobile robots are often classified into synchronous, semi-synchronous and asynchronous robots when discussing the pattern formation problem. For semi-synchronous robots,…
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi +3
In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum Topic-Connected Overlay problem (Min-TCO in short) ha…
Minimum Certificate Dispersal with Tree Structures
Taisuke Izumi, Tomoko Izumi, Hirotaka Ono +1
Given an n-vertex graph G=(V,E) and a set R \subseteq {{x,y} | x,y \in V} of requests, we consider to assign a set of edges to each vertex in G so that for every request {u, v} in…
The BG-simulation for Byzantine Mobile Robots
Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil +1
This paper investigates the task solvability of mobile robot systems subject to Byzantine faults. We first consider the gathering problem, which requires all robots to meet in fini…