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.

• OBs, OGs and their themes

  Ph.D Thesis

  • 2023
    • Tonan Kamata: Research on Folding and Unfolding between Polygons and Polyhedra
  • 2021
    • Feng Tianfeng: Computational Complexity of Graph Embedding Problems Inspired by Protein Folding and Design
  • 2019
    • Koji Ouchi: Research on Flat-Foldable Single-Vertex Crease Patterns
  • 2018
    • Duc Anh Hoang: Independent Set Reconfiguration and Related Problems for Some Restricted Graphs
  • 2017
    • Dawei Xu: Research on Developments of Polycubes
  • 2016
    • Matsuo Konagaya: Memory Constrained Algorithms for Geometric Problems
  • 2009
    • Toshiki Saito: Efficient Algorithms for Geometric Graph Classes

  Master Thesis

  • 2023
    • Junnosuke Hoshido: Computational Complexity of Crease Restore Problem
    • Yuki Iburi: Research on Computational Complexity of Generalized Matching Match Problem
  • 2021
    • Masaaki Kanzaki: Research on Computational Complexity of Jumping Block Puzzles
    • Ko Minamisawa: Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles
    • Win Hlaing Hlaing Myint: Reconfiguration Problems of Shifting Tokens on Graphs
    • Mengze QIAN: Efficient Enumeration of Non-isomorphic Ptolemaic Graphs
  • 2020
    • Tonan Kamata: Research on the folding problem of regular polyhedra and their extensions
    • Tamami Okada: Rep-cube: dissections of a net of a cube into nets of cubes
    • Ryutaro Sato: Research on the variants of 15-puzzle and their maximum shortest moves
    • Jiawei Yao: Research on the minimum Moves of Rolling Cube Puzzles
    • Akira Kadoguchi: Folding Problem on Convex Deltahedron
    • SAI Kwon Kham: Research on Computational Complexity of Colored Token Shift Problem
  • 2019
    • Koji Ueno: Research on Efficient Simulatoin Algorithms of Unbiased Coin by Biased Coin
    • Takashi Himoto: Research on Similar Hole Puzzle: Hardness and Efficient Algorithms
    • Hu Guoxin: Making Many Polygons by Simple Fold and One Straight Cut
    • Tran Hoang Dat: Efficient enumeration algorithm of Ptolemaic graphs
  • 2018
    • Sumiko Harasawa: Efficient Enumeration of Connected Proper Interval Graphs
    • Shinichi Ikeda: Research on Efficient Enumeration of Graph Class That Has Geometric Representation
    • Feng Tianfeng: Research on Simulation of Mechanism by Linkage
  • 2017
    • Takumu Shirayama: Research on Computational Complexity of Pipe Puzzle
  • 2016
    • Hitoshi Iwai: A Study on the Number of the Convex Configurations of Silhouette Puzzles
    • Toshifumi Okumura: Research on Solving Puzzles by Supercomputer
    • Atsushi Fujii: Enumeration of Series-Parallel Graphs
  • 2015
    • Takeshi Yamada: Research on Reconfiguration Problem of Independent Sets on a Caterpillar
  • 2014
    • Dawei Xu: Research on the Common Developments of Plural Cubioids
    • Duc Anh Hoang: The independent set reconfiguration problem on some restricted graphs
    • Yuma Hayakawa: Algorithms for Shortest Path on a Plane Including Obstacles with Cost
  • 2011
    • Hiroyuki Fukui: Research on the computational complexity of the Flood Filling Game
    • Hiroaki Matsui: Polygons that can fold into two or more convex polyhedra
  • 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
    • 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)
    • Ryo Hirayama: Topological Random Walk on a Scale Free 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)