Availability of k-Coterie. - Hirotsugu Kakugawa; Satoshi Fujita; Masafumi Yamashita; Tadashi Ae (IEEE Trans. Computers, 1993)

A Distributed k-Mutual Exclusion Algorithm Using k-Coterie. - Hirotsugu Kakugawa; Satoshi Fujita; Masafumi Yamashita; Tadashi Ae (Inf. Process. Lett., 1994)

Lock Based Self-Stabilizing Distributed Mutual Exclusion Algorithms. - Masaaki Mizuno; Mikhail Nesterenko; Hirotsugu Kakugawa (ICDCS, 1996)

A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments. - Masaaki Mizuno; Hirotsugu Kakugawa (WDAG, 1996)

Development of self-stabilizing distributed algorithms using transformation: case studies. - Hirotsugu Kakugawa; Masaaki Mizuno; Mikhail Nesterenko (WSS, 1997)

Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon. - Hirotsugu Kakugawa; Masafumi Yamashita (IEEE Trans. Parallel Distributed Syst., 1997)

A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States. - Narutoshi Umemoto; Hirotsugu Kakugawa; Masafumi Yamashita (IEEE Trans. Parallel Distributed Syst., 1998)

A Self-Stabilizing Algorithm for Finding Cliques in Distributed Systems. - Hiroko Ishii; Hirotsugu Kakugawa (SRDS, 2002)

Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct. - Hirotsugu Kakugawa; Masafumi Yamashita (SRDS, 2002)

A Self-Stabilizing Algorithm for the Steiner Tree Problem. - Sayaka Kamei; Hirotsugu Kakugawa (SRDS, 2002)

Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon. - Hirotsugu Kakugawa; Masafumi Yamashita (J. Parallel Distributed Comput., 2002)

A Learning System for the Problem of Mutual Exclusion in Multithreaded Programming. - Eisuke Yoshida; Hirotsugu Kakugawa (ICALT, 2004)

A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks. - Hirotsugu Kakugawa; Masafumi Yamashita (OPODIS, 2004)

A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem. - Sayaka Kamei; Hirotsugu Kakugawa (IEICE Trans. Inf. Syst., 2004)

Self-stabilization in Spite of Frequent Changes of Networks: Case Study of Mutual Exclusion on Dynamic Rings. - Toshimitsu Masuzawa; Hirotsugu Kakugawa (Self-Stabilizing Systems, 2005)

A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination. - Sayaka Kamei; Hirotsugu Kakugawa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Bio-inspired Replica Density Control in Dynamic Networks. - Tomoko Suzuki; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (BioADIT, 2006)

A self-stabilizing minimal dominating set algorithm with safe convergence. - Hirotsugu Kakugawa; Toshimitsu Masuzawa (IPDPS, 2006)

An advanced performance analysis of self-stabilizing protocols: stabilization time with transient faults during convergence. - Yoshihiro Nakaminami; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IPDPS, 2006)

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 (SSS, 2006)

Composition of Fault-Containing Protocols Based on Recovery Waiting Fault-Containing Composition Framework. - Yukiko Yamauchi; Sayaka Kamei; Fukuhito Ooshita; Yoshiaki Katayama; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2006)

A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks. - Ken Miura; Taro Tagawa; Hirotsugu Kakugawa (IEEE Trans. Parallel Distributed Syst., 2006)

An adaptive randomized search protocol in peer-to-peer systems. - Yu Wu; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SAC, 2007)

Optimal Moves for Gossiping Among Mobile Agents. - Tomoko Suzuki; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SIROCCO, 2007)

A stable clustering algorithm for mobile ad hoc networks based on attractor selection. - Gen Nishikawa; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (BIONETICS, 2008)

A Robustness based Ant Colony Optimization Routing for Ad Hoc Networks with GPSs. - Daisuke Kadono; Tomoko Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (ICWN, 2008)

A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence. - Sayaka Kamei; Hirotsugu Kakugawa (OPODIS, 2008)

Construction of Loosely-Structured Overlay Using Bloom Filter. - Yusuke Takahashi; Taisuke Izumi; Hirotsugu Kakugawa; Toshimitsu Masuzawa (PDPTA, 2008)

