Taisuke Izumi
Osaka University
H-index: 18
Asia-Japan
Top articles of Taisuke Izumi
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time | arXiv preprint arXiv:2401.01103 | Kaito Harada Naoki Kitamura Taisuke Izumi Toshimitsu Masuzawa | 2024/1/2 |
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching | Taisuke Izumi Naoki Kitamura Yutaro Yamaguchi | 2024 | |
Deterministic Fault-Tolerant Connectivity Labeling Scheme | Taisuke Izumi Yuval Emek Tadashi Wadayama Toshimitsu Masuzawa | 2023/6/19 | |
Parameterized Complexity of Shortest Path Most Vital Edges Problem | IEICE Technical Report; IEICE Tech. Rep. | Yuto Ashida Naoki Kitamura Taisuke Izumi Toshimitsu Masuzawa | 2023/5/3 |
Circulating exploration of an arbitrary graph by energy-sharing agents | IEICE Conferences Archives | XINGZHE SUN NAOKI KITAMURA TAISUKE IZUMI TOSHIMITSU MASUZAWA | 2023/2/28 |
Loosely-Stabilizing Algorithm on Almost Maximal Independent Set | IEICE TRANSACTIONS on Information and Systems | Rongcheng Dong Taisuke Izumi Naoki Kitamura Yuichi Sudo Toshimitsu Masuzawa | 2023/11/1 |
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs | arXiv preprint arXiv:2211.00332 | Taichi Inoue Naoki Kitamura Taisuke Izumi Toshimitsu Masuzawa | 2022/11/1 |
Fast neighborhood rendezvous | IEICE TRANSACTIONS on Information and Systems | Ryota Eguchi Naoki Kitamura Taisuke Izumi | 2022/3/1 |
Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices | arXiv preprint arXiv:2209.01906 | Taisuke Izumi Kazuki Kakizawa Yuya Kawabata Naoki Kitamura Toshimitsu Masuzawa | 2022/9/5 |
Fully polynomial-time distributed computation in low-treewidth graphs | Taisuke Izumi Naoki Kitamura Takamasa Naruse Gregory Schwartzman | 2022/7/11 | |
A Fast (1+ epsilon)-Approximating Algorithm for Single Source Replacement Path Problem | IEICE Technical Report; IEICE Tech. Rep. | Kaito Harada Naoki Kitamura Taisuke Izumi | 2022/11/29 |
On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes | IEICE Technical Report; IEICE Tech. Rep. | Narumi Shigekiyo Toshimitsu Masuzawa Taisuke Izumi | 2022/5/12 |
Loosely-stabilizing maximal independent set algorithms with unreliable communications | Theoretical Computer Science | Rongcheng Dong Yuichi Sudo Taisuke Izumi Toshimitsu Masuzawa | 2022/11/18 |
A subquadratic-time distributed algorithm for exact maximum matching | IEICE TRANSACTIONS on Information and Systems | Naoki Kitamura Taisuke Izumi | 2022/3/1 |
Low-congestion shortcuts without embedding | Distributed Computing | Bernhard Haeupler Taisuke Izumi Goran Zuzic | 2021/2 |
Low-congestion shortcut and graph parameters | Distributed Computing | Naoki Kitamura Hirotaka Kitagawa Yota Otachi Taisuke Izumi | 2021/10 |
Fully adaptive self-stabilizing transformer for lcl problems | arXiv preprint arXiv:2105.09756 | Shimon Bitton Yuval Emek Taisuke Izumi Shay Kutten | 2021/5/20 |
A self-stabilizing 1-minimal independent dominating set algorithm based on loop composition | IEICE Technical Report; IEICE Tech. Rep. | Yuto Taniuchi Yuichi Sudo Taisuke Izumi Toshimitsu Masuzawa | 2021/4/30 |
Exploration of dynamic graphs by the minimum number of agents | IEICE Technical Report; IEICE Tech. Rep. | Shunsuke Iitsuka Yuichi Sudo Taisuke Izumi Toshimitsu Masuzawa | 2021/4/30 |
Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs | Taisuke Izumi Yota Otachi | 2020 |
