Yushi UNO, Ph. D

Department of Core Informatics, Graduate School of Informatics, Osaka Metropolitan University.

1-1 Gakuen-cho, Naka-ku, Sakai 599-8531, JAPAN.

Email: yushi.uno AT omu DOT ac DOT jp

Office: Nakamozu Campus Build. B8, 2F #210

Last Update: April 8, 2022
Japanese Page

---

• Teaching
  • Data Structures and Algorithms
  • Design and Analysis of Algorithms
  • Discrete Mathematics
  • Combinatorial Optimization
• Research
  • Outline and Topics of Interests: graph and network algorithms, algorithmic graph theory, combinatorial optimization, discrete mathematics, algorithmic combinatorial game theory [UNO, Tantrix, etc.], graph structures of the Web, database theory and query processing, data mining, knowledge engineering, and so on.
  • Recent Publications [...more]
    • Fumika Kino and Yushi Uno. Solving Tantrix via integer programming. Lecture Notes in Computer Science, Vol. 7288, pp. 271--282, E. Kranakis, D. Krizanc and F. Luccio (Eds.), Springer, 2012.
      
    • Fumika Kino and Yushi Uno. An integer programming approach to solving Tantrix on fixed boards. Algorithms, Vol. 5 (1), pp. 158--175, 2012.
      
    • Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno. The (p,q)-total labeling problem for trees. Discrete Mathematics, Vol. 312, pp. 1407--1420, 2012.
      
    • Yushi Uno and Fumiya Oguri. Contracted webgraphs: structure mining and scale-freeness. Lecture Notes in Computer Science, Vol. 6681, pp. 287--299, M. Atallah, X.-Y. Li and B. Zhu (Eds.), Springer, 2011.
      
    • Takeya Shigezumi, Yushi Uno and Osamu Watanabe. A new model for a scale-free hierarchical structure of isolated cliques. Journal of Graph Algorithms and Applications, Vol. 15 (5), pp. 661--682, 2011.
      
    • Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno and Yushi Uno. UNO is hard, even for a single player. Lecture Notes in Computer Science, Vol. 6099, pp. 133--144, P. Boldi and L. Gargano (Eds.), Springer, 2010.
      
    • Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno. A linear time algorithm for L(2,1)-labeling of trees. Lecture Notes in Computer Science, Vol. 5757, pp. 35--46, A. Fiat and P. Sanders (Eds.), Springer, 2009.
      
    • Hiro Ito, Mikio Kano, Naoki Katoh and Yushi Uno (eds.). Combinatorial Geometry and Graph Theory (Lecture Notes in Computer Science, Vol. 4535 [ISBN: 978-3-540-89549-7]. Springer, 2008.
      
  • Coauthors (according to DBLP): Erik D. Demaine, Martin L. Demaine, Jianming Deng, Nicholas J. A. Harvey, Toru Hasunuma, Toshihide Ibaraki, Toshimasa Ishii, Hiro Ito, Takehiro Ito, Mikio Kano, Naoki Katoh, Shuji Kijima, Fumika Kino, Kazuhisa Makino, Tetsuhisa Oda, Fumiya Oguri, Yoshio Okamoto, Hirotaka Ono, Yoshinobu Ota, Yota Otachi, Chirstos H. Papadimitriou, Toshiki Saitoh, Takeya Shigezumi, Martha Sideri, Ryuhei Uehara, Akio Uemichi, Motohide Umano, Takeaki Uno, Osamu Watanabe, Katsuhisa Yamanaka, Koichi Yamazaki.
  • Grants
  • Members (of Academic Societies): Association for Computing Machinery (ACM) and its Special Interest Group on Algorithms and Computation Theory (SIGACT), European Association for Theoretical Computer Science (EATCS), The Institute of Electronics, Information and Communication Engineers (IEICE), Informaion Processing Society of Japan (IPSJ), The Operations Research Society of Japan (ORSJ).
  • Selected Topics
    • Graph Classes
    • Mathematical Puzzles
• Other Information
  • Let's Play UNO
  • Tantrix.com

---

Home [Profile] [Research] [Classes] [Computer] [Hobbies] [Links] [Update] [Site Map]
[Osaka Pref. Univ.] [Graduate School of Science] [Dept. Math & Infomation Sci.]