Convergence Time Analysis of Self-stabilizing Algorithms in Wireless Sensor Networks with Unreliable Links. - Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2008)

An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks. - Yusuke Takahashi; Taisuke Izumi; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2008)

Move-optimal gossiping among mobile agents. - Tomoko Suzuki; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Theor. Comput. Sci., 2008)

A Token-Based Distributed Group Mutual Exclusion Algorithm with Quorums. - Hirotsugu Kakugawa; Sayaka Kamei; Toshimitsu Masuzawa (IEEE Trans. Parallel Distributed Syst., 2008)

Cached Sensornet Transformation of Non-silent Self-stabilizing Algorithms with Unreliable Links. - Hirotsugu Kakugawa; Yukiko Yamauchi; Sayaka Kamei; Toshimitsu Masuzawa (SSS, 2009)

A Biologically Inspired Self-Adaptation of Replica Density Control. - Tomoko Izumi; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2009)

Foreword. - Hirotsugu Kakugawa (IEICE Trans. Inf. Syst., 2009)

A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection. - Gen Nishikawa; Tomoko Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2009)

A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination. - Yu Wu; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2009)

Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays. - Yu Wu; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2009)

Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property. - Yukiko Yamauchi; Sayaka Kamei; Fukuhito Ooshita; Yoshiaki Katayama; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2009)

A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem. - Hirotsugu Kakugawa; Sayaka Kamei (OPODIS, 2010)

An agent exploration in unknown undirected graphs with whiteboards. - Yuichi Sudo; Daisuke Baba; Junya Nakamura 001; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (WRAS, 2010)

Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees. - Daisuke Baba; Tomoko Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SIROCCO, 2010)

An ant colony optimization routing based on robustness for ad hoc networks with GPSs. - Daisuke Kadono; Tomoko Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Ad Hoc Networks, 2010)

A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set. - Sayaka Kamei; Hirotsugu Kakugawa (Int. J. Found. Comput. Sci., 2010)

Timer-based composition of fault-containing self-stabilizing protocols. - Yukiko Yamauchi; Sayaka Kamei; Fukuhito Ooshita; Yoshiaki Katayama; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Inf. Sci., 2010)

Self-Stabilization in Unstable Network Environments. - Toshimitsu Masuzawa; Hirotsugu Kakugawa (ICNC, 2011)

Preface. - Akihiro Fujiwara; Hirotsugu Kakugawa; Koji Nakano (Int. J. Found. Comput. Sci., 2011)

Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures. - Hirotsugu Kakugawa; Yukiko Yamauchi; Sayaka Kamei; Toshimitsu Masuzawa (Theor. Comput. Sci., 2011)

Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings. - Masahiro Shibata; Shinji Kawai; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (OPODIS, 2012)

Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks. - Shinji Kawai; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SIROCCO, 2012)

Communication-Efficient Self-stabilization in Wireless Networks. - Tomoya Takimoto; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2012)

Owens Luis - A context-aware multi-modal smart office chair in an ambient environment. - Kiyoshi Kiyokawa; Masahide Hatanaka; Kazufumi Hosoda; Masashi Okada; Hironori Shigeta; Yasunori Ishihara; Fukuhito Ooshita; Hirotsugu Kakugawa; Satoshi Kurihara; Koichi Moriyama (VR, 2012)

Implementation of a smart office system in an ambient environment. - Hironori Shigeta; Junya Nakase; Yuta Tsunematsu; Kiyoshi Kiyokawa; Masahide Hatanaka; Kazufumi Hosoda; Masashi Okada; Yasunori Ishihara; Fukuhito Ooshita; Hirotsugu Kakugawa; Satoshi Kurihara; Koichi Moriyama (VR, 2012)

Self-stabilising protocols on oriented chains with joins and leaves. - Doina Bein; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Int. J. Auton. Adapt. Commun. Syst., 2012)

A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs. - Sayaka Kamei; Hirotsugu Kakugawa (Theor. Comput. Sci., 2012)

Loosely-stabilizing leader election in a population protocol model. - Yuichi Sudo; Junya Nakamura 001; Yukiko Yamauchi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Theor. Comput. Sci., 2012)

