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

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)