Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP 
20231222 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.) COMP202326 
We consider the uniform deployment of mobile robots on path graphs.The view each robot can observe is restricted in the ... [more] 
COMP202326 pp.6167 
COMP, IPSJAL 
20230511 15:25 
Hokkaido 
Hokkaido University 
Parameterized Complexity of Shortest Path Most Vital Edges Problem Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP20236 
Given an undirected graph $G$, vertices $s,t$ of $G$,and the number of removal edges $d$,the shortest paths most vital e... [more] 
COMP20236 pp.2935 
COMP 
20221206 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.) COMP202228 
Let $G$ be any weighted undirected graph of $n$ vertices and $m$ edges, and $s$ be an arbitrary source vertex in $G$. In... [more] 
COMP202228 pp.3239 
COMP, IPSJAL 
20220519 15:40 
Online 
Online 
On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcastCONGEST model for Restricted Graph Classes Narumi Shigekiyo, Toshimitsu Masuzawa, Taisuke Izumi (Osaka Univ.) COMP20225 
BroadcastCONGEST is a variant of CONGEST, the standard computational model for distributed graph algorithms, with the r... [more] 
COMP20225 pp.3338 
COMP, IPSJAL 
20220520 14:10 
Online 
Online 
Computational Power of A Memoryless Mobile Agent in Undirected Rings Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP20228 
We consider the system where a single mobile agent is deployed in an anonymous, oriented, and undirected ring of $n$ ver... [more] 
COMP20228 pp.4653 
COMP, IPSJAL 
20210507 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.) COMP20213 
We consider the collaborative exploration of dynamic graphs by multiple agents, where dynamic graphs are defined as the ... [more] 
COMP20213 pp.1722 
COMP, IPSJAL 
20210507 17:10 
Online 
Online 
A selfstabilizing 1minimal independent dominating set algorithm based on loop composition Yuto Taniuchi (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP20214 
We consider the 1minimal independent dominating set (1MIDS) problem: given a connected graph $G=(V,E)$, our goal is to... [more] 
COMP20214 pp.2330 
COMP, IPSJAL 
20180525 14:30 
Aichi 
Nagoya Institute of Technology 
Fast Aggregation in Probabilistic Population Protocols Ryota Eguchi, Taisuke Izumi (Nagoya Inst. of Tech.) COMP20186 
In this paper, we propose a new aggregation algorithm in probabilistic population protocol model with a base station. Sp... [more] 
COMP20186 pp.7984 
IT 
20151124 13:35 
Okayama 
Shimoden Hotel 
[Invited Talk]
A Short Introduction to Communication Complexity Taisuke Izumi (NITECH) IT201544 
Communication Complexity is a theory to reveal the necessary number of bits
exchanged among serveral parties for comput... [more] 
IT201544 pp.16 
COMP 
20150423 15:45 
Miyagi 

On Complexity of LooselyStabilizing Leader Election in Population Protocol Models Taisuke Izumi, Kenji Hata (NITECH) COMP20155 
[more] 
COMP20155 pp.2731 
COMP 
20140310 14:40 
Tokyo 

On Complexity of Distributed Diameter Approximation Taisuke Izumi (Nagoya Inst. of Tech.), Roger Wattenhofer (ETH Zurich) COMP201369 
[more] 
COMP201369 pp.6168 
COMP 
20131220 10:20 
Okinawa 
Okinawa Industry Support Center 
On Enumerating All Maximal Cliques in Unit Disk Graphs Daisuke Suzuki, Taisuke Izumi (Nagoya Inst. of Tech.) COMP201340 
This paper considers the problem of enumerating all maximal cliques in unit disk graphs, which is a plausible setting fo... [more] 
COMP201340 pp.1520 
COMP, IPSJAL 
20130518 15:30 
Hokkaido 
Otaru University of Commerce 
On parallel complexity of MapReduce computation Koichi Wada (Hosei Univ.), Taisuke Izumi (Nagoya Inst. of Tech.) COMP201317 
[more] 
COMP201317 pp.143147 
COMP 
20120903 16:10 
Tokyo 
Hosei University 
A New Direction for Counting Perfect Matchings Taisuke Izumi, Tadashi Wadayama (Nagoya Inst. of Tech.) COMP201233 
We present a new exact algorithm for counting
perfect matchings, which relies on neither inclusionexclusion
princip... [more] 
COMP201233 p.49 
COMP 
20111216 10:00 
Aichi 
Nagoya Univ. 
Relationship Between Coding Theory and Counting Perfect Matchings Taisuke Izumi, Tadashi Wadayama (NITech) COMP201137 
Counting perfect matchings is known as one of the hard problems to obtain
exact results, which is proven to be \#Pcomp... [more] 
COMP201137 pp.915 
COMP 
20110309 10:35 
Tokyo 
Chuo Univ. 
CommunicationEfficient Broadcast on Markovian Evolving Graphs Kei Matsubara, Taisuke Izumi, Koichi Wada (NIT) COMP201048 
The design of efficient distributed algorithms working on dynamic networks
recently receives much attention. The Marko... [more] 
COMP201048 pp.915 
IBISML 
20101105 15:30 
Tokyo 
IIS, Univ. of Tokyo 
[Poster Presentation]
A Study on Multiple Multivariate TwoSample Test for Gene Set Analysis using MSTbased SVM PathFollowing Yuta Ishikawa, Kota Isobe, Masayuki Karasuyama, Taisuke Izumi, Ichiro Takeuchi (NIT) IBISML201088 
Microarray technology enables us to measure expression levels of thousands of genes simultaneously. We consider how to f... [more] 
IBISML201088 pp.211220 
DC 
20090216 13:50 
Tokyo 

A method for generating defect oriented test patterns for combinational circuits Hiroshi Takahashi, Yoshinobu Higami, Taisuke Izumi, Takashi Aikyo, Yuzo Takamatsu (Ehime Univ.) DC200873 
With shrinking of LSIs, the diversification of defective mode due to defects becomes a critical issue.
Therefore, the ... [more] 
DC200873 pp.3136 
COMP 
20080911 14:20 
Aichi 
Nagoya Inst. of Tech. 
Convergence problem of Mobile Robots with UniformlyInaccurate Sensors Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP200829 
(To be available after the conference date) [more] 
COMP200829 pp.3946 
COMP 
20080911 14:50 
Aichi 
Nagoya Inst. of Tech. 
On Gathering Problem in a Ring for 2n Autonomous Mobile Robots Kotaro Haba, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP200830 
This paper studies a gathering problem in a ring for $2n$ autonomous mobile robots. In [1] it is shown that gathering is... [more] 
COMP200830 pp.4754 