ホーム メンバー紹介 研究内容 リンク サイトマップ
  上野研究室の論文  
  2019  
  2018  
  2017  
  2016  
  2015  
  2014  
  2013  
  2012  
  2011  
  2010  
  2009  
  2008  
  2007  
  2006  
  2005  
  2004  
  2003  
  2002  
  2001  
  2000  
  1999  
  1998  
  1997  
  1996  
  1995  
  1979 - 1994  

上野 & 高橋研究室に戻る

2017

Satoshi Tayu and Shuichi Ueno: On the Recognition of Unit Grid Intersection Graphs; IEICE Technical Report, Vol.117, No.300, pp.15-20, 2017.

Hiroki Katsumata, Satoshi Tayu, and Shuichi Ueno: On the Complexity of Finding a Largest Common Subtree of Trees; Proc. of the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, pp.125-126, 2017.

S. Tayu and S. Ueno: Stable Matchings in Trees, Lecture Notes in Computer Science, Vol. 10392, pp.492-503, 2017.

Hiroki Katsumata, Satoshi Tayu, and Shuichi Ueno: A Note on the Largest Common Subgraph Problem; Proceedings of the 2017 IEICE General Conference, A-1-6, 2017.

Kotaro Mure, Satoshi Tayu, and Shuichi Ueno: A Note on the Subgraph Isomorphism Problem; Proceedings of the 2017 IEICE General Conference, A-1-7, 2017.

English