A novel interaction method based on a mobile device in intelligent space. - Ryotaro Matsuo; Joo-Ho Lee 001 (IROS, 2012)

A Solution for Minimum Link Flow Problem with Sparse Modeling. - Ryotaro Matsuo; Ryo Nakamura; Hiroyuki Ohsaki (COMPSAC (1), 2018)

A Study on Sparse-Modeling Based Approach for Betweenness Centrality Estimation. - Ryotaro Matsuo; Ryo Nakamura; Hiroyuki Ohsaki (COMPSAC (1), 2018)

Sparse Representation of Network Topology with K-SVD Algorithm. - Ryotaro Matsuo; Ryo Nakamura; Hiroyuki Ohsaki (COMPSAC (1), 2019)

On Estimating Network Topology from Observed Flow Sets at Measurement Nodes. - Keita Kitaura; Ryotaro Matsuo; Ryo Nakamura; Hiroyuki Ohsaki (COMPSAC, 2020)

A Solution for Recovering Network Topology with Missing Links using Sparse Modeling. - Ryotaro Matsuo; Hiroyuki Ohsaki (ICOIN, 2021)

On the Effect of Communication Link Heterogeneity on Content Delivery Delay in Information-Centric Delay Tolerant Networks. - Hisashi Sagayama; Ryotaro Matsuo; Hiroyuki Ohsaki (COMPSAC, 2022)

On Accelerating Multiple Random Walks with Loose Cooperation. - Jo Hagikura; Ryotaro Matsuo; Hiroyuki Ohsaki (ICOIN, 2022)

A Solution for Finding Quasi-Shortest Path with Graph Coarsening. - Takeaki Iwata; Keita Kitaura; Ryotaro Matsuo; Hiroyuki Ohsaki (ICOIN, 2022)

Random Walk on a Graph with Vicinity Avoidance. - Keita Kitaura; Ryotaro Matsuo; Hiroyuki Ohsaki (ICOIN, 2022)

A Study on the Applicability of Graph Reduction to Evaluating the Robustness of Complex Networks. - Tomoya Matoba; Ryotaro Matsuo; Ryo Nakamura (COMPSAC, 2024)

Obfuscation of Node Centrality in Networks. - Hiroki Kawamura; Ryotaro Matsuo; Hiroyuki Ohsaki (ICOIN, 2025)

Exploration Efficiency of Random Walks in Dynamic Graph. - Daiki Nakagawa; Ryotaro Matsuo; Hiroyuki Ohsaki (ICOIN, 2025)

Minimum Link Flow Problem and Its Solution With Sparse Modeling. - Ryotaro Matsuo; Ryo Nakamura; Hiroyuki Ohsaki (IEEE Access, 2025)