JAIST Repository >

UEHARA Ryuuhei ProfessorFaculty Profile

No.Bibliographical information
51 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
52 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
53 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
54 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
55 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
56 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
57 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
58 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, 電子情報通信学会
59 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
60 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
61 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
62 Route-Enabling Graph Orientation Problems / Ito, Takehiro, Miyamoto, Yuichiro, Ono, Hirotaka, Tamaki, Hisao, Uehara, Ryuhei, Algorithmica, 65(2), pp.317-338, 2013-02, Springer
63 Tractabilities and Intractabilities on Geometric Intersection Graphs / Uehara, Ryuhei, Algorithms, 6(1), pp.60-83, 2013-01-25, MDPI Publishing
64 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
65 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
66 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
67 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, 情報処理学会
68 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
69 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
70 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
71 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
72 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
73 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
74 Voronoi Game on a Path / Kiyomi, Masashi, Saitoh, Toshiki, Uehara, Ryuhei, IEICE TRANSACTIONS on Information and Systems, E94-D(6), pp.1185-1189, 2011-06-01, 電子情報通信学会
75 Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem / Okamoto, Yoshio, Otachi, Yota, Uehara, Ryuhei, Uno, Takeaki, Lecture Notes in Computer Science, 6648/2011, pp.452-462, 2011-04-27, Springer
76 Construct of Common Development of Regular Tetrahedron and Cube / Shirakawa, Toshihiro, Horiyama, Takashi, Uehara, Ryuhei, 27th European Workshop on Computational Geometry (EuroCG 2011), pp.47-50, 2011, EuroCG 2011
77 Common Developments of Several Different Orthogonal Boxes / Abel, Zachary, Demaine, Erik, Demaine, Martin, Matsui, Hiroaki, Rote, Günter, Uehara, Ryuhei, The 23rd Canadian Conference on Computational Geometry (CCCG' 11), pp.77-82, 2011
78 On covering of any point configuration by disjoint unit disks / Okayama, Yosuke, Kiyomi, Masashi, Uehara, Ryuhei, The 23rd Canadian Conference on Computational Geometry (CCCG' 11), pp.393-397, 2011
79 On the complexity of reconfiguration problems / Ito, Takehiro, Demaine, Erik D., Harvey, Nicholas J.A., Papadimitriou, Christos H., Sideri, Martha, Uehara, Ryuhei, Uno, Yushi, Theoretical Computer Science, 412(12-14), pp.1054-1065, 2010-12-14, Elsevier
80 Kaboozle Is NP-complete, Even in a Strip / Asano, Tetsuo, Demaine, Erik, Demaine, Martin, Uehara, Ryuhei, Lecture Notes in Computer Science, 6099/2010, pp.28-36, 2010-05-29, Springer
81 Scale free properties of random k-trees / Cooper, Colin, Uehara, Ryuhei, Mathematics in Computer Science, 3(4), pp.489-496, 2010-04-16, Springer
82 Efficient Enumeration of All Ladder Lotteries and Its Application / Yamanaka, Katsuhisa, Nakano, Shin-ichi, Matsui, Yasuko, Uehara, Ryuhei, Nakada, Kento, Theoretical Computer Science, 411(16-18), pp.1714-1722, 2010-01-13, Elsevier
83 Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks / Asano, Tetsuo, Jansson, Jesper, Sadakane, Kunihiko, Uehara, Ryuhei, Valiente, Gabriel, Lecture Notes in Computer Science, 6129/2010, pp.190-201, 2010, Springer
84 UNO Is Hard, Even for a Single Player / Demaine, Erik D., Demaine, Martin L., Uehara, Ryuhei, Uno, Takeaki, Uno, Yushi, Lecture Notes in Computer Science, 6099/2010, pp.133-144, 2010, Springer
85 Scale Free Interval Graphs / Miyoshi, Naoto, Shigezumi, Takeya, Uehara, Ryuhei, Watanabe, Osamu, Theoretical Computer Science, 410(45), pp.4533-4600, 2009-08-22, Elsevier
86 A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs / Nakano, Shin-ichi, Uehara, Ryuhei, Uno, Takeaki, Journal of Computer Science and Technology, 24(3), pp.517-533, 2009, Springer
87 Laminar Structure of Ptolemaic Graphs with Applications / Uehara, Ryuhei, Uno, Yushi, Discrete Applied Mathematics, 157(7), pp.1533-1543, 2008-10-23, Elsevier
88 Counting the number of independent sets in chordal graphs / Okamoto, Yoshio, Uno, Takeaki, Uehara, Ryuhei, Journal of Discrete Algorithms, 6(2), pp.229-242, 2008-06, Elsevier
89 Longest Path Problems on Ptolemaic Graphs / TAKAHARA, Yoshihiro, TERAMOTO, Sachio, UEHARA, Ryuhei, IEICE TRANSACTIONS on Information and Systems, E91-D(2), pp.170-177, 2008-02-01, 電子情報通信学会
90 On Computing Longest Paths in Small Graph Classes / Uehara, Ryuhei, Uno, Yushi, International Journal of Foundations of Computer Science, 18(5), pp.911-930, 2007-10, World Scientific Publishing
91 Linear structure of bipartite permutation graphs and the longest path problem / Uehara, Ryuhei, Valiente, Gabriel, Information Processing Letters, 103(2), pp.71-77, 2007-07-16, Elsevier
92 Tree Spanners for Bipartite Graphs and Probe Interval Graphs / Brandstadt, Andreas, Dragan, Feodor F., Le, Hoang-Oanh, Le, Van Bang, Uehara, Ryuhei, Algorithmica, 47(1), pp.27-51, 2007-01, Springer
93 Efficient Algorithms for Airline Problem / Nakano, Shin-ichi, Uehara, Ryuhei, Uno, Takeaki, Lecture Notes in Computer Science, 4484, pp.428-439, 2007, Springer
94 スケールフリーグラフ上における局所情報を用いたランダムウォークについて / 平山,亮, 上原,隆平, 情報処理学会研究報告 : アルゴリズム研究会, 2006-AL(107-6), pp.31-37, 2006-07, 情報処理学会
95 The complexity of a Pop-up book / Uehara, Ryuuhei, Teramoto Sachio, 情報処理学会研究報告 : アルゴリズム研究会, 2006-AL(107-10), pp.59-64, 2006-07, 情報処理学会
96 Heuristics for Generating a Simple Polygonalization / Teramoto Sachio, Motoki Mitsuo, Uehara Ryuhei, Asano Tetsuo, 情報処理学会研究報告 : アルゴリズム研究会, 2006-AL(106-6), pp.41-48, 2006-05, 情報処理学会
97 Voronoi game on graphs and its complexity / Teramoto Sachio, Uehara Ryuhei, 情報処理学会研究報告 : アルゴリズム研究会報告, 2006(7), pp.9-16, 2006-01, 情報処理学会
98 グラフクラスとアルゴリズム / 上原, 隆平, 電子情報通信学会誌, 88(2), pp.118-122, 2005-02-01, 電子情報通信学会
99 Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs / Uehara, Ryuhei, Toda, Seinosuke, Nagoya, Takayuki, Discrete Applied Mathematics, 145(3), pp.479-482, 2005-01-30, Elsevier
100 Linear-time counting algorithms for independent sets in chordal graphs / Okamoto, Y, Uno, T, Uehara, R, Lecture Notes in Computer Science : including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 3787, pp.433-444, 2005, SPRINGER-VERLAG

previous 1 2 3 next

 


Contact : Library Information Section, Japan Advanced Institute of Science and Technology