JAIST Repository >

上原 隆平(ウエハラ リュウヘイ)教授研究者総覧

No.書籍情報
1 幾何的な折りアルゴリズムの研究と開発 / 上原, 隆平, 科学研究費助成事業研究成果報告書, pp.1-5, 2017-05-30
2 Convex Configurations on Nana-kin-san Puzzle / Horiyama, Takashi, Uehara, Ryuhei, Hosoya, Haruo, LIPIcs (8th International Conference on Fun with Algorithms), 49(FUN 2016), pp.20:1-20:14, 2016-06, Schloss Dagstuhl
3 The Convex Configurations of “Sei Shonagon Chie no Ita,” Tangram, and Other Silhouette Puzzles with Seven Pieces / Fox-Epstein, Eli, Katsumata, Kazuho, Uehara, Ryuhei, IEICE transactions on fundamentals of electronics, communications and computer sciences, E99-A(6), pp.1084-1089, 2016-06, 電子情報通信学会
4 Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid / Araki, Yoshiaki, Horiyama, Takashi, Uehara, Ryuhei, Journal of Graph Algorithms and Applications, 20(1), pp.101-114, 2016-02, Journal of Graph Algorithms and Applications
5 A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares / Ito, Takehiro, Nakano, Shin-ichi, Okamoto, Yoshio, Otachi, Yota, Uehara, Ryuhei, Uno, Takeaki, Uno, Yushi, Computational Geometry: Theory and Applications, 51, pp.25-39, 2016-01, Elsevier
6 Unfolding and Dissection of Multiple Cubes / Abel, Zach, Ballinger, Bran, Demaine, Erik D, Demaine, Martin L, Erickson, Jeff, Hesterberg, Adam, Ito, Hiro, Kostitsyana, Irina, Lynch, Jayson, Uehara, Ryuhei, 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2016), 2016, 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2016)
7 Sliding token on bipartite permutation graphs / Fox-Epstein, Eli, Hoang, Duc A., Otachi, Yota, Uehara, Ryuhei, Lecture Notes in Computer Science, 9472, pp.237-247, 2015-12-09, Springer
8 Competitive Diffusion on Weighted Graphs / Ito, Takehiro, Otachi, Yota, Saitoh, Toshiki, Satoh, Hisayuki, Suzuki, Akira, Uchizawa, Kei, Uehara, Ryuhei, Yamanaka, Katsuhisa, Zhou, Xiao, Lecture Notes in Computer Science, 9214, pp.422-433, 2015-08-05, Springer
9 Swapping Colored Tokens on Graphs / Yamanaka, Katsuhisa, Horiyama, Takashi, Kirkpatrick, David, Otachi, Yota, Saitoh, Toshiki, Uehara, Ryuhei, Uno, Yushi, Lecture Notes in Computer Science, 9214, pp.619-628, 2015-08-05, Springer
10 Linear-Time Algorithm for Sliding Tokens on Trees / Demaine, Erik D., Demaine, Martin L., Fox-Epstein, Eli, Hoang, Duc A., Ito, Takehiro, Ono, Hirotaka, Otachi, Yota, Uehara, Ryuhei, Yamada, Takeshi, Theoretical Computer Science, 600, pp.132-142, 2015-07-28, Elsevier
11 Common Developments of Three Incongruent Boxes of Area 30 / Xu, Dawei, Horiyama, Takashi, Shirakawa, Toshihiro, Uehara, Ryuhei, Lecture Notes in Computer Science, 9076, pp.236-247, 2015-05-18, Springer
12 Secure sets and defensive alliances in graphs: A faster algorithm and improved bounds / Amano, Kazuyuki, Oo, Kyaw May, Otachi, Yota, Uehara, Ryuhei, IEICE Transactions on Information and Systems, E98-D(3), pp.486-489, 2015-03, 電子情報通信学会
13 Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid / Araki, Yoshiaki, Horiyama, Takashi, Uehara, Ryuhei, Lecture Notes in Computer Science, 8973, pp.294-305, 2015-02-26, Springer
14 Folding a Paper Strip to Minimize Thickness / Demaine, Erik D., Eppstein, David, Hesterberg, Adam, Ito, Hiro, Lubiw, Anna, Uehara, Ryuhei, Uno, Yushi, Lecture Notes in Computer Science, 8973, pp.113-124, 2015-02-26, Springer
15 A Survey and Recent Results About Common Developments of Two or More Boxes / Uehara, Ryuhei, Origami^6 : proceedings of the sixth international meeting on origami science, mathematics, and education, pp.77-84, 2015, American Mathematical Society
16 Polynomial-Time Algorithm for Sliding Tokens on Trees / Demaine, Erik D., Demaine, Martin, Fox-Epstein, Eli, Hoang, Duc A., Ito, Takehiro, Ono, Hirotaka, Otachi, Yota, Uehara, Ryuhei, Yamada, Takeshi, Lecture Notes in Computer Science, 8889, pp.389-400, 2014-12-15, Springer
17 Base-Object Location Problems for Base-Monotone Regions / Chun, Jinhee, Horiyama, Takashi, Ito, Takehiro, Kaothanthong, Natsuda, Ono, Hirotaka, Otachi, Yota, Tokuyama, Takeshi, Uehara, Ryuhei, Uno, Takeaki, Theoretical Computer Science, 555, pp.71-84, 2014-10-23, Elsevier
18 Flat Foldings of Plane Graphs with Prescribed Angles and Edge / Abel, Zachary, Demaine, Erik D., Demaine, Martin, Eppstein, David, Lubiw, Anna, Ryuhei Uehara, Lecture Notes in Computer Science, 8871, pp.272-283, 2014-09-24, Springer
19 A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks / Ito, Takehiro, Nakano, Shin-ichi, Okamoto, Yoshio, Otachi, Yota, Uehara, Ryuhei, Uno, Takeaki, Uno, Yushi, Theoretical Computer Science, 544, pp.14-31, 2014-08-07, Elsevier
20 Bumpy Pyramid Folding / Abel, Zachary R., Demaine, Erik D., Demaine, Martin L., Ito, Hiro, Snoeyink, Jack, Uehara, Ryuhei, The 26th Canadian Conference on Computational Geometry (CCCG 2014), pp.258-266, 2014-08, CCCG 2014
21 The Convex Configurations of “Sei Shonagon Chie no Ita” and Other Dissection Puzzles / Fox-Epstein, Eli, Uehara, Ryuhei, The 26th Canadian Conference on Computational Geometry (CCCG 2014), pp.386-389, 2014-08, CCCG 2014
22 Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set / Horiyama, Takashi, Kiyomi, Masashi, Okamoto, Yoshio, Uehara, Ryuhei, Uno, Takeaki, Uno, Yushi, Yamauchi, Yukiko, Lecture Notes in Computer Science, 8496, pp.230-239, 2014-07-01, Springer
23 Computational complexity and an integer programming model of Shakashaka / Demaine, Erik D., Okamoto, Yoshio, Uehara, Ryuhei, Uno, Yushi, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E97-A(6), pp.1213-1219, 2014-06-01, 電子情報通信学会
24 Computational Complexity of Piano-Hinged Dissections / Abel, Zachary, Demaine, Erik D., Demaine, Martin L., Horimaya, Takashi, Uehara, Ryuhei, IEICE transactions on fundamentals of electronics, communications and computer sciences, E97-A(6), pp.1206-1212, 2014-06, 電子情報通信学会
25 幾何的特徴をもつグラフ構造に対する効率のよいアルゴリズムの研究と開発 / 上原, 隆平, 科学研究費助成事業研究成果報告書, pp.1-5, 2014-05-29
26 Intersection Dimension of Bipartite Graphs / Chaplick, Steven, Hell, Pavol, Otachi, Yota, Saitoh, Toshiki, Uehara, Ryuhei, Lecture Notes in Computer Science, 8402, pp.323-340, 2014-04-11, Springer
27 On the Parameterized Complexity for Token Jumping on Graphs / Ito, Takehiro, Kaminski, Marcin, Ono, Hirotaka, Suzuki, Akira, Uehara, Ryuuhei, Yamanaka, Katsuhisa, Lecture Notes in Computer Science, 8402, pp.341-351, 2014-04-11, Springer
28 The graph isomorphism problem on geometric graphs / Uehara, Ryuhei, Discrete Mathematics and Theoretical Computer Science, 16(2), pp.87-96, 2014, Discrete Mathematics and Theoretical Computer Science
29 Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane / Aichholzer, Oswin, Cardinal, Jean, Hackl, Thomas, Hurtado, Ferran, Korman, Matias, Pilz, Alexander, Silveira, Rodrigo, Uehara, Ryuhei, Valtr, Pavl, Birgit Vogtenhuber, Emo Welzl, Discrete Mathematics and Theoretical Computer Science, 16(3), pp.317-332, 2014, Discrete Mathematics and Theoretical Computer Science
30 UNO is hard, even for a single player / Demaine, Erik D., Demaine, Martin L., Harvey, Nicholas J. A., Uehara, Ryuhei, Uno, Takeaki, Uno, Yushi, Theoretical Computer Science, 521, pp.51-61, 2013-11-22, Elsevier
31 Computational complexity and an integer programming model of Shakashaka / Demaine, Erik D., Okamoto, Yoshio, Uehara, Ryuhei, Uno, Yushi, Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), pp.31-36, 2013-08, CCCG
32 Zipper Unfoldability of Domes and Prismoids / Demaine, Erik D., Demaine, Martin L., Uehara, Ryuhei, Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), pp.43-48, 2013-08, CCCG
33 Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane / Aichholzer, Oswin, Cardinal, Jean, Hackl, Thomas, Hurtado, Ferran, Korman, Matias, Pilz, Alexander, Silveira, Rodrigo I., Uehara, Ryuhei, Vogtenhuber, Birgit, Welzl, Emo, Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), pp.169-174, 2013-08, CCCG
34 Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression / Uno, Takeaki, Uehara, Ryuhei, Nakano, Shin-ichi, Discrete Mathematics, Algorithms and Applications, 5(2), pp.1360001-1-1360001-14, 2013-06-21, World Scientific Publishing
35 Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs / Kiyomi, Masashi, Saitoh, Toshiki, Uehara, Ryuhei, IEICE TRANSACTIONS on Information and Systems, E96-D(3), pp.426-432, 2013-03-01, 電子情報通信学会
36 Computational Complexity of Piano-Hinged Dissections / Abel, Zachary, Demaine, Erik D., Demaine, Martin L., Horiyama, Takashi, Uehara, Ryuhei, The 29th European Workshop on Computational Geometry (EuroCG 2013), pp.147-150, 2013-03
37 Base location problems for base-monotone regions / Chun, Jinhee, Horiyama, Takashi, Ito, Takehiro, Kaothanthong, Natsuda, Ono, Hirotaka, Otachi, Yota, Tokuyama, Takeshi, Uehara, Ryuhei, Uno, Takeaki, Lecture Notes in Computer Science, 7748, pp.53-64, 2013-02-14, Springer
38 Coverage with k-Transmitters in the Presence of Obstacles / Ballinger, Brad, Benbernou, Nadia, Bose, Prosenjit, Damian, Mirela, Demaine, Erik D., Dujmović, Vida, Flatland, Robin, Hurtado, Ferran, Iacono, John, Lubiw, Anna, Morin, Pat, Sacristán, Vera, Souvaine, Diane, Uehara, Ryuuhei, Journal of Combinatorial Optimization, 25(2), pp.208-233, 2013-02, Springer
39 Route-Enabling Graph Orientation Problems / Ito, Takehiro, Miyamoto, Yuichiro, Ono, Hirotaka, Tamaki, Hisao, Uehara, Ryuhei, Algorithmica, 65(2), pp.317-338, 2013-02, Springer
40 Tractabilities and Intractabilities on Geometric Intersection Graphs / Uehara, Ryuhei, Algorithms, 6(1), pp.60-83, 2013-01-25, MDPI Publishing
41 Variations on Instant Insanity / Demaine, Erik D., Demaine, Martin L., Eisenstat, Sarah, Morgan, Thomas D., Uehara, Ryuhei, Lecture Notes in Computer Science, 8066, pp.33-47, 2013, Springer
42 Common Developments of Three Incongruent Orthogonal Boxes / Shirakawa, Toshihiro, Uehara, Ryuhei, International Journal of Computational Geometry and Applications, 23(1), pp.65-71, 2013, World Scientific Publishing
43 Bipartite Permutation Graphs are Reconstructible / Kiyomi, Masashi, Saitoh, Toshiki, Uehara, Ryuhei, Discrete Mathematics, Algorithms and Applications, 4(3), pp.1250039-, 2012-08-01, World Scientific Publishing
44 NP-completeness of generalized Kaboozle / Asano, Tetsuo, Demaine, Erik D., Demaine, Martin L., Uehara, Ryuhei, Journal of Information Processing, 20(3), pp.713-718, 2012-07-15, 情報処理学会
45 Any Monotone Function is Realized by Interlocked Polygons / Demaine, Erik D., Demaine, Martin L., Uehara, Ryuhei, Algorithms, 5(1), pp.148-157, 2012-03-19, MDPI Publishing
46 Ghost Chimneys / Charlton, David, Demaine, Erik D., Demaine, Martin L., Dujmovic, Vida, Morin, Pat, Uehara, Ryuhei, International Journal of Computational Geometry and Applications, 22(3), pp.207-214, 2012, World Scientific Publishing
47 On bipartite powers of bigraphs / Okamoto, Yoshio, Otachi, Yota, Uehara, Ryuhei, Discrete Mathematics and Theoretical Computer Science, 14(2), pp.11-20, 2012, Discrete Mathematics and Theoretical Computer Science
48 Random Generation and Enumeration of Bipartite Permutation Graphs / Saitoh, Toshiki, Otachi, Yota, Yamanaka, Katsuhisa, Uehara, Ryuhei, Journal of Discrete Algorithms, 10, pp.84-97, 2011-11-18, Elsevier
49 Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem / Okamoto, Yoshio, Otachi, Yota, Uehara, Ryuhei, Uno, Takeaki, Journal of Graph Algorithms and Applications, 15(6), pp.727-751, 2011-10, Journal of Graph Algorithms and Applications
50 The Voronoi game on graphs and its complexity / Teramoto, Sachio, Demaine, Erik D., Uehara, Ryuhei, Journal of Graph Algorithms and Applications, 15(4), pp.485-501, 2011-08, Journal of Graph Algorithms and Applications

1 2 次へ

 


お問い合わせ先 : 北陸先端科学技術大学院大学 研究推進課図書館情報係