A flexible transmission technique for the satellite ISDB system. - Hisakazu Katoh; Akinori Hashimoto; Hajime Matsumura; Shigeru Yamazaki; Osamu Yamada (IEEE Trans. Broadcast., 1996)

Vertex-disjoint 4-cycles containing specified edges in a bipartite graph. - Hajime Matsumura (Discret. Math., 2005)

Degree Conditions and Degree Bounded Trees. - Hajime Matsumura (Electron. Notes Discret. Math., 2005)

Degree sum conditions and vertex-disjoint cycles in a graph. - Shinya Fujita 001; Hajime Matsumura; Masao Tsugaki; Tomoki Yamashita (Australas. J Comb., 2006)

Vertex-Disjoint Short Cycles Containing Specified Edges in a Graph. - Hajime Matsumura (Ars Comb., 2006)

On a k-Tree Containing Specified Leaves in a Graph. - Haruhide Matsuda; Hajime Matsumura (Graphs Comb., 2006)

Partitions of a graph into cycles containing a specified linear forest. - Ryota Matsubara; Hajime Matsumura (Discuss. Math. Graph Theory, 2008)

Cycle-Partitions with Specified Vertices and Edges. - Hikoe Enomoto; Hajime Matsumura (Ars Comb., 2009)

Degree conditions and degree bounded trees. - Haruhide Matsuda; Hajime Matsumura (Discret. Math., 2009)

Degree Bounded Spanning Trees. - Jun Fujisawa; Hajime Matsumura; Tomoki Yamashita (Graphs Comb., 2010)

Distributed Sampling Storage for Statistical Analysis of Massive Sensor Data. - Hiroshi Sato; Hisashi Kurasawa; Takeru Inoue; Motonori Nakamura; Hajime Matsumura; Kei'ichi Koyanagi (CD-ARES, 2012)

Online Top-k Similar Time-Lagged Pattern Pair Search in Multiple Time Series. - Hisashi Kurasawa; Hiroshi Sato; Motonori Nakamura; Hajime Matsumura (DEXA (2), 2012)

Top of worlds: method for improving motivation to participate in sensing services. - Hitoshi Kawasaki; Atsushi Yamamoto; Hisashi Kurasawa; Hiroshi Sato; Motonori Nakamura; Hajime Matsumura (UbiComp, 2012)

UBI-Tree: Indexing Method for Schema-Less Search. - Yutaka Arakawa; Takayuki Nakamura; Motonori Nakamura; Hajime Matsumura (COMPSAC Workshops, 2013)

Missing sensor value estimation method for participatory sensing environment. - Hisashi Kurasawa; Hiroshi Sato; Atsushi Yamamoto; Hitoshi Kawasaki; Motonori Nakamura; Yohei Fujii; Hajime Matsumura (PerCom, 2014)

On spanning k-tree in which specified vertices have degree less than k. - Hajime Matsumura (Discuss. Math. Graph Theory, 2015)

Degree sum conditions for path-factors with specified end vertices in bipartite graphs. - Ryota Matsubara; Hajime Matsumura; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2017)

A spanning k-spider in a graph. - Ryota Matsubara; Haruhide Matsuda; Hajime Matsumura (Ars Comb., 2018)

Spanning trees with small diameters. - Mikio Kano; Hajime Matsumura (AKCE Int. J. Graphs Comb., 2020)

Existence of a spanning tree having small diameter. - Yoshimi Egawa; Michitaka Furuya; Hajime Matsumura (Discret. Math., 2021)

Odd-Even Factors of Graphs. - Mikio Kano; Hajime Matsumura (Graphs Comb., 2025)