TOP  >  Personal Info.  >  Published Papers
UEHARA, Ryuhei Adviser to the President, Professor, Director of Computing Science Research Area
Information Science, Computing Science

Published Papers

334 items
Computational complexity of jumping block puzzles.
Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara
Theor. Comput. Sci., 983, 114292-114292, 2024
Sorting balls and water: Equivalence and computational complexity.
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Theor. Comput. Sci., 978, 114158-114158, 2023
Any platonic solid can transform to another by O(1) refoldings
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
Computational Geometry: Theory and Applications, 113, -, 2023
Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles
Ko Minamisawa, Ryuhei Uehara, Masao Hara
Theoretical Computer Science, 939, 216-226, 2023
On the Computational Complexity of Generalized Common Shape Puzzles.
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
CoRR, abs/2305.10749, -, 2023
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs.
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
WALCOM, 191-201, 2023
Unsupervised Discovery of Tonality in Bach's Chorales
Yui Uehara, Satoshi Tojo, Ryuhei Uehara
Journal of Intelligence Informatics and Smart Technology, 8, 10:1-10:7, 2022
Logical Matrix Representations in Map Folding
JIA Yiyang, MITANI Jun, UEHARA Ryuhei
日本応用数理学会年会講演予稿集(CD-ROM), E105-A, 10, -, 2022
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
Hugo Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms
18th Scandinavian Symposium and Workshops on Algorithm Theory, -, 2022
Efficient Segment Folding is Hard
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Computational Geometry, 104, 101860-101860, 2022
Rolling Polyhedra on Tessellations
Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams
11th International Conference on Fun with Algorithms (FUN 2022), -, 2022
Sorting Balls and Water: Equivalence and Computational Complexity
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
11th International Conference on Fun with Algorithms (FUN 2022), abs/2202.09495, -, 2022
Ununfoldable polyhedra with 6 vertices or 6 faces
Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara
Computational Geometry, 103, 101857-101857, 2022
Research on Dissections of a Net of a Cube into Nets of Cubes
Tamami OKADA, Ryuhei UEHARA
IEICE Transactions on Information and Systems, E105.D, 3, 459-465, 2022
Bicolored Path Embedding Problems Inspired by Protein Folding Models
Tianfeng FENG, Ryuhei UEHARA, Giovanni VIGLIETTA
IEICE Transactions on Information and Systems, E105.D, 3, 623-633, 2022
Cyclic Shift Problems on Graphs
Kwon Kham SAI, Giovanni VIGLIETTA, Ryuhei UEHARA
IEICE Transactions on Information and Systems, E105.D, 3, 532-540, 2022
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
Hugo Akitaya, Erik Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms
38th European Workshop on Computational Geometry (EuroCG 2022), -, 2022
Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature.
Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara
CCCG, 177-183, 2022
Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra.
Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara
CCCG, 9-23, 2022
Sorting balls and water: Equivalence and computational complexity
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
11th International Conference on Fun with Algorithms (FUN), 16:1-16:17, 2022
Token Shifting on Graphs
Win Hlaing, Hlaing Myint, Ryuhei Uehara
International Journal of Computer Mathematics: Computer Systems Theory, -, 2022
Computational Complexity of Puzzles and Related Topics
Ryuhei Uehara
Interdisciplinary Information Sciences, -, 2022
Developing a Tetramonohedron with Minimum Cut Length
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
Computational Geometry: Theory and Applications, -, 2022
Efficient Folding Algorithms for Convex Polyhedra
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
Discrete & Computational Geometry, -, 2022
Algorithmic enumeration of surrounding polygons
Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
Discrete Applied Mathematics, 303, 305-313, 2021
Unsupervised Discovery of Tonality in Bach's Chorales
Yui Uehara, Satoshi Tojo, Ryuhei Uehara
The 16th International Conference on Knowledge, Information and Creativity Support Systems (KICSS 2021), -, 2021
Token Shifting on Graphs
Win Hlaing, Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta
COCOON 2021, 643-654, 2021
Computational Complexity of Jumping Block Puzzles
Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
COCOON 2021, 655-667, 2021
Max-Min 3-Dispersion Problems
Takashi HORIYAMA, Shin-ichi NAKANO, Toshiki SAITOH, Koki SUETSUGU, Akira SUZUKI, Ryuhei UEHARA, Takeaki UNO, Kunihiro WASA
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E104-A, 9, 1101-1107, 2021
Multilayer tiles
Kota Chida, Erik Demaine, Martin Demaine, David Eppstein, Adam Hesterberg, Takashi Horiyama, John Iacono, Hiro Ito, Stefan Langerman, Ryuhei Uehara
TJCDCGGG 2020+1, 28-29, 2021
Logical Matrix Representations in Map Folding
Yiyang Jia, Jun Mitani, Ryuhei Uehara
TJCDCGGG 2020+1, 106-107, 2021
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
The Canadian Conference on Computational Geometry (CCCG 2021), 332-342, 2021
Shortest reconfiguration of sliding tokens on subclasses of interval graphs
Takeshi Yamada, Ryuhei Uehara
Theoretical Computer Science, 863, 53-68, 2021
Bicolored Path Embedding Problems in Protein Folding Models
Tianfeng Feng, Ryuhei Uehara, Giovanni Viglietta
The 37th European Workshop on Computational Geometry (EuroCG 2021), 24:1-24:9, 2021
Puzzles, Games, and Computational Complexity
上原隆平
日本シミュレーション学会誌, 40, 1, 29-34, 2021
Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles
Ko Minamisawa, Ryuhei Uehara, Masao Hara
The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), LNCS 12635, 321-332, 2021
Cyclic Shift Problems on Graphs
Giovanni Viglietta, Ryuhei Uehara, Kwon Kham Sai
The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), LNCS 12635, 308-320, 2021
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
CoRR, abs/2109.03997, -, 2021
Efficient Folding Algorithms for Regular Polyhedra.
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
CoRR, abs/2105.14305, -, 2021
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.
Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang
Proceedings of the 33rd Canadian Conference on Computational Geometry(CCCG), 332-342, 2021
Packing Cube Nets into Rectangles with O(1) Holes
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow
Discrete and Computational Geometry, Graphs, and Games, 152-164, 2021
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions.
Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda
CoRR, abs/2110.05184, -, 2021
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, E104-A, 9, 1116-1126, 2021
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara
The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), LNCS 12635, 285-295, 2020
Complexity of the Maximum k-Path Vertex Cover Problem
Eiji MIYANO, Toshiki SAITOH, Ryuhei UEHARA, Tsuyoshi YAGITA, Tom C. van der ZANDEN
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E103.A, 10, 1193-1201, 2020
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
The 34th International Symposium on Distributed Computing (DISC 2020), LIPIcs 179, 12:1-12:17, 2020
「折り紙科学」へのお誘い
上原隆平
電子情報通信学会誌, 103, 10, 1048-1049, 2020
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces, Computational Geometry
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssene, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
Theory and Applications, 90, 101648-101648, 2020
Parameterized complexity of independent set reconfiguration problems
Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
Discrete Applied Mathematics, 283, 336-345, 2020
Efficient Folding Algorithms for Regular Polyhedra
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
CCCG 2020, 131-137, 2020
Algorithmic enumeration of surrounding polygons
Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
Discrete Applied Mathematics, 303, 305-313, 2020
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Theoretical Computer Science, 806, 310-322, 2020
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots.
Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
34th International Symposium on Distributed Computing(DISC), 12-17, 2020
Efficient Folding Algorithms for Regular Polyhedra.
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
Proceedings of the 32nd Canadian Conference on Computational Geometry(CCCG), 121-127, 2020
Efficient Algorithm for 2 × n Map Folding with a Box-pleated Crease Pattern
Yiyang Jia, Jun Mitani, Ryuhei Uehara
Journal of Information Processing, 28, 806-815, 2020
Minimum Forcing Sets for Single-vertex Crease Pattern
Koji Ouchi, Ryuhei Uehara
Journal of Information Processing, 28, 800-805, 2020
Efficient Algorithm for Box Folding
Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
Journal of Graph Algorithms and Applications, 24, 2, 89-103, 2020
Valid Orderings of Layers When Simple-Folding a Map
Yiyang Jia, Jun Mitani, Ryuhei Uehara
Journal of Information Processing, 28, 816-824, 2020
Rectangular Unfoldings of Polycubes
Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason Ku, Ryuhei Uehara
Journal of Information Processing, 28, 841-845, 2020
On the complexity of lattice puzzles
Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara
Leibniz International Proceedings in Informatics, LIPIcs, 149, -, 2019
On Computational Complexity of Pipe Puzzles
Takumu Shirayama, Takuto Shigemura, Yota Otachi, Shuichi Miyazaki, Ryuhei Uehara
IEICE Trans. on Inf. and Sys., E102-A, 9, 1134-1141, 2019
Sequentially Swapping Colored Tokens on Graphs.
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
J. Graph Algorithms Appl., 23, 1, 3-27, 2019
Simple Fold and Cut Problem for Line Segments
Guoxin Hu, Shinichi Nakano, Ryuhei Uehara, Takeaki Uno
Proc. of CCCG 2019, 158-163, 2019
Report from EATCS Japan Chapter.
Ryuhei Uehara
Bulletin of the EATCS, 128, 128, 109-112, 2019
Computational Origami
上原 隆平
電子情報通信学会誌 = The journal of the Institute of Electronics, Information and Communication Engineers, 102, 4, 297-299, 2019
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns.
Koji Ouchi, Ryuhei Uehara
IEICE Transactions, 102-D, 3, 416-422, 2019
Ecient Segment Folding is Hard.
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Proceedings of the 31st Canadian Conference on Computational Geometry(CCCG), 177-183, 2019
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11485 LNCS, 262-273, 2019
Reconfiguring Undirected Paths.
Erik D. Demaine, David Eppstein,Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
CoRR, abs/1905.00518, 353-365, 2019
Efficient Algorithm for Box Folding.
Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings, 277-288, 2019
Reconfiguring Undirected Paths.
Erik D. Demaine, David Eppstein,Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings, 353-365, 2019
Max-Min 3-Dispersion Problems.
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings, 291-300, 2019
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11485 LNCS, 262-273, 2019
Special Issue on Reconfiguration Problems
Abu-Khzam Faisal, Fernau Henning, Uehara Ryuhei
ALGORITHMS, 11, 11, -, 2018
Rep-Cubes: Dissection of a Cube into Nets.
Dawei Xu, Jinfeng Huang, Yuta Nakane, Tomoo Yokoyama, Takashi Horiyama, Ryuhei Uehara
IEICE Transactions, 101-A, 9, 1420-1430, 2018
Swapping colored tokens on graphs
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Theoretical Computer Science, 729, 1-10, 2018
Report from EATCS Japan Chapter.
Ryuhei Uehara
Bulletin of the EATCS, 125, 125, 201-205, 2018
Othello Font
Khorramian Amanj, Taniguchi Tomoko, Uno Takeaki, Uehara Ryuhei
電子情報通信学会コンピューテーション研究会資料, -, 2018
Complexity of the Maximum k-Path Vertex Cover Problem
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10755, 240-251, 2018
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10755, 8-19, 2018
Computational Complexity of Robot Arm Simulation Problems.
Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto,Array, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings, 10979, 177-188, 2018
Exact Algorithms for the Max-Min Dispersion Problem.
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Frontiers in Algorithmics - 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings, 263-272, 2018
Flat foldings of plane graphs with prescribed angles and edge lengths.
Zachary Abel,Erik D. Demaine, Martin L. Demaine, David Eppstein,Anna Lubiw, Ryuhei Uehara
JoCG, 9, 1, 74-93, 2018
Bumpy pyramid folding
Zachary R. Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
Computational Geometry: Theory and Applications, 75, 22-31, 2018
Space Efficient Algorithms for Maximum (Weight) Independent Set on Circular Arcs
浦川 翔平, van der, Zanden Tom C, 斎藤 寿樹, 上原 隆平
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 117, 370, 11-18, 2017
Space Efficient Algorithms for Maximum (Weight) Independent Set on Circular Arcs
浦川 翔平, van der, Zanden Tom C, 斎藤 寿樹, 上原 隆平
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 117, 369, 11-18, 2017
Complexity of Tiling a Polygon with Trominoes or Bars
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
DISCRETE & COMPUTATIONAL GEOMETRY, 58, 3, 686-704, 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
Journal of Information Processing, 25, 708-715, 2017
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
Journal of Information Processing, 25, 610-615, 2017
Common developments of three incongruent boxes of area 30
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 64, 1-12, 2017
Ferrers dimension of grid intersection graphs
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
DISCRETE APPLIED MATHEMATICS, 216, 130-135, 2017
Sliding Tokens on Block Graphs
Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara
WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 10167, 460-471, 2017
Sequentially Swapping Colored Tokens on Graphs
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 10167, 435-447, 2017
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
Koji Ouchi, Ryuhei Uehara
WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 10167, 19-29, 2017
Rep-cubes: Unfolding and Dissection of Cubes.
Dawei Xu, Takashi Horiyama, Ryuhei Uehara
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada, 62-67, 2017
Report from EATCS Japan Chapter.
Ryuhei Uehara
Bulletin of the EATCS, 121, -, 2017
Computational Complexity of Sequential Token Swapping Problem (コンピュテーション)
山中 克久, ドメイン エリック, 堀山 貴史, 河村 彰星, 中野 眞一, 岡本 吉央, 斎藤 寿樹, 鈴木 顕, 上原 隆平, 宇野 毅明
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 116, 116, 115-121, 2016
シーケンシャルな交換による色付きトークン整列問題の計算複雑さ
山中 克久, エリック ドメイン, 堀山 貴史, 河村 彰星, 中野 眞一, 岡本 吉央, 斎藤 寿樹, 鈴木 顕, 上原 隆平, 宇野 毅明
第158回アルゴリズム研究会, 1-7, 2016
The Convex Configurations of "Sei Shonagon Chie no Ita," Tangram, and Other Silhouette Puzzles with Seven Pieces
Eli Fox-Epstein, Kazuho Katsumata, Ryuhei Uehara
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E99A, 6, 1084-1089, 2016
Report from the Japanese Chapter.
Ryuhei Uehara
Bulletin of the EATCS, 119, 119, 111-114, 2016
Folding a paper strip to minimize thickness
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Journal of Discrete Algorithms, 36, 18-26, 2016
Polynomial-time algorithms for SUBGRAPH ISOMORPHISM in small graph classes of perfect graphs
Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
DISCRETE APPLIED MATHEMATICS, 199, 37-45, 2016
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 51, 25-39, 2016
ON A STIFFNESS MODEL FOR ORIGAMI FOLDING
Yusuke Nakada, Yota Fujieda, Taisei Mori, Hitoshi Iwai, Kazumasa Nakaya, Ryuhei Uehara, Masashi Yamabe
INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2015, VOL 5B, 5B-2015, -, 2016
ON A STIFFNESS MODEL FOR ORIGAMI FOLDING
Yusuke Nakada, Yota Fujieda, Taisei Mori, Hitoshi Iwai, Kazumasa Nakaya, Ryuhei Uehara, Masashi Yamabe
INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2015, VOL 5B, -, 2016
Box Pleating is Hard
Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 167-179, 2016
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 180-192, 2016
A Hexagon-Shaped Stable Kissing Unit Disk Tree
Man-Kwun Chiu, Maarten Loffler, Marcel Roeloffzen, Ryuhei Uehara
GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016), 9801, 628-630, 2016
Shortest reconfiguration of sliding tokens on a caterpillar
Takeshi Yamada, Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9627, 236-248, 2016
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 180-192, 2016
Box Pleating is Hard
Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 167-179, 2016
Single-Player and Two-Player Buttons & Scissors Games
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loeffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 60-72, 2016
Single-Player and Two-Player Buttons & Scissors Games
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loeffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 60-72, 2016
Shortest reconfiguration of sliding tokens on a caterpillar
Takeshi Yamada, Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9627, 236-248, 2016
Sliding Tokens on a Cactus.
Ryuhei Uehara
27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia, 37:1-37:26-, 2016
Convex Configurations on Nana-kin-san Puzzle.
Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya
8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy, 20:1-20:14-14, 2016
Common unfolding of regular tetrahedron and Johnson-Zalgaller solid
Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
Journal of Graph Algorithms and Applications, 20, 1, 101-104, 2016
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 180-192, 2016
Linear-time algorithm for sliding tokens on trees
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachic, Ryuhei Uehara, Takeshi Yamada
THEORETICAL COMPUTER SCIENCE, 600, 132-142, 2015
Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds
Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E98D, 3, 486-489, 2015
Computational complexity of puzzles and games
Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9135, -, 2015
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid.
Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
WALCOM: Algorithms and Computation - 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings, 8973, 294-305, 2015
Folding a Paper Strip to Minimize Thickness.
Erik D. Demaine, David Eppstein,Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
WALCOM: Algorithms and Computation - 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings, 8973, 113-124, 2015
Swapping colored tokens on graphs
Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9214, 619-628, 2015
Competitive diffusion on weighted graphs
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9214, 422-433, 2015
Common Developments of Three Incongruent Boxes of Area 30
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015), 9076, 236-247, 2015
Sliding Token on Bipartite Permutation Graphs
Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara
ALGORITHMS AND COMPUTATION, ISAAC 2015, 9472, 237-247, 2015
The Japanese Chapter.
Ryuhei Uehara
Bulletin of the EATCS, 116, -, 2015
Swapping colored tokens on graphs
Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9214, 619-628, 2015
The Height of Random k-Trees and Related Branching Processes
Colin Cooper, Alan Frieze, Ryuhei Uehara
RANDOM STRUCTURES & ALGORITHMS, 45, 4, 675-702, 2014
Base-object location problems for base-monotone regions
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
THEORETICAL COMPUTER SCIENCE, 555, 71-84, 2014
A 4.31-approximation for the geometric unique coverage problem on unit disks
Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
THEORETICAL COMPUTER SCIENCE, 544, 14-31, 2014
Computational Complexity and an Integer Programming Model of Shakashaka
Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E97A, 6, 1213-1219, 2014
Computational Complexity of Piano-Hinged Dissections
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, Ryuhei Uehara
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E97A, 6, 1206-1212, 2014
Linear time algorithm for Independent Set Reconfiguration Problem on a caterpillar graph
Takeshi Yamada, Ryuhei Uehara
IPSJ SIG Notes, 2014, 11, 1-5, 2014
UNO is hard, even for a single player
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
THEORETICAL COMPUTER SCIENCE, 521, 51-61, 2014
Depth-First Search Using O(n) Bits
Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 553-564, 2014
Computational complexity and an integer programming model of shakashaka
Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E97-A, 6, 1213-1219, 2014
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
CoRR, abs/1412.3334, -, 2014
Folding a Paper Strip to Minimize Thickness.
Erik D. Demaine, David Eppstein,Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
CoRR, abs/1411.6371, -, 2014
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
GRAPH DRAWING (GD 2014), 8871, 272-283, 2014
The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles.
Eli Fox-Epstein, Ryuhei Uehara
CoRR, abs/1407.1923, -, 2014
Polynomial-Time Algorithm for Sliding Tokens on Trees
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 389-400, 2014
On the Parameterized Complexity for Token Jumping on Graphs
Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2014), 8402, 341-351, 2014
Intersection Dimension of Bipartite Graphs
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2014), 8402, 323-340, 2014
Polynomial-Time Algorithms for SUBGRAPH ISOMORPHISM in Small Graph Classes of Perfect Graphs
Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2014), 8402, 216-228, 2014
Depth-First Search Using O(n) Bits
Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 553-564, 2014
Polynomial-Time Algorithm for Sliding Tokens on Trees
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 389-400, 2014
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
GRAPH DRAWING (GD 2014), 8871, 272-283, 2014
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set
Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
FUN WITH ALGORITHMS, 8496, 230-239, 2014
The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles.
Eli Fox-Epstein, Ryuhei Uehara
Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014, -, 2014
Bumpy Pyramid Folding.
Zachary Abel,Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014, -, 2014
Report from the Japanese Chapter.
Ryuhei Uehara
Bulletin of the EATCS, 114, -, 2014
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr,Birgit Vogtenhuber, Emo Welzl
Discrete Mathematics & Theoretical Computer Science, 16, 3, 317-332, 2014
The graph isomorphism problem on geometric graphs.
Ryuhei Uehara
Discrete Mathematics & Theoretical Computer Science, 16, 2, 87-96, 2014
Algorithms for Independent Set Reconfiguration Problem on Graphs (Theoretical Foundations of Computing)
DEMAINE Erik D, DEMAINE Martin L, ITO Takehiro, ONO Hirotaka, UEHARA Ryuhei
IEICE technical report. Theoretical foundations of Computing, 113, 371, 7-14, 2013
Efficient algorithms for a simple network design problem
Shin-ichi Nakano, Ryuhei Uehara, Takeaki Uno
NETWORKS, 62, 2, 95-104, 2013
The complexity of the stamp folding problem
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
THEORETICAL COMPUTER SCIENCE, 497, 13-19, 2013
Variations on Instant Insanity
ABEL ZACHARY, DEMAINE ERIK D., DEMAINE MARTIN L., HORIYAMA TAKASHI, UEHARA RYUHEI
Lecture Notes in Computer Science, 113, 50, 33-38, 2013
DS-1-11 The Complexity of Free Flood Filling Games
Fukui Hiroyuki, Nakanishi Akihiro, Otachi Yota, Uehara Ryuhei, Uno Takeaki, Uno Yushi
Proceedings of the IEICE General Conference, 2013, 1, "S-21"-"S-22", 2013
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E96D, 3, 426-432, 2013
COMMON DEVELOPMENTS OF THREE INCONGRUENT ORTHOGONAL BOXES
Toshihiro Shirakawa, Ryuhei Uehara
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 23, 1, 65-71, 2013
Route-Enabling Graph Orientation Problems
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
ALGORITHMICA, 65, 2, 317-338, 2013
Zipper unfolding of domes and prismoids
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
CCCG 2013 - 25th Canadian Conference on Computational Geometry, 43-48, 2013
On complexity of flooding games on graphs with interval representations
Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8296, 73-84, 2013
On complexity of flooding games on graphs with interval representations
Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8296, 73-84, 2013
Base location problems for base-monotone regions
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7748, 53-64, 2013
Zipper Unfoldability of Domes and Prismoids.
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013, -, 2013
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl
Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013, 16, 3, 317-332, 2013
Variations on instant insanity
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8066, 33-47, 2013
Coverage with k-transmitters in the presence of obstacles
Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán, Diane Souvaine, Ryuhei Uehara
Journal of Combinatorial Optimization, 25, 2, 208-233, 2013
The Japanese Chapter.
Ryuhei Uehara
Bulletin of the EATCS, 110, 21-24, 2013
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.
Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
Discrete Math., Alg. and Appl., 5, 2, 1360001-1-1360001-14, 2013
On the Complexity of Packing Trominoes
HORIYAMA Takashi, ITO Takehiro, NAKATSUKA Keita, SUZUKI Akira, UEHARA Ryuhei
IEICE technical report. Theoretical foundations of Computing, 112, 272, 37-43, 2012
Packing trominoes is NP-complete, #P-hard and ASP-complete
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012), 219-224, 2012
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
INFORMATION SCIENCES, 197, 77-90, 2012
Approximation for the Geometric Unique Coverage Problem on Unit Squares
ITO Takehiro, NAKANO Shin-ichi, OKAMOTO Yoshio, OTACHI Yota, UEHARA Ryuhei, UNO Takeaki, UNO Yushi
IEICE technical report. Theoretical foundations of Computing, 112, 93, 95-101, 2012
On the base-line location problem for the maximum weight region decomposable into base-monotone shapes (New Trends in Algorithms and Theory of Computation)
Horiyama Takashi, Ito Takehiro, Ono Hirotaka, Otachi Yota, Uehara Ryuhei, Uno Takeaki
RIMS Kokyuroku, 1799, 1799, 123-129, 2012
GHOST CHIMNEYS
David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 22, 3, 207-214, 2012
On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes
HORIYAMA Takashi, ITO Takehiro, KAOTHANTHONG Natsuda, ONO Hirotaka, OTACHI Yota, TOKUYAMA Takeshi, UEHARA Ryuhei, UNO Takeaki
IEICE technical report. Theoretical foundations of Computing, 112, 21, 37-43, 2012
区間表現をもつグラフ上でのFloodingゲームの複雑さ
福井 宏行, 上原 隆平, 宇野 毅明, 宇野 裕之
第139回情報処理学会アルゴリズム研究会, 2012-AL-139, 7, 1-8, 2012
Any monotone function is realized by interlocked polygons
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
Algorithms, 5, 1, 148-157, 2012
Random generation and enumeration of bipartite permutation graphs
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
Journal of Discrete Algorithms, 10, 1, 84-97, 2012
NP-completeness of generalized Kaboozle
Asano Tetsuo, Demaine Erik D., Demaine Martin L., Uehara Ryuhei
IMT, 7, 3, 1019-1024, 2012
On Complexity of Flooding Games on Graphs with Interval Representations
Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno
CoRR, abs/1206.6201, -, 2012
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7157, 5-16, 2012
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7357, 24-35, 2012
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
ALGORITHMS AND COMPUTATION, ISAAC 2012, 7676, 372-381, 2012
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete.
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, 211-216, 2012
Covering Points with Disjoint Unit Disks.
Greg Aloupis,Robert, A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara
Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, 41-46, 2012
Common Developments of Three Different Orthogonal Boxes.
Toshihiro Shirakawa, Ryuhei Uehara
Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, 17-22, 2012
NP-completeness of generalized Kaboozle
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
Journal of Information Processing, 20, 3, 713-718, 2012
Report from the Japanese Chapter.
Ryuhei Uehara
Bulletin of the EATCS, 107, 23-26, 2012
On bipartite powers of bigraphs
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 14, 2, 11-20, 2012
Bipartite Permutation Graphs are reconstructible.
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Discrete Math., Alg. and Appl., 4, 3, 1250039-1250039, 2012
The Complexity of Free Flood Filling Games
福井宏行, 中西朗裕, 上原隆平, 宇野毅明, 宇野裕之
第195回電子情報通信学会コンピュテーション研究会, 195, 47-51, 2011
UNO is hard, even for a single player
Demaine Erik D, Demaine Martin L, Uehara Ryuhei, Uno Takeaki, Uno Yushi
RIMS Kokyuroku, 1744, 1744, 48-55, 2011
Voronoi Game on a Path
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 6, 1185-1189, 2011
Construction of Common Unfolding of a Regular Tetrahedron and a Cube
白川 俊博, 堀山 貴史, 上原 隆平
研究報告アルゴリズム(AL), 2011, 10, 1-5, 2011
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno
GRAPHS AND COMBINATORICS, 27, 3, 341-351, 2011
On the complexity of reconfiguration problems
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
THEORETICAL COMPUTER SCIENCE, 412, 12-14, 1054-1065, 2011
Exclusive covering of point set by unit disks
岡山 陽介, 清見 礼, 上原 隆平
研究報告アルゴリズム(AL), 2011, 19, 1-8, 2011
On the Hoffman Puzzle and its generalization
後藤 新, 上原 隆平
研究報告アルゴリズム(AL), 2011, 18, 1-4, 2011
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
Journal of Graph Algorithms and Applications, 15, 6, 727-751, 2011
Special issue on selected papers from the third annual workshop on algorithms and computation (WALCOM 2009)
Sandip Das, Ryuhei Uehara
Journal of Graph Algorithms and Applications, 15, 3, 319-321, 2011
Stamp Foldings with a Given Mountain-Valley Assignment
Ryuhei Uehara
ORIGAMI(5): FIFTH INTERNATIONAL MEETING OF ORIGAMI SCIENCE, MATHEMATICS, AND EDUCATION, 585-597, 2011
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6648, 452-462, 2011
Complexity of the Stamp Folding Problem
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 6831, 311-321, 2011
On covering of any point configuration by disjoint unit disks.
Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011, -, 2011
Common Developments of Several Different Orthogonal Boxes.
Zachary Abel,Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011, -, 2011
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 6648, 6, 452-462, 2011
The voronoi game on graphs and its complexity
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
Journal of Graph Algorithms and Applications, 15, 4, 485-501, 2011
Guest Editor's Foreword.
Sandip Das, Ryuhei Uehara
J. Graph Algorithms Appl., 15, 3, 319-321, 2011
Nonexistence of Common Edge Developments of Regular Tetrahedron and Other Platonic Solids
堀山 貴史, 上原 隆平
研究報告アルゴリズム(AL), 2010, 1, 1-4, 2010
Computational Complexity of Origami
UEHARA Ryuhei
Journal of the Japan Society for Simulation Technology, 29, 3, 96-101, 2010
Reconstruction of interval graphs
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
THEORETICAL COMPUTER SCIENCE, 411, 43, 3859-3866, 2010
Undecidability of a Simple Origami Problem
UEHARA RYUHEI
研究報告アルゴリズム(AL), 2010, 11, 1-3, 2010
Enumeration of the perfect sequences of a chordal graph
Yasuko Matsui, Ryuhei Uehara, Takeaki Uno
THEORETICAL COMPUTER SCIENCE, 411, 40-42, 3635-3641, 2010
Random Generation and Enumeration of Proper Interval Graphs
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E93D, 7, 1816-1823, 2010
Scale Free Properties of Random k-Trees
Colin Cooper, Ryuhei Uehara
Mathematics in Computer Science, 3, 4, 489-496, 2010
Voronoi Game on a Path
KIYOMI Masashi, SAITOH Toshiki, UEHARA Ryuhei
IEICE technical report, 110, 37, 1-5, 2010
NP-completeness of generalized Kaboozle
ASANO TETSUO, DEMAINE ERIK D, DEMAINE MARTIN L, UEHARA RYUHEI
研究報告アルゴリズム(AL), 2010, 3, 1-6, 2010
Stretch Minimization Problem of a Strip Paper
UEHARA RYUHEI
研究報告アルゴリズム(AL), 2010, 2, 1-7, 2010
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, 1714-1722, 2010
SUBEXPONENTIAL INTERVAL GRAPHS GENERATED BY IMMIGRATION-DEATH PROCESSES
Naoto Miyoshi, Mariko Ogura, Takeya Shigezumi, Ryuhei Uehara
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 24, 2, 289-301, 2010
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 5911, 296-+, 2010
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 5911, 296-+, 2010
The complexity of UNO
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
CoRR, abs/1003.2851, -, 2010
Reconstruction Algorithm for Permutation Graphs
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5942, 125-135, 2010
UNO Is Hard, Even for a Single Player
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
FUN WITH ALGORITHMS, PROCEEDINGS, 6099, 133-+, 2010
Kaboozle Is NP-complete, Even in a Strip
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
FUN WITH ALGORITHMS, PROCEEDINGS, 6099, 28-+, 2010
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 6129, 190-+, 2010
Bipartite Permutation Graphs Are Reconstructible
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 6509, 362-+, 2010
Coverage with k-Transmitters in the Presence of Obstacles
Brad Ballinger, Nadia Benbernou, Prosenjit Bose, La Damian, Erik D. Demaine, Vida Dujmovic, Robin Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristan, Diane Souvaine, Ryuhei Uehara
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 6509, 1-+, 2010
On stretch minimization problem on unit strip paper.
Ryuhei Uehara
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, 223-226, 2010
Any monotone boolean function can be realized by interlocked polygons.
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, 139-142, 2010
Ghost chimneys.
David Charlton, Erik D. Demaine, Martin L, Demaine,Vida Dujmovic, Pat Morin, Ryuhei Uehara
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, 63-66, 2010
Scale free interval graphs
Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe
Theoretical Computer Science, 410, 45, 4588-4600, 2009
1-D-4 経路長を短くする一方通行決定(離散・組合せ最適化(2))
伊藤 健洋, 上原 隆平, 小野 廣隆, 玉木 久夫, 宮本 裕一郎
日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集, 2009, 78-79, 2009
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
Sandip Das, Ryuhei Uehara
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5431 LNCS, -, 2009
On Scale free k-trees
COOPER Colin, UEHARA Ryuhei
研究報告アルゴリズム(AL), 2009, 2, 1-8, 2009
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
Shin-ichi Nakano, Ryuhei Uehara, Takeaki Uno
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 24, 3, 517-533, 2009
Complexity of pleat folding (Theoretical Computer Science and Its Applications)
Ito Tsuyoshi, Kiyomi Masashi, Imahori Shinji, Uehara Ryuhei
RIMS Kokyuroku, 1649, 1649, 66-72, 2009
Enumeration of perfect sequences of chordal graph (Acceleration and visualization of computation for enumeration problems)
Matsui Yasuko, Uehara Ryuhei, Uno Takeaki
RIMS Kokyuroku, 1644, 1644, 86-94, 2009
Laminar structure of ptolemaic graphs with applications
Ryuhei Uehara, Yushi Uno
DISCRETE APPLIED MATHEMATICS, 157, 7, 1533-1543, 2009
Reconstruction of connected interval graphs (Acceleration and visualization of computation for enumeration problems)
Kiyomi Masashi, Saitoh Toshiki, Uehara Ryuhei
RIMS Kokyuroku, 1644, 1644, 128-134, 2009
2-E-17 Enumeration of Perfect Sequences of Chordal Graph
MATSUI Yasuko, UEHARA Ryuhei, UNO Takeaki
日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集, 2009, 260-261, 2009
Efficient Enumeration of All Ladder Lotteries
YAMANAKA Katsuhisa, NAKANO Shin-ichi, MATSUI Yasuko, UEHARA Ryuhei, NAKADA Kento
IEICE technical report, 108, 443, 17-23, 2009
Complexity of Pleats Folding
ITO Tsuyoshi, KIYOMI Masashi, IMAHORI Shinji, UEHARA Ryuhei
IPSJ SIG Notes, 2009, 9, 1-8, 2009
Random Generation and Enumeration of Proper Interval Graphs
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5431, 177-+, 2009
Random Generation and Enumeration of Bipartite Permutation Graphs
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 1104-+, 2009
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 452-+, 2009
Route-Enabling Graph Orientation Problems
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 403-+, 2009
Reconstruction of Interval Graphs
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
COMPUTING AND COMBINATORICS, PROCEEDINGS, 5609, 106-115, 2009
How to make a picturesque maze.
Yoshio Okamoto, Ryuhei Uehara
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009, 137-140, 2009
2-E-6 無限サーバ待ち行列がつくるスケールフリー区間グラフ : クラスタ係数の評価(待ち行列(2))
小倉 麻理子, 三好 直人, 繁住 健哉, 上原 隆平
日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集, 2008, 270-271, 2008
Special section on Discrete Mathematics and its Applications - Foreword
Ryuhei Uehara
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2283-2283, 2008
Scale-free interval graphs generated by immigration-death processes
Naoto Miyoshi, Mariko Ogura, Takeya Shigezumi, Ryuhei Uehara
Proceedings of 2008 International Workshop on Applied Probability (IWAP 2008), vol., no., pp. CD-ROM, 2008
Origami as Computer Science
UEHARA Ryuhei
The Journal of the Institute of Electronics, Information and Communication Engineers, 91, 6, 506-509, 2008
Counting the number of independent sets in chordal graphs
Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
Journal of Discrete Algorithms, 6, 2, 229-242, 2008
Counting the number of independent sets in chordal graphs
Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
Journal of Discrete Algorithms, 6, 2, 229-242, 2008
Enumeration of Perfect Sequences of Chordal Graph
MATSUI Yasuko, UEHARA Ryuhei, UNO Takeaki
IEICE technical report, 108, 11, 15-21, 2008
2-B-4 無限サーバ待ち行列がつくるスケールフリー区間グラフ(待ち行列(2))
小倉 麻理子, 繁住 健哉, 三好 直人, 上原 隆平
日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集, 2008, 134-135, 2008
Longest path problems on Ptolemaic graphs
Yoshihiro Takahara, Sachio Teramoto, Ryuhei Uehara
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E91D, 2, 170-177, 2008
Simple geometrical intersection graphs
Ryuhei Uehara
WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 4921, 25-+, 2008
Enumeration of Perfect Sequences of Chordal Graph
Yasuko Matsui, Ryuhei Uehara, Takeaki Uno
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5369, 859-+, 2008
Bandwidth of Bipartite Permutation Graphs
Ryuhei Uehara
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5369, 824-835, 2008
On the Complexity of Reconfiguration Problems
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5369, 28-+, 2008
Polygons Folding to Plural Incongruent Orthogonal Boxes.
Ryuhei Uehara
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montréal, Canada, August 13-15, 2008, 31-34, 2008
Inverting Linkages with Stretch.
Youichi Fujimoto, Mitsuo Motoki, Ryuhei Uehara
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montréal, Canada, August 13-15, 2008, -, 2008
Scale free interval graphs
Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 5034, 292-+, 2008
Special Section on Discrete Mathematics and Its Applications.
Ryuhei Uehara
IEICE Transactions, 91-A, 9, 2283-, 2008
On computing longest paths in small graph classes
Ryuhei Uehara, Yushi Uno
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 18, 5, 911-930, 2007
Bandwidth of Bipartite Permutation Graphs (Extended Abstract)
UEHARA Ryuhei
IEICE technical report, 107, 219, 29-34, 2007
Linear structure of bipartite permutation graphs and the longest path problem
Ryuhei Uehara, Gabriel Valiente
INFORMATION PROCESSING LETTERS, 103, 2, 71-77, 2007
Linear structure of bipartite permutation graphs and the longest path problem
Ryuhei Uehara, Gabriel Valiente
INFORMATION PROCESSING LETTERS, 103, 2, 71-77, 2007
Simple Efficient Algorithm for MPQ-tree of an Interval Graph
SAITOH Toshiki, KIYOMI Masashi, UEHARA Ryuhei
IEICE technical report, 107, 127, 49-54, 2007
Ptolemaic Graph上の最長路問題に関する研究 (計算機科学の理論とその応用 RIMS研究集会報告集)
高原 祥浩, 寺本 幸生, 上原 隆平
数理解析研究所講究録, 1554, 1554, 109-116, 2007
区間表現からMPQ-treeを効率よく構成するアルゴリズム (計算機科学の理論とその応用 RIMS研究集会報告集)
斎藤 寿樹, 清見 礼, 上原 隆平
数理解析研究所講究録, 1554, 1554, 93-100, 2007
Tree spanners for bipartite graphs and probe interval graphs
Andreas Brandstaedt, Feodor F. Dragan, Hoang-Oanh Le, Van Bang Le, Ryuhei Uehara
ALGORITHMICA, 47, 1, 27-51, 2007
Tree spanners for bipartite graphs and probe interval graphs
Andreas Brandstaedt, Feodor F. Dragan, Hoang-Oanh Le, Van Bang Le, Ryuhei Uehara
ALGORITHMICA, 47, 1, 27-51, 2007
Simple Efficient Algorithm for MPQ-tree of an Interval Graph
Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Proceedings of the KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC 2007), 121-126, 2007
Voronoi game on graphs and its complexity
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
Proceedings of the 2006 IEEE Symposium on Computational Intelligence and Games, CIG'06, 265-271, 2007
Voronoi game on graphs and its complexity
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
Proceedings of the 2006 IEEE Symposium on Computational Intelligence and Games, CIG'06, 265-271, 2007
Efficient algorithms for airline problem
Shin-ichi Nakano, Ryuhei Uehara, Takeaki Uno
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 428-+, 2007
A new approach to graph recognition and applications to distance-hereditary graphs
Shin-ichi Nakano, Ryuhei Uehara, Takeaki Uno
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 115-+, 2007
Efficient Algorithms for Airline Problem
UEHARA Ryuhei
IEICE technical report, 106, 289, 25-31, 2006
Random Walks by Local Topological lnformation on Scale-free Graphs
HIRAYAMA Ryo, UEHARA Ryuhei
IPSJ SIG Notes, 2006, 71, 31-37, 2006
Heuristics for Generating a Simple Polygonalization
TERAMOTO Sachio, MOTOKI Mitsuo, UEHARA Ryuhei, ASANO Tetsuo
IPSJ SIG Notes, 2006, 49, 41-48, 2006
Canonical Tree Representation of Distance Hereditary Graphs with Applications
UEHARA Ryuhei, UNO Takeaki
IEICE technical report, 105, 679, 31-38, 2006
Special section on discrete mathematics and its applications
Keiko Imai, Hisashi Koga, Mitsuru Matsui, Tomomi Matsui, Atsuko Miyaji, Kunihiko Sadakane, Tetsuo Shibuya, Akiyoshi Shioura, Tsuyoshi Takagi, Yasuhiko Takenaga, Eiji Takimoto, Keisuke Tanaka, Tatsuie Tsukiji, Ryuhei Uehara, Takeaki Uno, Koichi Yamazaki, Satoshi Fujita
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1159-, 2006
The Complexity of a Pop-Up Book.
Ryuhei Uehara, Sachio Teramoto
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen's University, Ontario, Canada, 2006, 71, 59-64, 2006
Laminar Structure of Ptolemaic Graphs and Its Applications
上原 隆平, 宇野 裕之
電子情報通信学会技術研究報告, 105, 273, 17-24, 2005
Graph Classes and Algorithms
UEHARA Ryuhei
The Journal of the Institute of Electronics, Information and Communication Engineers, 88, 2, 118-122, 2005
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
R Uehara, S Toda, T Nagoya
DISCRETE APPLIED MATHEMATICS, 145, 3, 479-482, 2005
Linear-time counting algorithms for independent sets in chordal graphs
Y Okamoto, T Uno, R Uehara
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 3787, 433-444, 2005
Laminar structure of ptolemaic graphs and its applications
R Uehara, Y Uno
ALGORITHMS AND COMPUTATION, 3827, 186-195, 2005
Counting the Independent Sets of a Chordal Graph
OKAMOTO Yoshio, UNO Takeaki, UEHARA Ryuhei
IPSJ SIG Notes, 2004, 76, 17-24, 2004
A double classification tree search algorithm for index SNP selection
PS Zhang, HT Sheng, R Uehara
BMC BIOINFORMATICS, 5, 89, -, 2004
Longest Paths in Small Graph Classes
UEHARA Ryuhei, UNO Yushi
IEICE technical report. Theoretical foundations of Computing, 104, 55, 53-60, 2004
Extended MPQ - Trees for Probe Interval Graphs
UEHARA Ryuhei
IPSJ SIG Notes, 2004, 10, 97-104, 2004
Efficient algorithms for the longest path problem
R Uehara, Y Uno
ALGORITHMS AND COMPUTATION, 3341, 871-883, 2004
Canonical data structure for interval probe graphs
R Uehara
ALGORITHMS AND COMPUTATION, 3341, 859-870, 2004
Tree spanners for bipartite graphs and probe interval graphs
A Brandstadt, FF Dragan, HO Le, VB Le, R Uehara
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2880, 106-118, 2003
Completeness of Graph Isomorphism Problem for Bipartite Graph Classes
NAGOYA Takayuki, UEHARA Ryuhei, TODA Seinosuke
IEICE technical report. Theoretical foundations of Computing, 101, 708, 1-5, 2002
Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles
Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara
Canadian Conference on Computational Geometry, 105-108, 2002
Linear time algorithms on chordal bipartite and strongly chordal graphs
R Uehara
AUTOMATA, LANGUAGES AND PROGRAMMING, 2380, 2380, 993-1004, 2002
Parallel approximation algorithms for maximum weighted matching in general graphs
Ryuhei Uehara, Zhi-Zhong Chen
Information Processing Letters, 76, 1-2, 13-17, 2000
Parallel approximation algorithms for maximum weighted matching in general graphs
R Uehara, ZZ Chen
INFORMATION PROCESSING LETTERS, 76, 1-2, 13-17, 2000
Fast Parallel Approximation Algorithms for Maximum Weighted Matching Problem
UEHARA Ryuhei
IPSJ SIG Notes, 2000, 5, 33-40, 2000
Identification of partial disjunction, parity, and threshold functions
R Uehara, K Tsuchida, Wegener, I
THEORETICAL COMPUTER SCIENCE, 230, 1-2, 131-147, 2000
Unique Solution Instance Generation for the 3-Satisfiability (3SAT) Problem
Mitsuo Motoki, Ryuhei Uehara
SAT 2000, 293-307, 2000
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs.
Ryuhei Uehara, Zhi-Zhong Chen, Xin He
Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, 1872, 84-98, 2000
The Number of Connected Components in Graphs and Its Applications
UEHARA Ryuhei
IEICE technical report. Theoretical foundations of Computing, 99, 86, 1-8, 1999
Tractable and Intractable Problems on Generalized Chordal Graphs
UEHARA Ryuhei
IEICE Technical Report, 98, 685, 1-8, 1999
Fast RNC and NC algorithms for maximal path sets
R Uehara, ZZ Chen, He, X
THEORETICAL COMPUTER SCIENCE, 215, 1-2, 89-98, 1999
A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits.
Ryuhei Uehara
International Journal of Foundations of Computer Science, 10, 4, 473-482, 1999
Another measure for the lexicographically first maximal subgraph problems and its threshold value on a random graph
R Uehara
FOURTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN'99), PROCEEDINGS, 350-355, 1999
Parallel algorithms for maximal linear forests
Ryuhei Uehara, Zhi Zhong Chen
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E80-A, 4, 627-634, 1997
Collapse of PP with a semi-random source to BPP
R Uehara
INFORMATION PROCESSING LETTERS, 61, 2, 83-87, 1997
A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problem
Ryuhei Uehara
Lecture Notes in Computer Science, 1335, 333-341, 1997
A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems.
Ryuhei Uehara
Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, 333-341, 1997
Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions.
Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
Computational Learning Theory, Third European Conference, EuroCOLT '97, Jerusalem, Israel, March 17-19, 1997, Proceedings, 171-184, 1997
Optimal attribute-efficient learning of disjunction, parity, and threshold functions
Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
Electronic Colloquium on Computational Complexity (ECCC), 3, 61, -, 1996
Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application.
Ryuhei Uehara, Zhi-Zhong Chen, Xin He
Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings, 209-218, 1996
EFFICIENT SIMULATIONS BY A BIASED COIN
R UEHARA
INFORMATION PROCESSING LETTERS, 56, 5, 245-248, 1995
log(k)nの領域強構成可能性について
上原隆平
電子情報通信学会技術研究報告, 93, 139, 59-, 1993
Generalized Hi-Q is NP-Complete
UEHARA Ryuhei, IWATA Shigeki
The TRANSACTIONS of the IEICE, E73, 2, 270-273, 1990