Ryuuhei Uehara Professor
School of Information Science（Department of Information Science・Theoretical Information Science）

Results 1-20 of about 115

• 1.　Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane，Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo Silveira, Ryuhei Uehara, Birgit Vogtenhuber and Emo Welzl，The 25th Canadian Conference on Computational Geometry (CCCG 2013) , 2013/08/08-2013/08/10
• 2.　Zipper Unfoldability of Domes and Prismoids，Erik D. Demaine, Martin Demaine and Ryuhei Uehara，The 25th Canadian Conference on Computational Geometry (CCCG 2013) , 2013/08/08-2013/08/10
• 3.　Computational complexity and an integer programming model of Shakashaka，Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara and Yushi Uno，The 25th Canadian Conference on Computational Geometry (CCCG 2013) , 2013/08/08-2013/08/10
• 4.　Variations on Instant Insanity，Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, and Ryuhei Uehara，Conference on Space Efficient Data Structures, Streams and Algorithms, 2013/08/15-2013/08/16
• 5.　Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression，Takeaki Uno, Ryuhei Uehara, and Shin-ichi Nakano，Discrete Mathematics, Algorithms and Applications (DMAA), accepted, 2013
• 6.　Base location problems for base-monotone regions，Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno，7th International Workshop on Algorithms and Computation (WALCOM 2013), accepted, 2013
• 7.　Common Developments of Three Incongruent Orthogonal Boxes，Toshihiro Shirakawa and Ryuhei Uehara，International Journal of Computational Geometry and Applications, accepted, 2013
• 8.　Route-Enabling Graph Orientation Problems，Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, and Ryuhei Uehara，Algorithmica, 2013，Vol. 65，pp. 317-338
• 9.　Common Developments of Three Different Orthogonal Boxes，Toshihiro Shirakawa and Ryuhei Uehara，The 24th Canadian Conference on Computational Geometry (CCCG 2012), accepted, 2012/8/8-10
• 10.　Covering points with disjoint unit disks，Greg Aloupis, Robert Hearn, Hirokazu Iwasawa and Ryuhei Uehara，The 24th Canadian Conference on Computational Geometry (CCCG 2012), accepted, 2012/8/8-10
• 11.　Packing Trominoes is NP-Complete, #P-hard and ASP-Complete，Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara，The 24th Canadian Conference on Computational Geometry (CCCG 2012), accepted, 2012/8/8-10
• 12.　On bipartite powers of bigraphs，Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara，Discrete Mathematics and Theoretical Computer Science，14，2，11-20，2012/7/16
• 13.　Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs，Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara，IEICE Trans. Inf. & Syst., accepted, 2012
• 14.　Tractabilities and Intractabilities on Geometric Intersection Graphs，Ryuhei Uehara，Algorithms，6，60-83，2013
• 15.　Efficient algorithms for a simple network design problem，Shin-ichi Nakano, Ryuhei Uehara, and Takeaki Uno，Networks, accepted, 2013
• 16.　Faster computation of the Robinson-Foulds distance between phylogenetic networks，Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente，Information Science, Vol 197, 2012，pp. 77-90
• 17.　Algorithms for Computing Optimal Image Segmentation using Quadtree Decomposition，Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno，Thailand-Japan Joint Conference on Computational Geometry and Graphs, 2012/12/06-08
• 18.　A 4.31-Approximation for the Geometic Unique Coverage Problem on Unit Disks，Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno，23rd Annual International Symposium on Algorithms and Computation，LNCS Vol. 7676，pp. 372-381，2012/12/19-21
• 19.　Ghost Chimneys，David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, and Ryuhei Uehara，International Journal of Computational Geometry and Applications，22，3，207-214
• 20.　Computation of the Robinson-Foulds Distance between Phylogenetic Networks，Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente，Information Sciences, accepted

1  2  3  4  5  6

[ Next ≫ ]