| 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, 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, IPSJ-AL | 2018-05-25 14:30 |
Aichi | Nagoya Institute of Technology | Fast Aggregation in Probabilistic Population Protocols Ryota Eguchi, Taisuke Izumi (Nagoya Inst. of Tech.) COMP2018-6 |
In this paper, we propose a new aggregation algorithm in probabilistic population protocol model with a base station. Sp... [more] | COMP2018-6 pp.79-84 |
| IT | 2015-11-24 13:35 |
Okayama | Shimoden Hotel | [Invited Talk]
A Short Introduction to Communication Complexity Taisuke Izumi (NITECH) IT2015-44 |
Communication Complexity is a theory to reveal the necessary number of bits exchanged among serveral parties for comput... [more] |
IT2015-44 pp.1-6 |
| COMP | 2015-04-23 15:45 |
Miyagi | On Complexity of Loosely-Stabilizing Leader Election in Population Protocol Models Taisuke Izumi, Kenji Hata (NITECH) COMP2015-5 |
[more] | COMP2015-5 pp.27-31 |
|
| COMP | 2014-03-10 14:40 |
Tokyo | On Complexity of Distributed Diameter Approximation Taisuke Izumi (Nagoya Inst. of Tech.), Roger Wattenhofer (ETH Zurich) COMP2013-69 |
[more] | COMP2013-69 pp.61-68 |
|
| COMP | 2013-12-20 10:20 |
Okinawa | Okinawa Industry Support Center | On Enumerating All Maximal Cliques in Unit Disk Graphs Daisuke Suzuki, Taisuke Izumi (Nagoya Inst. of Tech.) COMP2013-40 |
This paper considers the problem of enumerating all maximal cliques in unit disk graphs, which is a plausible setting fo... [more] | COMP2013-40 pp.15-20 |
| COMP, IPSJ-AL | 2013-05-18 15:30 |
Hokkaido | Otaru University of Commerce | On parallel complexity of MapReduce computation Koichi Wada (Hosei Univ.), Taisuke Izumi (Nagoya Inst. of Tech.) COMP2013-17 |
[more] | COMP2013-17 pp.143-147 |
| COMP | 2012-09-03 16:10 |
Tokyo | Hosei University | A New Direction for Counting Perfect Matchings Taisuke Izumi, Tadashi Wadayama (Nagoya Inst. of Tech.) COMP2012-33 |
We present a new exact algorithm for counting perfect matchings, which relies on neither inclusion-exclusion princip... [more] |
COMP2012-33 p.49 |
| COMP | 2011-12-16 10:00 |
Aichi | Nagoya Univ. | Relationship Between Coding Theory and Counting Perfect Matchings Taisuke Izumi, Tadashi Wadayama (NITech) COMP2011-37 |
Counting perfect matchings is known as one of the hard problems to obtain exact results, which is proven to be \#P-comp... [more] |
COMP2011-37 pp.9-15 |
| COMP | 2011-03-09 10:35 |
Tokyo | Chuo Univ. | Communication-Efficient Broadcast on Markovian Evolving Graphs Kei Matsubara, Taisuke Izumi, Koichi Wada (NIT) COMP2010-48 |
The design of efficient distributed algorithms working on dynamic networks recently receives much attention. The Marko... [more] |
COMP2010-48 pp.9-15 |
| IBISML | 2010-11-05 15:30 |
Tokyo | IIS, Univ. of Tokyo | [Poster Presentation]
A Study on Multiple Multivariate Two-Sample Test for Gene Set Analysis using MST-based SVM Path-Following Yuta Ishikawa, Kota Isobe, Masayuki Karasuyama, Taisuke Izumi, Ichiro Takeuchi (NIT) IBISML2010-88 |
Microarray technology enables us to measure expression levels of thousands of genes simultaneously. We consider how to f... [more] | IBISML2010-88 pp.211-220 |
| DC | 2009-02-16 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.) DC2008-73 |
With shrinking of LSIs, the diversification of defective mode due to defects becomes a critical issue. Therefore, the ... [more] |
DC2008-73 pp.31-36 |
|
| COMP | 2008-09-11 14:20 |
Aichi | Nagoya Inst. of Tech. | Convergence problem of Mobile Robots with Uniformly-Inaccurate Sensors Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP2008-29 |
(To be available after the conference date) [more] | COMP2008-29 pp.39-46 |
| COMP | 2008-09-11 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) COMP2008-30 |
This paper studies a gathering problem in a ring for $2n$ autonomous mobile robots. In [1] it is shown that gathering is... [more] | COMP2008-30 pp.47-54 |
[Return to Top Page]