Tomoki Yamashita
According to our database1,
Tomoki Yamashita
authored at least 56 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Hamilton cycles passing through a matching in a bipartite graph with high degree sum.
Discret. Math., January, 2024
Live Demonstration : Development of invisible color information and QR code lighting display for novel digital signage.
Proceedings of the 13th IEEE Global Conference on Consumer Electronics, 2024
2023
Discret. Math., December, 2023
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two.
J. Graph Theory, June, 2023
2022
A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs.
Discret. Math., 2022
2021
Graphs Comb., 2021
2020
Australas. J Comb., 2020
2019
A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity.
Electron. J. Comb., 2019
2018
On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs.
SIAM J. Discret. Math., 2018
Graphs Comb., 2018
A note on two geometric paths with few crossings for points labeled by integers in the plane.
Discret. Math., 2018
2017
Degree sum conditions for path-factors with specified end vertices in bipartite graphs.
Discret. Math., 2017
A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs.
Discret. Math., 2017
Discret. Math., 2017
2015
Discret. Math., 2015
2014
Graphs Comb., 2014
Discret. Math., 2014
2013
Proceedings of the 2013 IEEE Workshop on Advanced Robotics and its Social Impacts, 2013
2012
Graphs Comb., 2012
Spanning trees with a bounded number of leaves in a claw-free graph.
Ars Comb., 2012
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012
2011
Dominating cycles in triangle-free graphs.
Ars Comb., 2011
2010
Product quality prediction based on software process data with development-period estimation.
Int. J. Syst. Assur. Eng. Manag., 2010
Proceedings of the ISR/ROBOTIK 2010, Proceedings for the joint conference of ISR 2010 (41st Internationel Symposium on Robotics) und ROBOTIK 2010 (6th German Conference on Robotics), 7-9 June 2010, Munich, Germany, 2010
2009
A degree sum condition with connectivity for relative length of longest paths and cycles.
Discret. Math., 2009
Discret. Math., 2009
Dominating cycles in graphs with high connectivity.
Ars Comb., 2009
2008
J. Graph Theory, 2008
A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph.
Graphs Comb., 2008
Discret. Math., 2008
Discret. Math., 2008
Discret. Math., 2008
Australas. J Comb., 2008
2007
J. Graph Theory, 2007
Discuss. Math. Graph Theory, 2007
2006
Australas. J Comb., 2006
2004
2003
A Note on Dominating Cycles in Tough Graphs.
Ars Comb., 2003
1998
Performance robot serving as communication media: development of an 'eyeball robot' investigating bodily communication.
Adv. Robotics, 1998
Emergence and share of information through communication-performance of plants in group formation.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998