| 2025 | SIROCCO | Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model. | Yuki Kawashima, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa |
| 2025 | WALCOM | Independent Set Reconfiguration Under Bounded-Hop Token Jumping. | Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa |
| 2024 | ESA | A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles. | Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa |
| 2024 | OPODIS | Self-Stabilizing Fully Adaptive Maximal Matching. | Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten |
| 2024 | SODA | A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. | Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi |
| 2023 | GLOBECOM | Power-Collision-Based 2-Shot Grant-Free NOMA with Cross-Slot SIC for mMTC. | Takeshi Hirai, Taisuke Izumi, Naoki Wakamiya |
| 2023 | PODC | Deterministic Fault-Tolerant Connectivity Labeling Scheme. | Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa |
| 2022 | OPODIS | Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. | Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa |
| 2022 | SPAA | Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. | Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman |
| 2021 | SSS | Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications. | Rongcheng Dong, Yuichi Sudo, Taisuke Izumi, Toshimitsu Masuzawa |
| 2020 | ICALP | Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. | Taisuke Izumi, Yota Otachi |
| 2020 | ICDCS | Fast Neighborhood Rendezvous. | Ryota Eguchi, Naoki Kitamura, Taisuke Izumi |
| 2020 | STACS | Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. | Taisuke Izumi, Franois Le Gall, Frdric Magniez |
| 2019 | OPODIS | Towards Distributed Two-Stage Stochastic Optimization. | Yuval Emek, Noga Harlev, Taisuke Izumi |
| 2019 | PODC | Message Reduction in the LOCAL Model is a Free Lunch. | Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten |
| 2019 | PODC | Distributed Minimum Degree Spanning Trees. | Michael Dinitz, Magns M. Halldrsson, Taisuke Izumi, Calvin Newport |
| 2019 | PODC | Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. | Taisuke Izumi, Franois Le Gall |
| 2019 | PODC | Logarithmic Expected-Time Leader Election in Population Protocol Model. | Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa |
| 2019 | SSS | Logarithmic Expected-Time Leader Election in Population Protocol Model. | Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa |
| 2018 | FUN | Uniform Distribution On Pachinko. | Naoki Kitamura, Yuya Kawabata, Taisuke Izumi |
| 2018 | PODC | Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. | Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi |
| 2017 | CIAC | Population Protocols with Faulty Interactions: The Impact of a Leader. | Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta |
| 2017 | ICDCS | On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. | Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta |
| 2017 | PODC | Triangle Finding and Listing in CONGEST Networks. | Taisuke Izumi, Franois Le Gall |
| 2016 | ISIT | Bounds on asymptotic rate of capacitive crosstalk avoidance codes for on-chip buses. | Tadashi Wadayama, Taisuke Izumi |
| 2016 | PODC | Low-Congestion Shortcuts without Embedding. | Bernhard Haeupler, Taisuke Izumi, Goran Zuzic |
| 2016 | SSS | Flocking with Oblivious Robots. | Davide Canepa, Xavier Dfago, Taisuke Izumi, Maria Potop-Butucaru |
| 2015 | COCOA | Listing Center Strings Under the Edit Distance Metric. | Hiromitsu Maji, Taisuke Izumi |
| 2015 | ISIT | Bitwise MAP estimation for group testing based on holographic transformation. | Tadashi Wadayama, Taisuke Izumi, Kazushi Mimura |
| 2015 | ISIT | Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. | Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono |
| 2015 | SIROCCO | On Space and Time Complexity of Loosely-Stabilizing Leader Election. | Taisuke Izumi |
| 2015 | SOFSEM | Filling Logarithmic Gaps in Distributed Complexity for Global Problems. | Hiroaki Ookawa, Taisuke Izumi |
| 2014 | ISAAC | Depth-First Search Using O(n) Bits. | Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara |
| 2014 | OPODIS | Time Lower Bounds for Distributed Distance Oracles. | Taisuke Izumi, Roger Wattenhofer |
| 2014 | SIROCCO | Randomized Lower Bound for Distributed Spanning-Tree Verification. | Taisuke Izumi |
| 2014 | SRDS | On the Worst-Case Initial Configuration for Conservative Connectivity Preservation. | Daichi Kaino, Taisuke Izumi |
| 2013 | ISPDC | When Expanders Help Self-Healing Distributed R-Tree Overlays. | Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero |
| 2013 | SSS | Scalable Estimation of Network Average Degree. | Taisuke Izumi, Hironobu Kanzaki |
| 2012 | FOCS | A New Direction for Counting Perfect Matchings. | Taisuke Izumi, Tadashi Wadayama |
| 2012 | TAMC | Minimum Certificate Dispersal with Tree Structures. | Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada |
| 2011 | MFCS | On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinov, Koichi Wada |
| 2010 | DSN | Doubly-expedited one-step Byzantine consensus. | Nazreen Banu, Taisuke Izumi, Koichi Wada |
| 2010 | OPODIS | Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks. | Keigo Kinpara, Tomoko Izumi, Taisuke Izumi, Koichi Wada |
| 2010 | SIROCCO | Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings. | Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita |
| 2010 | SSS | Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility. | Taisuke Izumi, Maria Gradinariu Potop-Butucaru, Sbastien Tixeuil |
| 2009 | COCOON | Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. | Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada |
| 2009 | OPODIS | Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction. | Toshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada |
| 2009 | PDCAT | A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines. | Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi |
| 2009 | SIROCCO | Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents. | Shukai Cai, Taisuke Izumi, Koichi Wada |
| 2009 | SIROCCO | Convergence of Mobile Robots with Uniformly-Inaccurate Sensors. | Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada |
| 2009 | SSS | Randomized Gathering of Mobile Robots with Local-Multiplicity Detection. | Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita |
| 2009 | SSS | Oracle-Based Flocking of Mobile Robots in Crash-Recovery Model. | Samia Souissi, Taisuke Izumi, Koichi Wada |
| 2008 | PDPTA | Construction of Loosely-Structured Overlay Using Bloom Filter. | Yusuke Takahashi, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa |
| 2008 | SIROCCO | Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. | Nobuhiro Inuzuka, Yuichi Tomida, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada |
| 2007 | SAC | An adaptive randomized search protocol in peer-to-peer systems. | Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa |
| 2007 | SIROCCO | Optimal Moves for Gossiping Among Mobile Agents. | Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa |
| 2007 | SSS | On the Probabilistic Omission Adversary. | Taisuke Izumi, Koichi Wada |
| 2006 | SSS | Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System. | Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa |
| 2005 | SIROCCO | An Improved Algorithm for Adaptive Condition-Based Consensus. | Taisuke Izumi, Toshimitsu Masuzawa |
| 2004 | DSN | Timed Uniform Consensus Resilient to Crash and Timing Faults. | Taisuke Izumi, Akinori Saitoh, Toshimitsu Masuzawa |