Emergence and share of information through communication-performance of plants in group formation. - Yoshiyuki Miwa; Tomoki Yamashita; Yasuhiro Kusihashi (SMC, 1998)

Performance robot serving as communication media: development of an 'eyeball robot' investigating bodily communication. - Yoshiyuki Miwa; Hiroshi Itoh; Tomoki Yamashita; Kenichi Hirose (Adv. Robotics, 1998)

A Note on Dominating Cycles in Tough Graphs. - Akira Saito; Tomoki Yamashita (Ars Comb., 2003)

Cycles within specified distance from each vertex. - Akira Saito; Tomoki Yamashita (Discret. Math., 2004)

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

Edge-dominating cycles in graphs. - Shinya Fujita 001; Akira Saito; Tomoki Yamashita (Discret. Math., 2007)

Vertex-dominating cycles in 2-connected bipartite graphs. - Tomoki Yamashita (Discuss. Math. Graph Theory, 2007)

Spanning Trees with Few Leaves. - Masao Tsugaki; Tomoki Yamashita (Graphs Comb., 2007)

A degree sum condition for longest cycles in 3-connected graphs. - Tomoki Yamashita (J. Graph Theory, 2007)

A neighborhood and degree condition for pancyclicity and vertex pancyclicity. - Ryota Matsubara; Masao Tsugaki; Tomoki Yamashita (Australas. J Comb., 2008)

Degree conditions on claws and modified claws for hamiltonicity of graphs. - Jun Fujisawa; Tomoki Yamashita (Discret. Math., 2008)

A degree sum condition for long cycles passing through a linear forest. - Jun Fujisawa; Tomoki Yamashita (Discret. Math., 2008)

Long cycles in graphs without hamiltonian paths. - Ken-ichi Kawarabayashi; Kenta Ozeki; Tomoki Yamashita (Discret. Math., 2008)

Degree sum and connectivity conditions for dominating cycles. - Tomoki Yamashita (Discret. Math., 2008)

On degree sum conditions for long cycles and cycles through specified vertices. - Tomoki Yamashita (Discret. Math., 2008)

On a Spanning Tree with Specified Leaves. - Yoshimi Egawa; Haruhide Matsuda; Tomoki Yamashita; Kiyoshi Yoshimoto (Graphs Comb., 2008)

A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph. - Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2008)

Cycles passing through k + 1 vertices in k-connected graphs. - Jun Fujisawa; Tomoki Yamashita (J. Graph Theory, 2008)

Dominating cycles in graphs with high connectivity. - Masao Tsugaki; Tomoki Yamashita (Ars Comb., 2009)

Hamiltonian cycles and dominating cycles passing through a linear forest. - Kenta Ozeki; Tomoki Yamashita (Discret. Math., 2009)

A degree sum condition with connectivity for relative length of longest paths and cycles. - Tomoki Yamashita (Discret. Math., 2009)

On relative length of longest paths and cycles. - Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita (J. Graph Theory, 2009)

Greenhouse Partner Robot System. - Koshi Kashiwazaki; Yusuke Sugahara; Jun Iwasaki; Kazuhiro Kosuge; Shiro Kumazawa; Tomoki Yamashita (ISR/ROBOTIK, 2010)

A neighborhood and degree condition for panconnectivity. - Ryota Matsubara; Masao Tsugaki; Tomoki Yamashita (Australas. J Comb., 2010)

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

A Spanning Tree with High Degree Vertices. - Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2010)

Product quality prediction based on software process data with development-period estimation. - Shigeru Yamada; Tomoki Yamashita; Atsushi Fukuta (Int. J. Syst. Assur. Eng. Manag., 2010)

Dominating cycles in triangle-free graphs. - Kenta Ozeki; Tomoki Yamashita (Ars Comb., 2011)

Spanning Trees: A Survey. - Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2011)