Zigzag: Local-Information-Based Self-Optimizing Routing in Virtual Grid Networks. - Shusuke Takatsu; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (ICDCS, 2013)

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks. - Sayaka Kamei; Hirotsugu Kakugawa; Stéphane Devismes; Sébastien Tixeuil (J. Comb. Optim., 2013)

Linear time and space gathering of anonymous mobile agents in asynchronous trees. - Daisuke Baba; Tomoko Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Theor. Comput. Sci., 2013)

Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols. - Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (OPODIS, 2014)

Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator. - Shinji Kawai; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Parallel Process. Lett., 2014)

Randomized Gathering of Mobile Agents in Anonymous Unidirectional Ring Networks. - Fukuhito Ooshita; Shinji Kawai; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEEE Trans. Parallel Distributed Syst., 2014)

Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers. - Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (OPODIS, 2015)

Partial Gathering of Mobile Agents in Asynchronous Rings. - Masahiro Shibata; Shinji Kawai; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (CoRR, 2015)

A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards. - Yuichi Sudo; Daisuke Baba; Junya Nakamura 001; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

On the family of critical section problems. - Hirotsugu Kakugawa (Inf. Process. Lett., 2015)

Self-stabilizing distributed algorithm for local mutual inclusion. - Hirotsugu Kakugawa (Inf. Process. Lett., 2015)

Mutual inclusion in asynchronous message-passing distributed systems. - Hirotsugu Kakugawa (J. Parallel Distributed Comput., 2015)

Partial gathering of mobile agents in asynchronous unidirectional rings. - Masahiro Shibata; Shinji Kawai; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Theor. Comput. Sci., 2016)

An Asynchronous Message-Passing Distributed Algorithm for the Global Critical Section Problem. - Sayaka Kamei; Hirotsugu Kakugawa (CANDAR, 2017)

How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults. - Tsuyoshi Gotoh; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2017)

Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem. - Hisaki Kobayashi; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2017)

Brief Announcement: Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings. - Masahiro Shibata; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2017)

An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem. - Sayaka Kamei; Hirotsugu Kakugawa (Algorithms, 2017)

Self-Stabilizing Algorithm for Dynamically Maintaining Two Disjoint Dominating Sets. - Sayaka Kamei; Hirotsugu Kakugawa (CANDAR Workshops, 2018)

Group Exploration of Dynamic Tori. - Tsuyoshi Gotoh; Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (ICDCS, 2018)

A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence. - Sayaka Kamei; Hirotsugu Kakugawa (ICPADS, 2018)

Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time. - Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (DISC, 2018)

Uniform deployment of mobile agents in asynchronous rings. - Masahiro Shibata; Toshiya Mega; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (J. Parallel Distributed Comput., 2018)

Move-optimal partial gathering of mobile agents in asynchronous trees. - Masahiro Shibata; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Theor. Comput. Sci., 2018)

A Population Protocol Model with Interaction Probability Considering Speeds of Agents. - Ryoya Sadano; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa (ICDCS, 2019)

A Self-Stabilizing Algorithm for the Local (1, |Ni|)-Critical Section Problem with Safe Convergence. - Sayaka Kamei; Hirotsugu Kakugawa (IPDPS Workshops, 2019)

Logarithmic Expected-Time Leader Election in Population Protocol Model. - Yuichi Sudo; Fukuhito Ooshita; Taisuke Izumi; Hirotsugu Kakugawa; Toshimitsu Masuzawa (PODC, 2019)

A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault. - Koki Inoue; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SIROCCO, 2019)

Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings. - Masahiro Shibata; Norikazu Kawata; Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SIROCCO, 2019)

Atomic Cross-Chain Swaps with Improved Space and Local Time Complexity. - Soichiro Imoto; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2019)

Atomic Cross-Chain Swaps with Improved Space and Time Complexity. - Soichiro Imoto; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa (CoRR, 2019)

Partial Gathering of Mobile Agents in Arbitrary Networks. - Masahiro Shibata; Daisuke Nakamura; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2019)

Asynchronous message-passing distributed algorithm for the global critical section problem. - Sayaka Kamei; Hirotsugu Kakugawa (Int. J. Netw. Comput., 2019)

