Welcome to Uehara Laboratory

[English/Japanese]

Here is the web page of Uehara Laboratory which is managed by Professor Ryuhei Uehara, School of Information Science, Japan Advanced Institute of Science and Technology.

• Current Members
  OBs, OGs and their themes

  Ph.D Thesis

  • 2009
    • Toshiki Saito: Efficient Algorithms for Geometric Graph Classes

  Master Thesis

  • 2010
    • Yosuke Okayama: Exclusive covering of point set by unit diskspuzzle
    • Arata Goto: Enumeration and generalization of the Hoffman puzzle
  • 2009
    • Akihiro Nakanishi: Efficient Algorithm on Bandwidth Problem
    • Yasuyuki Kuribayashi: Efficient Recognition Algorithm on Interval Bigraphs
  • 2008
    • Shinichi Morimoto: Scale free graphs based on time sequential data (in Japanese)
  • 2007
    • Yusuke Sugawara: Polynomial Time Graph Reconstruction Problem (in Japanese)
    • Yoichi Fujimoto: Reverse Problem of Linkages on a Plane with extension (in Japanese)
  • 2006
    • Ryo Hirayama: Topological Random Walk on a Scale Free Graph (in Japanese)
    • Toshiki Saito: Efficient Algorithm that Constructs the MPQ-tree Representation from an Interval Representation of an Interval Graph (in Japanese)
    • Yoshihiro Takahara: Longest Path Problems on a Ptolemaic Graph (in Japanese)

• Introduction: Efficient Algorithms --- Challenge to intractable problems(Japanese)
• Rough schedule and Seminars(Japanese)
• Web page of the laboratory available only in JAIST(Japanese)

Last modified: Sun Feb 6 14:32:29 JST 2005 by R.Uehara (uehara@jaist.ac.jp)