Koichi Wada - RankMe

142 papers A 9B 29C 18Misc 5Journal 69Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Gathering semi-synchronously scheduled two-state robots. Theor. Comput. Sci. Kohei Otaka, Fabian Frei, Koichi Wada
2025	C	`conf`	Beyond Pairwise Comparisons: Unveiling Structural Landscape of Mobile Robot Models. SSS Shota Naito, Tsukasa Ninomiya, Koichi Wada
2025	A	`conf`	Brief Announcement: The Virtue of Self-Consistency. DISC Fabian Frei, Koichi Wada
2025	J	`jnl`	Complete Visibility Algorithms of Luminous Robots With Two-Color Lights on Grid. Concurr. Comput. Pract. Exp. Yonghwan Kim, Yoshiaki Katayama, Koichi Wada
2025	J	`jnl`	Gathering on Rings for Myopic Asynchronous Robots with Lights. Theory Comput. Syst. Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada
2025	J	`jnl`	On the computational power of energy-constrained mobile robots. Inf. Comput. Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada
2025	—	`conf`	Pairbot: Enhancing Computational Capabilities by Pairing of Autonomous Mobile Robots. IPDPS (Workshops) Yonghwan Kim, Yoshiaki Katayama, Koichi Wada
2025	J	`jnl`	Separation of Three or More Autonomous Mobile Models under Hierarchical Schedulers. CoRR Shota Naito, Tsukasa Ninomiya, Koichi Wada
2025	J	`jnl`	Two-Robot Computational Landscape: A Complete Characterization of Model Power in Minimal Mobile Robot Systems. CoRR Naoki Kitamura, Yuichi Sudo, Koichi Wada
2024	B	`ed.`	27th International Conference on Principles of Distributed Systems, OPODIS 2023, Tokyo, Japan, December 6-8, 2023 OPODIS Alysson Bessani, Xavier Défago, Junya Nakamura, Koichi Wada, Yukiko Yamauchi
2024	A	`conf`	Brief Announcement: Distinct Gathering Under Round Robin. DISC Fabian Frei, Koichi Wada
2024	C	`conf`	Efficient GPU-Implementation of H-P Sort Based on Improved Histogram Computation. HPC Asia Kaito Takase, Takumi Hagihara, Noriyuki Fujimoto, Koichi Wada
2024	B	`conf`	Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. SIROCCO Keita Nakajima, Kaito Takase, Koichi Wada
2024	C	`conf`	Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. SSS Keita Nakajima, Kaito Takase, Koichi Wada
2024	J	`jnl`	Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. CoRR Keita Nakajima, Kaito Takase, Koichi Wada
2024	C	`conf`	Gathering Semi-Synchronously Scheduled Two-State Robots. SSS Kohei Otaka, Fabian Frei, Koichi Wada
2024	J	`jnl`	Gathering Semi-Synchronously Scheduled Two-State Robots. CoRR Kohei Otaka, Fabian Frei, Koichi Wada
2024	C	`conf`	Invited Paper: Gathering Oblivious Robots in the Plane. SSS Fabian Frei, Koichi Wada
2024	J	`jnl`	Neighborhood mutual remainder: self-stabilizing distributed implementation and applications. Acta Informatica Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada
2023	—	`conf`	Asynchronous Complete Visibility Algorithm for Luminous Robots on Grid. CANDARW Yonghwan Kim, Yoshiaki Katayama, Koichi Wada
2023	J	`jnl`	Complete Visibility Algorithm for Autonomous Mobile Luminous Robots under an Asynchronous Scheduler on Grid Plane. CoRR Yonghwan Kim, Yoshiaki Katayama, Koichi Wada
2023	J	`jnl`	Efficient deterministic MapReduce algorithms for parallelizable problems. J. Parallel Distributed Comput. Fabian Frei, Koichi Wada
2023	J	`jnl`	Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots. Concurr. Comput. Pract. Exp. Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, Koichi Wada
2023	J	`jnl`	Gathering problems for autonomous mobile robots with lights. Theor. Comput. Sci. Satoshi Terai, Koichi Wada, Yoshiaki Katayama
2023	J	`jnl`	Location functions for self-stabilizing byzantine tolerant swarms. Theor. Comput. Sci. Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada
2023	B	`conf`	On Asynchrony, Memory, and Communication: Separations and Landscapes. OPODIS Paola Flocchini, Nicola Santoro, Yuichi Sudo, Koichi Wada
2023	J	`jnl`	On Asynchrony, Memory, and Communication: Separations and Landscapes. CoRR Paola Flocchini, Nicola Santoro, Yuichi Sudo, Koichi Wada
2023	J	`jnl`	Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights. Theor. Comput. Sci. Takashi Okumura, Koichi Wada, Xavier Défago
2023	J	`jnl`	Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space. Robotics Auton. Syst. Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada
2022	B	`conf`	On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis. SIROCCO Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada
2022	J	`jnl`	On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis. CoRR Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada
2021	C	`conf`	Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights. SSS Rikuo Nakai, Yuichi Sudo, Koichi Wada
2021	J	`jnl`	Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights. CoRR Rikuo Nakai, Yuichi Sudo, Koichi Wada
2021	B	`conf`	Asynchronous Gathering in a Torus. OPODIS Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada
2021	J	`jnl`	Asynchronous Gathering in a Torus. CoRR Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada
2021	—	`conf`	Autonomous Mobile Robots: Refining the Computational Landscape. IPDPS Workshops Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada
2021	B	`conf`	Efficient GPU-Implementation for Integer Sorting Based on Histogram and Prefix-Sums. ICPP Seiya Kozakai, Noriyuki Fujimoto, Koichi Wada
2021	C	`conf`	Location Functions for Self-stabilizing Byzantine Tolerant Swarms. SSS Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada
2020	J	`jnl`	Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots. CoRR Yonghwan Kim, Yoshiaki Katayama, Koichi Wada
2020	B	`conf`	Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space. SRDS Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada
2019	B	`conf`	A Measurement Coding System for Block-Based Compressive Sensing Images by Using Pixel-Domain Features. DCC Jirayu Peetakul, Jinjia Zhou, Koichi Wada
2019	C	`conf`	Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots. SSS Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, Koichi Wada
2019	A	`conf`	Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space. DISC Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada
2019	A	`conf`	Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. DISC Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada
2019	C	`conf`	Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder. SSS Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada
2019	B	`conf`	Efficient Circuit Simulation in MapReduce. ISAAC Fabian Frei, Koichi Wada
2019	J	`jnl`	Efficient Circuit Simulation in MapReduce. CoRR Fabian Frei, Koichi Wada
2019	—	`conf`	Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots. CANDAR Workshops Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, Koichi Wada
2019	B	`conf`	Gathering on Rings for Myopic Asynchronous Robots With Lights. OPODIS Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada
2019	J	`jnl`	Gathering on Rings for Myopic Asynchronous Robots with Lights. CoRR Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada
2019	J	`jnl`	Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract). CoRR Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada
2019	B	`conf`	On Memory, Communication, and Synchronous Schedulers When Moving and Computing. OPODIS Paola Flocchini, Nicola Santoro, Koichi Wada
2019	J	`jnl`	Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space. CoRR Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada
2018	J	`jnl`	Gathering Problems for Autonomous Mobile Robots with Lights. CoRR Satoshi Terai, Koichi Wada, Yoshiaki Katayama
2018	B	`conf`	Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights. OPODIS Takashi Okumura, Koichi Wada, Xavier Défago
2018	J	`jnl`	Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights. CoRR Takashi Okumura, Koichi Wada, Xavier Défago
2018	—	`conf`	Rendezvous of Asynchronous Mobile Robots with Lights. Adventures Between Lower Bounds and Higher Altitudes Takashi Okumura, Koichi Wada, Yoshiaki Katayama
2017	C	`conf`	Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights. SSS Takashi Okumura, Koichi Wada, Yoshiaki Katayama
2017	J	`jnl`	Optimal Asynchronous Rendezvous for Mobile Robots with Lights. CoRR Takashi Okumura, Koichi Wada, Yoshiaki Katayama
2015	J	`jnl`	Approximability of minimum certificate dispersal with tree structures. Theor. Comput. Sci. Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
2015	J	`jnl`	Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. Theor. Comput. Sci. Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2014	—	`conf`	Computational Models for Big Data Processing. CANDAR Koichi Wada
2014	J	`jnl`	Space-efficient self-stabilizing counting population protocols on mobile sensor networks. Theor. Comput. Sci. Tomoko Izumi, Keigo Kinpara, Taisuke Izumi, Koichi Wada
2013	C	`conf`	Self-stabilizing DAG-Constructing Protocols with Application to Geocast in MANET. SSS Koichi Ito, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi
2012	J	`jnl`	How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model. Theory Comput. Syst. Shukai Cai, Taisuke Izumi, Koichi Wada
2012	C	`conf`	Minimum Certificate Dispersal with Tree Structures. TAMC Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
2012	J	`jnl`	On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2012	J	`jnl`	The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. SIAM J. Comput. Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita
2012	J	`jnl`	The optimal tolerance of uniform observation error for mobile robot convergence. Theor. Comput. Sci. Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada
2011	J	`jnl`	Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems. Parallel Process. Lett. Nazreen Banu, Taisuke Izumi, Koichi Wada
2011	—	`conf`	An efficient routing protocol on a Dynamic Cluster-based Sensor Network. CrownCom Islam A. K. M. Muzahidul, Shahrum Shah Abdullah, Koichi Wada, Jiro Uchida, Wei Chen
2011	A	`conf`	Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. DISC Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada
2011	Misc	`conf`	Distributed Algorithms for Cooperative Mobile Robots: A Survey. ICNC Samia Souissi, Taisuke Izumi, Koichi Wada
2011	J	`jnl`	Minimum Certificate Dispersal with Tree Structures CoRR Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
2011	J	`jnl`	On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances CoRR Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011	B	`conf`	On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011	J	`jnl`	Oracle-based flocking of mobile robots in crash-recovery model. Theor. Comput. Sci. Samia Souissi, Taisuke Izumi, Koichi Wada
2011	J	`jnl`	The BG-simulation for Byzantine Mobile Robots CoRR Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada
2011	J	`jnl`	The Gathering Problem for Two Oblivious Robots with Unreliable Compasses CoRR Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita
2011	Misc	`conf`	Time-Efficient Data Congregation Protocols on Wireless Sensor Network. ISUVR Islam A. K. M. Muzahidul, Koichi Wada, Wei Chen
2010	J	`jnl`	Approximability and inapproximability of the minimum certificate dispersal problem. Theor. Comput. Sci. Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada
2010	A	`conf`	Doubly-expedited one-step Byzantine consensus. DSN Nazreen Banu, Taisuke Izumi, Koichi Wada
2010	J	`jnl`	Foreword. Math. Comput. Sci. Mirka Miller, Koichi Wada
2010	B	`conf`	Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks. OPODIS Keigo Kinpara, Tomoko Izumi, Taisuke Izumi, Koichi Wada
2009	—	`conf`	Autonomous market-based approach for resource allocation in a cluster-based sensor network. MCDM Wei Chen, Heh Miao, Koichi Wada
2009	B	`conf`	Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction. OPODIS Toshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada
2009	B	`conf`	Convergence of Mobile Robots with Uniformly-Inaccurate Sensors. SIROCCO Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada
2009	C	`conf`	Oracle-Based Flocking of Mobile Robots in Crash-Recovery Model. SSS Samia Souissi, Taisuke Izumi, Koichi Wada
2009	Misc	`conf`	Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. COCOON Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada
2009	B	`conf`	Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents. SIROCCO Shukai Cai, Taisuke Izumi, Koichi Wada
2008	J	`jnl`	Construction and Maintenance of a Novel Cluster-based Architecture for Ad Hoc Sensor Networks. Ad Hoc Sens. Wirel. Networks Jiro Uchida, Islam A. K. M. Muzahidul, Yoshiaki Katayama, Wei Chen, Koichi Wada
2008	B	`conf`	Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. SIROCCO Nobuhiro Inuzuka, Yuichi Tomida, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada
2008	C	`ed.`	Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan IWOCA Mirka Miller, Koichi Wada
2007	J	`jnl`	Acknowledged broadcasting and gossiping in ad hoc radio networks. Theor. Comput. Sci. Jiro Uchida, Wei Chen, Koichi Wada
2007	B	`conf`	Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots. SIROCCO Yoshiaki Katayama, Yuichi Tomida, Hiroyuki Imazu, Nobuhiro Inuzuka, Koichi Wada
2007	J	`jnl`	Efficient Initialization Algorithms on Single-Hop Radio Networks. IEICE Trans. Inf. Syst. Naoki Inaba, Koichi Wada
2007	A	`conf`	Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result. DISC Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada
2007	A	`conf`	Novel Broadcast/Multicast Protocols for Dynamic Sensor Networks. IPDPS Wei Chen, Islam A. K. M. Muzahidul, Mohan Malkani, Amir Shirkhodaie, Koichi Wada, Mohamed Zein-Sabatto
2007	C	`conf`	On the Probabilistic Omission Adversary. SSS Taisuke Izumi, Koichi Wada
2006	J	`jnl`	A pattern formation algorithm for a set of autonomous distributed robots with agreement on orientation along one axis. Syst. Comput. Jpn. Masao Kasuya, Nobuhiro Ito, Nobuhiro Inuzuka, Koichi Wada
2006	J	`jnl`	An Approximation Algorithm for Minimum Certificate Dispersal Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hua Zheng, Shingo Omura, Koichi Wada
2006	—	`conf`	Construction and Maintenance of a Cluster-Based Architecture for Sensor Networks. HICSS Jiro Uchida, Islam A. K. M. Muzahidul, Yoshiaki Katayama, Wei Chen, Koichi Wada
2006	J	`jnl`	Special Section on Invited Papers from New Horizons in Computing. IEICE Trans. Inf. Syst. Koichi Wada
2005	J	`jnl`	An Optimal Certificate Dispersal Algorithm for Mobile Ad Hoc Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hua Zheng, Shingo Omura, Jiro Uchida, Koichi Wada
2005	J	`jnl`	Neighborhood Broadcasting in Undirected de Bruijn and Kautz Networks. IEICE Trans. Inf. Syst. Shingo Omura, Hua Zheng, Koichi Wada
2005	J	`jnl`	Parallel matrix-multiplication algorithm for distributed parallel computers. Syst. Comput. Jpn. Masamitsu Hattori, Nobuhiro Ito, Wei Chen, Koichi Wada
2004	—	`conf`	An Optimal Certificate Dispersal Algorithm for Mobile Ad Hoc Networks. ISPDC/HeteroPar Hua Zheng, Shingo Omura, Jiro Uchida, Koichi Wada
2004	J	`jnl`	Optimal fault-tolerant routings with small routing tables for J. Discrete Algorithms Koichi Wada, Wei Chen
2003	B	`conf`	Acknowledged Broadcasting and Gossiping in Ad Hoc Radio Networks. OPODIS Jiro Uchida, Wei Chen, Koichi Wada
2003	C	`conf`	An Optimal Algorithm of Acknowledged Broadcasting in Ad Hoc Radio Networks. ISPDC Takaya Okuwa, Wei Chen, Koichi Wada
2003	B	`conf`	Reinforcement Learning Methods to Handle Actions with Differing Costs in MDPs. KES Takahisa Ishiguro, Tohgoroh Matsui, Nobuhiro Inuzuka, Koichi Wada
2002	J	`jnl`	On Computing the Upper Envelope of Segments in Parallel. IEEE Trans. Parallel Distributed Syst. Wei Chen, Koichi Wada
2002	J	`jnl`	Robust algorithms for constructing strongly convex hulls in parallel. Theor. Comput. Sci. Wei Chen, Koichi Wada, Kimio Kawaguchi
2001	C	`conf`	A Design of Agents for the Disaster Simulator on RoboCup-Rescue. RoboCup Taku Sakushima, Tetsuya Esaki, Yoshiki Asai, Nobuhiro Ito, Koichi Wada
2001	J	`jnl`	Constructing a Strongly Convex Superhull of Points. Int. J. Comput. Geom. Appl. Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi
2001	Misc	`conf`	Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM. COCOON Carla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara
2000	—	`conf`	A Hardware Implementation of PRAM and Its Performance Evaluation. IPDPS Workshops M. Imai, Y. Hayakawa, H. Kawanaka, Wei Chen, Koichi Wada, Carla Denise Castanho, Y. Okajima, H. Okamoto
2000	C	`conf`	Kakitsubata Team Description. RoboCup Tetsuya Esaki, Taku Sakushima, Shinji Futamase, Nobuhiro Ito, Tomoichi Takahashi, Wei Chen, Koichi Wada
2000	B	`conf`	Optimal Fault-Tolerant Routings for WG Koichi Wada, Wei Chen
2000	J	`jnl`	Parallel Algorithms for Partitioning Sorted Sets and Related Problems. Algorithmica Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
1999	B	`conf`	An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs. WG Koichi Wada, Yoriyuki Nagata, Wei Chen
1998	J	`jnl`	Efficient Algorithms for a Mixed Theor. Comput. Sci. Koichi Wada, Akinari Takaki, Kimio Kawaguchi
1998	J	`jnl`	Finding the Convex Hull of Discs in Parallel. Int. J. Comput. Geom. Appl. Wei Chen, Koichi Wada, Kimio Kawaguchi, Danny Z. Chen
1998	J	`jnl`	Integer Summing Algorithms on Reconfigurable Meshes. Theor. Comput. Sci. Koji Nakano, Koichi Wada
1998	B	`conf`	Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases. WG Koichi Wada, Wei Chen
1998	B	`conf`	On Computing the Upper Envelope of Segments in Parallel. ICPP Wei Chen, Koichi Wada
1997	Misc	`conf`	Constructing a Strongly Convex Superhull of Points. COCOON Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi
1997	J	`jnl`	Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs. J. Parallel Distributed Comput. Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
1997	B	`conf`	Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. WG Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi
1996	A	`conf`	Parallel Algorithms for Partitioning Sorted Sets and Related Problems. ESA Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
1996	—	`conf`	Parallel Robust Algorithms for Constructing Strongly Convex Hulls. SCG Wei Chen, Koichi Wada, Kimio Kawaguchi
1995	B	`conf`	Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. WG Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
1994	B	`conf`	Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. WG Koichi Wada, Akinari Takaki, Kimio Kawaguchi
1993	B	`conf`	Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. WG Koichi Wada, Kimio Kawaguchi
1993	J	`jnl`	New Results in Graph Routing Inf. Comput. Kimio Kawaguchi, Koichi Wada
1992	J	`jnl`	Distributed algorithms for connectivity problem of networks with faulty elements. Syst. Comput. Jpn. Koichi Wada, Yukio Moritani, Kimio Kawaguchi, Masahiro Morishita
1992	J	`jnl`	Efficient Fault-Tolerant Fixed Routings on ( Discret. Appl. Math. Koichi Wada, Kimio Kawaguchi
1992	J	`jnl`	Optimal Fault-Tolerant Routings for Connected Graphs. Inf. Process. Lett. Koichi Wada, Yupin Luo, Kimio Kawaguchi
1989	J	`jnl`	Maximum lower bound on embedding areas of general graphs. Syst. Comput. Jpn. Koichi Wada, Kimio Kawaguchi, Hideyuki Fujishima
1987	J	`jnl`	Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs. Syst. Comput. Jpn. Koichi Wada, Kimio Kawaguchi, Yupin Luo
1986	J	`jnl`	Embedding area of d-way shuffle graph on a VLSI model. Syst. Comput. Jpn. Koichi Wada, Kenichi Hagihara, Nobuki Tokura
1986	J	`jnl`	Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees. Syst. Comput. Jpn. Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura, Koichi Wada