Energy Balancing by Wireless Energy Transfer in Sensor Networks. - Hiroshi Michizu; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Int. J. Netw. Comput., 2019)

Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model. - Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa; Ajoy K. Datta; Lawrence L. Larmore (IEEE Trans. Parallel Distributed Syst., 2019)

Efficient Dispersion of Mobile Agents without Global Knowledge. - Takahiro Shintaku; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2020)

Loosely Stabilizing Leader Election on Arbitrary Graphs in Population Protocols without Identifiers or Random Numbers. - Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2020)

Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings. - Masahiro Shibata; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Theor. Comput. Sci., 2020)

Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings. - Masahiro Shibata; Norikazu Kawata; Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Theor. Comput. Sci., 2020)

Loosely-stabilizing leader election with polylogarithmic convergence time. - Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa; Ajoy K. Datta; Lawrence L. Larmore (Theor. Comput. Sci., 2020)

Time-Optimal Leader Election in Population Protocols. - Yuichi Sudo; Fukuhito Ooshita; Taisuke Izumi; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEEE Trans. Parallel Distributed Syst., 2020)

A Distributed Multi-group Mutual Exclusion Algorithm for Intersection Traffic Control. - Hirotsugu Kakugawa; Sayaka Kamei (CANDAR (Workshops), 2021)

A self-stabilizing token circulation with graceful handover on bidirectional ring networks. - Hirotsugu Kakugawa; Sayaka Kamei (IPDPS Workshops, 2021)

A self-stabilizing distributed algorithm for the local (1, |Ni|)-critical section problem. - Sayaka Kamei; Hirotsugu Kakugawa (Concurr. Comput. Pract. Exp., 2021)

A Self-stabilizing 1-maximal Independent Set Algorithm. - Hideyuki Tanaka; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa; Ajoy K. Datta (J. Inf. Process., 2021)

Exploration of dynamic tori by multiple agents. - Tsuyoshi Gotoh; Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Theor. Comput. Sci., 2021)

A linear-time self-stabilizing distributed algorithm for the minimal minus ($L, K, Z$) -domination problem under the distance-2 model. - Hirotsugu Kakugawa; Sayaka Kamei (CANDARW, 2022)

A self-stabilizing 2-minimal dominating set algorithm based on loop composition in networks of girth at least 7. - Syohei Maruyama; Yuichi Sudo; Sayaka Kamei; Hirotsugu Kakugawa (IPDPS, 2022)

Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles. - Kohei Shimoyama; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2022)

A self-stabilizing token circulation with graceful handover on bidirectional ring networks. - Hirotsugu Kakugawa; Sayaka Kamei; Yoshiaki Katayama (Int. J. Netw. Comput., 2022)

A Self-Stabilizing Distributed Algorithm for the Generalized Dominating Set Problem With Safe Convergence. - Hisaki Kobayashi; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Comput. J., 2023)

Atomic cross-chain swaps with improved space, time and local time complexities. - Soichiro Imoto; Yuichi Sudo; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Inf. Comput., 2023)

Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. - Quentin Bramas; Hirotsugu Kakugawa; Sayaka Kamei; Anissa Lamani; Fukuhito Ooshita; Masahiro Shibata; Sébastien Tixeuil (AINA (2), 2024)

Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings. - Fukuhito Ooshita; Naoki Kitamura; Ryota Eguchi; Michiko Inoue; Hirotsugu Kakugawa; Sayaka Kamei; Masahiro Shibata; Yuichi Sudo (OPODIS, 2024)

A self-stabilizing distributed algorithm for the bounded lattice domination problems under the distance-2 model. - Hirotsugu Kakugawa; Sayaka Kamei (Concurr. Comput. Pract. Exp., 2024)

Self-stabilizing 2-minimal dominating set algorithms based on loop composition. - Syohei Maruyama; Yuichi Sudo; Sayaka Kamei; Hirotsugu Kakugawa (Theor. Comput. Sci., 2024)

A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model. - Hirotsugu Kakugawa; Sayaka Kamei; Masahiro Shibata; Fukuhito Ooshita (Concurr. Comput. Pract. Exp., 2024)

A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines. - Quentin Bramas; Hirotsugu Kakugawa; Sayaka Kamei; Anissa Lamani; Fukuhito Ooshita; Masahiro Shibata; Sébastien Tixeuil (SIROCCO, 2025)