Spanning Caterpillars Having at Most k Leaves. - Mikio Kano; Tomoki Yamashita; Zheng Yan 006 (TJJCCGG, 2012)

Spanning trees with a bounded number of leaves in a claw-free graph. - Mikio Kano; Aung Kyaw; Haruhide Matsuda; Kenta Ozeki; Akira Saito; Tomoki Yamashita (Ars Comb., 2012)

Long cycles in unbalanced bipartite graphs. - Shuya Chiba; Jun Fujisawa; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2012)

Length of Longest Cycles in a Graph Whose Relative Length is at Least Two. - Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2012)

Objective of RT-middleware contests. - Tomoki Yamashita; Tetsuo Kotoku; Shigeoki Hirai (ARSO, 2013)

Degree Sum Conditions for Cyclability in Bipartite Graphs. - Haruko Okamura; Tomoki Yamashita (Graphs Comb., 2013)

Degree sum conditions for the circumference of 4-connected graphs. - Shuya Chiba; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2014)

Closure and Spanning k-Trees. - Ryota Matsubara; Masao Tsugaki; Tomoki Yamashita (Graphs Comb., 2014)

Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph. - Haruhide Matsuda; Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2014)

Spanning $k$-trees of Bipartite Graphs. - Mikio Kano; Kenta Ozeki; Kazuhiro Suzuki; Masao Tsugaki; Tomoki Yamashita (Electron. J. Comb., 2015)

Perfect matchings avoiding prescribed edges in a star-free graph. - Yoshimi Egawa; Jun Fujisawa; Michael D. Plummer; Akira Saito; Tomoki Yamashita (Discret. Math., 2015)

Degree sum conditions for vertex-disjoint cycles passing through specified vertices. - Shuya Chiba; Tomoki Yamashita (Discret. Math., 2017)

A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs. - Shuya Chiba; Tomoki Yamashita (Discret. Math., 2017)

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 note on two geometric paths with few crossings for points labeled by integers in the plane. - Atsuhiro Nakamoto; Yoshiaki Oda; Mamoru Watanabe; Tomoki Yamashita (Discret. Math., 2018)

Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey. - Shuya Chiba; Tomoki Yamashita (Graphs Comb., 2018)

On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs. - Shuya Chiba; Tomoki Yamashita (SIAM J. Discret. Math., 2018)

A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity. - Shuya Chiba; Michitaka Furuya; Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita (Electron. J. Comb., 2019)

On a spanning tree with specified leaves in a bipartite graph. - Masao Tsugaki; Tomoki Yamashita (Australas. J Comb., 2020)

Spanning bipartite graphs with high degree sum in graphs. - Guantao Chen; Shuya Chiba; Ronald J. Gould; Xiaofeng Gu 002; Akira Saito; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2020)

Spanning Bipartite Graphs with Large Degree Sum in Graphs of Odd Order. - Shuya Chiba; Akira Saito; Masao Tsugaki; Tomoki Yamashita (Graphs Comb., 2021)

A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs. - Shuya Chiba; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2022)

Panconnectivity in Bipartite Graphs with Large Degree sum. - Masao Tsugaki; Tomoki Yamashita; Takamasa Yashima (Graphs Comb., 2023)

Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two. - Shuya Chiba; Katsuhiro Ota; Tomoki Yamashita (J. Graph Theory, 2023)

A degree condition for cycles passing through specified vertices and edges. - Shuya Chiba; Masao Tsugaki; Tomoki Yamashita (Discret. Math., 2023)

Live Demonstration : Development of invisible color information and QR code lighting display for novel digital signage. - Tomoki Yamashita; Shunsuke Inoue; Arata Ikeda; Takeshi Kumaki (GCCE, 2024)

Hamilton cycles passing through a matching in a bipartite graph with high degree sum. - Jun Fujisawa; Masao Tsugaki; Tomoki Yamashita; Takamasa Yashima (Discret. Math., 2024)