TOP  >  Personal Info.  >  Misc
UEHARA, Ryuhei Vice-President, Executive Dean of Graduate School of Advanced Science and Technology, Professor
Information Science, Computing Science

Misc

48 items
レプ・タイルの定式化を用いた各種ソルバの性能比較
番原 睦則, 橋本 健二, 堀山 貴史, 湊 真一, 中村 駆, 西野 正彬, 酒井 正彦, 上原 隆平, 宇野 裕之, 安田 宜仁
人工知能学会研究会資料 人工知能基本問題研究会, 119, 02-07, 2022
Research on Map Folding with Boundary Order on Simple Fold
JIA Yiyang, MITANI Jun, UEHARA Ryuhei
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Web), E104.A, 9, -, 2021
外周部の順序が与えられた地図折り問題の解法
JIA Yiyang, 三谷純, 上原隆平
日本応用数理学会年会講演予稿集(CD-ROM), 2020, -, 2020
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares
Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
情報処理学会論文誌, 58, 8, -, 2017
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set
Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
情報処理学会論文誌, 58, 8, -, 2017
Practical Linear-Time Algorithm for Estimation of Silhouette after Folding Crease Pattern (コンピュテーション)
大内 康治, 山崎 一明, 上原 隆平
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 117, 28, 77-82, 2017
A Research of the Number of the Convex Configurations of Silhouette Puzzles
岩井 仁志, 渋谷 純吾, 上原 隆平
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 116, 262, 39-45, 2016
Counting the number of solutions for peg solitaire (コンピュテーション)
兼本 樹, 斎藤 寿樹, 清見 礼, 上原 隆平
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 116, 211, 1-5, 2016
Shortest Reconfiguration of Sliding Tokens on a Caterpillar (回路とシステム)
YAMADA TAKESHI, UEHARA RYUHEI
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 115, 315, 1-8, 2015
The Convex Configurations of Dissection Puzzles with Seven Pieces
Kazuho Katsumata, Ryuhei Uehara
IPSJ SIG Notes, 2015, 9, 1-4, 2015
On Polygons that fold into plural polyhedra
上原 隆平
回路とシステムワークショップ論文集 Workshop on Circuits and Systems, 27, 464-468, 2014
FPT algorithms for Token Jumping on Graphs
ITO TAKEHIRO, KAMINSKI MARCIN, ONO HIROTAKA, SUZUKI AKIRA, UEHARA RYUHEI, YAMANAKA KATSUHISA
IEICE technical report. Theoretical foundations of Computing, 114, 80, 9-12, 2014
Intersection dimension of bipartite graphs
CHAPLICK STEVEN, HELL PAVOL, OTACHI YOTA, SAITOH TOSHIKI, UEHARA RYUHEI
IEICE technical report. Theoretical foundations of Computing, 114, 80, 19-25, 2014
Intersection dimension of bipartite graphs
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
IPSJ SIG Notes, 2014, 4, 1-7, 2014
FPT algorithms for Token Jumping on Graphs
Takehiro Ito, Marcin Kami?ski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
IPSJ SIG Notes, 2014, 2, 1-4, 2014
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
IPSJ SIG Notes, 2014, 12, 1-6, 2014
Bumpy Pyramid Folding Problem
ABEL ZACHARY R., DEMAINE ERIK D., DEMAINE MARTIN L., ITO HIRO, SNOEYINK JACK, UEHARA RYUHEI
Mathematical Systems Science and its Applications : IEICE technical report, 113, 279, 113-119, 2013
Bumpy Pyramid Folding Problem
Zachary R.Abel, Erik D.Demaine, Martin L.Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
IPSJ SIG Notes, 2013, 19, 1-7, 2013
Computational Complexity of Piano-Hinged Dissections
Zachary Abel, Erik D.Demaine, Martin L.Demaine, Takashi Horiyama, Ryuhei Uehara
IPSJ SIG Notes, 2013, 6, 1-6, 2013
数学と計算機科学(コンピュータ・サイエンス)の狭間にて (特集 数学について語ろう : 私が見てきた数学)
上原 隆平
数学セミナー, 52, 5, 12-15, 2013
Computational complexity and an integer programming model of Shakashaka
DEMAINE Erik D., OKAMOTO Yoshio, UEHARA Ryuhei, UNO Yushi
IEICE technical report. Theoretical foundations of Computing, 113, 14, 43-48, 2013
NP-completeness of generalized Kaboozle
Tetsuo Asano, ErikD.Demaine, MartinL.Demaine, Ryuhei Uehara
情報処理学会論文誌, 53, 6, 6p-, 2012
On Complexity of Flood Filling Games on Interval Graph Classes
Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno
研究報告アルゴリズム（AL）, 2012, 7, 1-7, 2012
On bipartite powers of bigraphs
Okamoto Yoshio, Otachi Yota, Uehara Ryuhei
Discrete Mathematics and Theoretical Computer Science, 14, 2, 11-20, 2012
On the number of reduced trees, cographs, and series-parallel graphs by compression
Takeaki Uno, Ryuhei Uehara, Shin-ichiNakano
研究報告アルゴリズム（AL）, 2011, 6, 1-8, 2011
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
OKAMOTO YOSHIO, OTACHI YOTA, UEHARA RYUHEI, UNO TAKEAKI
IEICE technical report, 111, 195, 31-38, 2011
The Complexity of Free Flood Filling Games
Hiroyuki Fukui, Akihiro Nakanishi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
研究報告アルゴリズム（AL）, 2011, 7, 1-5, 2011
Bipartite powers of interval bigraphs
OKAMOTO Yoshio, OTACHI Yota, UEHARA Ryuhei
IEICE technical report, 110, 232, 35-39, 2010
Voronoi Game on a Path (アルゴリズム(AL) Vol.2010-AL-130)
清見 礼, 斎藤 寿樹, 上原 隆平
情報処理学会研究報告, 2010, 1, 5p-, 2010
Stretch minimization problem of a strip paper (コンピュテーション)
上原 隆平
電子情報通信学会技術研究報告, 110, 37, 7-13, 2010
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
KIYOMI MASASHI, SAITOH TOSHIKI, UEHARA RYUHEI
研究報告アルゴリズム（AL）, 2009, 5, 1-8, 2009
Random Generation and Enumeration of Bipartite Permutation Graphs
SAITOH Toshiki, OTACHI Yota, YAMANAKA Katsuhisa, UEHARA Ryuhei
IEICE technical report, 109, 195, 35-42, 2009
Graph Orientation Problems for Multiple st-Reachability
ITO TAKEHIRO, MIYAMOTO YUICHIRO, ONO HIROTAKA, TAMAKI HISAO, UEHARA RYUHEI
研究報告アルゴリズム（AL）, 2009, 5, 1-6, 2009
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
OKAMOTO Yoshio, UEHARA Ryuhei, UNO Takeaki
IEICE technical report, 109, 108, 45-52, 2009
How to make a picturesque maze (Theoretical Computer Science and Its Applications)
Okamoto Yoshio, Uehara Ryuhei
RIMS Kokyuroku, 1649, 58-65, 2009
Simulation of a certain Voting Game
UEHARA Ryuhei, KAWAMURA Yasuyuki, MATSUNAGA Hiromitsu, MOTOKI Mitsuo
電子情報通信学会技術研究報告. COMP, コンピュテーション, 108, 89, 37-41, 2008
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
BRANDSTADT A., DRAGAN F. F., LE H. -O., LE V. B., UEHARA R.
IPSJ SIG Notes, 2003, 53, 57-64, 2003
Expected Length of Longest Common Subsequences of Two Biased Random Strings and Its Application (Algorithm Engineering as a New Paradigm)
Aoki Hironobu, Uehara Ryuhei, Yamazaki Koichi
RIMS Kokyuroku, 1185, 1-10, 2001
3充足可能性判定問題3SATの単一解を持つ正例題生成手法
MOTOKI Mitsuo, UEHARA Ryuhei
IEICE technical report. Theoretical foundations of Computing, 98, 432, 25-32, 1999
Tractable and Intractable Problems on Generalized Chordal Graphs (Models of Computation and Algorithms)
Uehara Ryuhei
RIMS Kokyuroku, 1093, 27-32, 1999
On a Unique Solution Instance Generation for the 3-Satisfiability (3SAT) Problem
MOTOKI Mitsuo, UEHARA Ryuhei
IEICE technical report. Theoretical foundations of Computing, 97, 628, 85-92, 1998
Parallel Complexity of the Lexicographically First Maximal Subgraph Problems on Restricted Graphs
UEHARA Ryuhei
IEICE technical report. Theoretical foundations of Computing, 97, 375, 65-72, 1997
A Measure of Parallelization for the Lexicographically First Maximal Independent Set Problem
UEHARA Ryuhei
IPSJ SIG Notes, 1997, 26, 19-26, 1997
Partial Gates and Their Identifications
UEHARA Ryuhei, TSUCHIDA Kensei
IEICE technical report. Theoretical foundations of Computing, 96, 196, 1-10, 1996
Fast $RNC$ and $NC$ Algorithms for Maximal Path Sets and Applications to Superstrings with Flipping
Uehara Ryuhei, Chen Zhi-Zhong, He Xin
RIMS Kokyuroku, 950, 113-119, 1996
Complexity Classes Characterized by Semi-Random Sources
Uehara Ryuhei
RIMS Kokyuroku, 943, 1-14, 1996
Complexity Classes Characterized by Many Computation Paths
UEHARA Ryuhei
IEICE technical report. Theoretical foundations of Computing, 95, 259, 9-15, 1995
一人ゲームHi-Qについて(計算アルゴリズムと計算量の基礎理論)
上原 隆平, 岩田 茂樹
数理解析研究所講究録, 695, 205-214, 1989