| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2023-12-22 16:00 |
Miyazaki | Miyazaki Univ. Machinaka Campus | Uniform deployment of mobile robots with restricted views in path graphs Kazuki Hasegawa, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)  COMP2023-26 |
We consider the uniform deployment of mobile robots on path graphs.The view each robot can observe is restricted in the ... [more] | COMP2023-26 pp.61-67 |
| COMP | 2023-10-24 16:20 |
Aichi | Nagoya Univ. Venture Business Lab. | Algorithm of uniform deployment for mobile robots in perfect bipartite graphs Masahiro Shibata (Kyutech), Naoki Kitamura (Osaka Univ.), Ryota Eguchi (NAIST), Yuichi Sudo (Hosei Univ.), Junya Nakamura (Toyohashi Tech.), Yonghwan Kim, Yoshiaki Katayama (Nagoya Tech.), Toshimitsu Masuzawa (Osaka Univ.), Sebastien Tixeuil (Sorbonne Univ.) COMP2023-14 |
In this paper, we consider the uniform deployment problem of mobile robots in perfect bipartite graphs. Intuitively, whe... [more] | COMP2023-14 pp.13-20 |
| COMP, IPSJ-AL | 2023-05-11 10:25 |
Hokkaido | Hokkaido University | On the Solvability of Gathering Problems by Autonomous Mobile Robots with Defected View Yonghwan Kim (NITech), Masahiro Shibata (Kyutech), Yuichi Sudo (Hosei Univ.), Junya Nakamura (TUT), Yoshiaki Katayama (NITech), Toshimitsu Masuzawa (Osaka Univ.) COMP2023-3 |
[more] | COMP2023-3 pp.8-15 |
| COMP, IPSJ-AL | 2023-05-11 15:25 |
Hokkaido | Hokkaido University | Parameterized Complexity of Shortest Path Most Vital Edges Problem Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2023-6 |
Given an undirected graph $G$, vertices $s,t$ of $G$,and the number of removal edges $d$,the shortest paths most vital e... [more] | COMP2023-6 pp.29-35 |
| COMP | 2022-12-06 15:00 |
Ehime | Ehime Univ. Media Hall | A Fast (1+epsilon)-Approximating Algorithm for Single Source Replacement Path Problem Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu masuzawa (Osaka Univ.) COMP2022-28 |
Let $G$ be any weighted undirected graph of $n$ vertices and $m$ edges, and $s$ be an arbitrary source vertex in $G$. In... [more] | COMP2022-28 pp.32-39 |
| COMP, IPSJ-AL | 2022-05-19 15:40 |
Online | Online | On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes Narumi Shigekiyo, Toshimitsu Masuzawa, Taisuke Izumi (Osaka Univ.) COMP2022-5 |
Broadcast-CONGEST is a variant of CONGEST, the standard computational model for distributed graph algorithms, with the r... [more] | COMP2022-5 pp.33-38 |
| COMP, IPSJ-AL | 2022-05-20 14:10 |
Online | Online | Computational Power of A Memoryless Mobile Agent in Undirected Rings Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2022-8 |
We consider the system where a single mobile agent is deployed in an anonymous, oriented, and undirected ring of $n$ ver... [more] | COMP2022-8 pp.46-53 |
| COMP, IPSJ-AL | 2021-05-07 16:40 |
Online | Online | Exploration of dynamic graphs by the minimum number of agents Shunsuke Iitsuka (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2021-3 |
We consider the collaborative exploration of dynamic graphs by multiple agents, where dynamic graphs are defined as the ... [more] | COMP2021-3 pp.17-22 |
| COMP, IPSJ-AL | 2021-05-07 17:10 |
Online | Online | A self-stabilizing 1-minimal independent dominating set algorithm based on loop composition Yuto Taniuchi (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2021-4 |
We consider the 1-minimal independent dominating set (1-MIDS) problem: given a connected graph $G=(V,E)$, our goal is to... [more] | COMP2021-4 pp.23-30 |
| COMP | 2019-12-13 09:25 |
Gunma | Ikaho Seminar House, Gunma University | A Self-Stabilizing 1-maximal Independent Set Algorithm Hideyuki Tanaka, Yuichi Sudo (Osaka Univ.), Hirotsugu Kakugawa (Ryukoku Univ.), Toshimitsu Masuzawa (Osaka Univ.), Ajoy K. Datta (UNLV) COMP2019-30 |
We consider the 1-maximal independent set (1-MIS) problem: given a connected graph $G=(V,E)$, our goal is to find an 1-m... [more] | COMP2019-30 pp.9-16 |
| COMP | 2019-12-13 09:50 |
Gunma | Ikaho Seminar House, Gunma University | Self-stabilizing graph exploration by a mobile agent with fast recovery from edge deletions Yuki Hara, Yuichi Sudo (Osaka Univ.), Hirotsugu Kakugawa (Ryukoku Univ.), Toshimitsu Masuzawa (Osaka Univ.) COMP2019-31 |
[more] | COMP2019-31 pp.17-24 |
| COMP | 2019-03-18 16:15 |
Tokyo | The University of Tokyo | Move-optimal Randomized Partial Gathering of Anonymous Mobile Agents in Anonymous Unidirectional Rings Norikazu Kawata (Osaka Univ.), Masahiro Shibata (KIT), Yuichi Sudo (Osaka Univ.), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-51 |
(To be available after the conference date) [more] | COMP2018-51 pp.47-54 |
| COMP | 2018-12-12 16:15 |
Miyagi | Tohoku University | Self-stabilizing exploration of a graph by a mobile agent Yuki Hara, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-39 |
The rotor-router is a self-stabilizing algorithm for graph exploration by a mobile agent, that is, it eventually allows,... [more] | COMP2018-39 pp.47-54 |
| COMP | 2018-09-18 13:00 |
Fukuoka | Kyusyu Institute of Technology | Mediated population protocols with a base station for line and ring construction Yuumi Yoshikawa, Yuuichi Sudou (Osaka Univ.), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-12 |
A mediated population protocol model is a computational model that abstracts a wireless network composed of numerous low... [more] | COMP2018-12 pp.23-27 |
| COMP, IPSJ-AL | 2018-05-26 15:20 |
Aichi | Nagoya Institute of Technology | Convergence Time in Population Protocol Model of Agents with Different Moving Speeds Ryoya Sadano, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-7 |
In this paper, we propose a new population protocol model, which is a computational model of mobile sensor networks, whi... [more] | COMP2018-7 pp.85-91 |
| COMP, IPSJ-AL | 2018-05-26 15:50 |
Aichi | Nagoya Institute of Technology | Energy Balancing with Wireless Energy Transmission in Sensor Networks Hiroshi Michizu, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-8 |
In recent years, many people are studying wireless energy transmission technology for transmitting electric energy wirel... [more] | COMP2018-8 pp.93-100 |
| COMP | 2017-10-27 15:20 |
Tokyo | COMP2017-24 |
[more] | COMP2017-24 pp.29-36 |
|
| COMP | 2017-10-27 15:50 |
Tokyo | Exploration of dynamic tori by mobile agents Tsuyoshi Gotoh, Yuichi Sudo (Osaka Univ), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2017-25 |
Mobile agents (agents) are entities which can move autonomously in a networked system and execute actions at nodes they ... [more] | COMP2017-25 pp.37-44 |
|
| COMP | 2017-08-18 14:15 |
Aomori | A generalization of the minimal dominating set problem and its self-stabilizing algorithm Hisaki Kobayashi, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2017-16 |
[more] | COMP2017-16 pp.25-32 |
|
| COMP, ISEC | 2016-12-21 15:10 |
Hiroshima | Hiroshima University | A Loosely-Stabilizing Population Protocol for Maximal Independent Set Seiken Kiyosu, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) ISEC2016-78 COMP2016-39 |
Self–stabilizing population protocols are impossible to design for some problems. For example, leader election on ... [more] | ISEC2016-78 COMP2016-39 pp.43-49 |
[Return to Top Page]