Graduate School of Information Science and Engineering, Osaka University
Algorithm Engineering Group (Izumi Lab. )
Link
Access / Contact
日本語
|
English
HOME
News
Research Topics
Member
Publication
Journal
International Conference
Domestic Conference and Workshop (mostly written in Japanese, and non-reviewed)
Award
Misc.
Graduate School of Information Science and Engineering, Osaka University
Algorithm Engineering Group (Izumi Lab. )
日本語
|
English
HOME
News
Research Topics
Member
Publication
Journal
International Conference
Domestic Conference and Workshop (mostly written in Japanese, and non-reviewed)
Award
Misc.
Link
Access / Contact
Publication
Publication
2025
2025
Journal
"Towards distributed two-stage stochastic optimization"
Yuval Emek, Noga Harlev, Taisuke Izumi
Distributed Computing
38
,
4
,
377-395
(2025)
.
DOI: 10.1007/s00446-025-00486-8
"Approximation hardness of domination problems on generalized convex graphs"
Po Yuan Wang, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Theoretical Computer Science
1028
,
115035
(2025)
.
DOI: https://doi.org/10.1016/j.tcs.2024.115035
"Deterministic fault-tolerant connectivity labeling scheme"
Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa
Distributed Computing (PODC2023 special issue)
38
,
1
,
31-50
(2025)
.
DOI: https://link.springer.com/article/10.1007/s00446-024-00472-6
International Conference
"A Distributed Algorithm for (1 + ε)-Approximate Minimum Spanning Tree in the HYBRID Model"
Shoma Hiraoka, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
The 13th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ2025)
(2025)
.
"A Fast Distributed Algorithm for Maximum Cardinality Matching"
Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
The 13th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ2025)
(2025)
.
"Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model"
Yuki Kawashima, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Structural Information and Communication Complexity (SIROCCO)
,
431-436
(2025)
.
DOI: 10.1007/978-3-031-91736-3_27
"Independent Set Reconfiguration Under Bounded-Hop Token Jumping"
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
International Conference and Workshops on Algorithms and Computation (WALCOM)
(2025)
.
DOI: 10.1007/978-981-96-2845-2
Domestic Conference and Workshop (mostly written in Japanese, and non-reviewed)
"無向グラフにおける2辺故障代替経路問題の下界証明と高速なアルゴリズムの提案"
Kaito Harada, Naoki Kitamura, Taisuke Izumi
日本OR学会2025年度関西支部若手研究発表会
(2025)
.
"2者間Private Simultaneous Messagesプロトコルの通信複雑性下界と近似秘匿性への拡張"
Koki Kawamura, Naoki Kitamura, Taisuke Izumi
情報科学ワークショップ
(2025)
.
"因子の部屋とドッスンフワリの物理的ゼロ知識証明"
間理一郎, 北村直暉, 泉泰介
情報科学ワークショップ
(2025)
.
"対戦略性をもつ分散安定マッチングでのラベリングの考察"
芦田雄斗, 北村直暉, 泉泰介
情報科学ワークショップ
(2025)
.
"Improved Algorithms for Local Failover Routing on Directed Graphs"
Yuki Kawashima, Naoki Kitamura, Taisuke Izumi
情報科学ワークショップ
(2025)
.
"ハイブリッドモデルにおける (1 + ϵ) 近似最小全域木アルゴリズムの通信キャパシティ削減"
Shoma Hiraoka, Naoki Kitamura, Taisuke Izumi
情報科学ワークショップ
(2025)
.
"木の1-極大独立集合問題に対する乱択分散アルゴリズム"
Otoya Sakai, Naoki Kitamura, Taisuke Izumi
情報科学ワークショップ
(2025)
.
Category
Journal (75)
International Conference (85)
Domestic Conference and Workshop (mostly written in Japanese, and non-reviewed) (26)
Award (6)
Misc. (10)
By Year
2026 (4)
2025 (14)
2024 (8)
2023 (17)
2022 (8)
2021 (15)
2020 (16)
2019 (15)
2018 (12)
2017 (8)
2016 (7)
2015 (10)
2014 (12)
2013 (3)
2012 (9)
2011 (9)
2010 (11)
2009 (9)
2008 (2)
2005 (4)
2003 (1)
2002 (4)
2001 (4)