Ryuhei Uehara

Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara: Route-Enabling Graph Orientation Problems. Algorithmica 65(2): 317-338 (2013)

Ryuhei Uehara: Tractabilities and Intractabilities on Geometric Intersection Graphs. Algorithms 6(1): 60-83 (2013)

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs. IEICE Transactions 96-D(3): 426-432 (2013)

Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara: Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013)

Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno: Base Location Problems for Base-Monotone Regions. WALCOM 2013: 53-64

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Any Monotone Function Is Realized by Interlocked Polygons. Algorithms 5(1): 148-157 (2012)

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Bipartite Permutation Graphs are reconstructible. Discrete Math., Alg. and Appl. 4(3) (2012)

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara: On bipartite powers of bigraphs. Discrete Mathematics & Theoretical Computer Science 14(2): 11-20 (2012)

David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara: Ghost chimneys. Int. J. Comput. Geometry Appl. 22(3): 207-214 (2012)

Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente: Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197: 77-90 (2012)

Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara: Random generation and enumeration of bipartite permutation graphs. J. Discrete Algorithms 10: 84-97 (2012)

Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: NP-completeness of generalized Kaboozle. JIP 20(3): 713-718 (2012)

Toshihiro Shirakawa, Ryuhei Uehara: Common Developments of Three Different Orthogonal Boxes. CCCG 2012: 17-22

Greg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara: Covering Points with Disjoint Unit Disks. CCCG 2012: 41-46

Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara: Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. CCCG 2012: 211-216

Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno: A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC 2012: 372-381

Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno: A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT 2012: 24-35

Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano: Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. WALCOM 2012: 5-16

Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno: On Complexity of Flooding Games on Graphs with Interval Representations. CoRR abs/1206.6201 (2012)

Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno: Algorithmic Folding Complexity. Graphs and Combinatorics 27(3): 341-351 (2011)

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Voronoi Game on a Path. IEICE Transactions 94-D(6): 1185-1189 (2011)

Sandip Das, Ryuhei Uehara: Guest Editor's Foreword. J. Graph Algorithms Appl. 15(3): 319-321 (2011)

Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara: The Voronoi game on graphs and its complexity. J. Graph Algorithms Appl. 15(4): 485-501 (2011)

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. J. Graph Algorithms Appl. 15(6): 727-751 (2011)

Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12-14): 1054-1065 (2011)

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara: Common Developments of Several Different Orthogonal Boxes. CCCG 2011

Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara: On covering of any point configuration by disjoint unit disks. CCCG 2011

Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito: Complexity of the Stamp Folding Problem. COCOA 2011: 311-321

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC 2011: 452-462

Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara: Random Generation and Enumeration of Proper Interval Graphs. IEICE Transactions 93-D(7): 1816-1823 (2010)

Colin Cooper, Ryuhei Uehara: Scale Free Properties of Random k-Trees. Mathematics in Computer Science 3(4): 489-496 (2010)

Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada: Efficient enumeration of all ladder lotteries and its application. Theor. Comput. Sci. 411(16-18): 1714-1722 (2010)

Yasuko Matsui, Ryuhei Uehara, Takeaki Uno: Enumeration of the perfect sequences of a chordal graph. Theor. Comput. Sci. 411(40-42): 3635-3641 (2010)

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Reconstruction of interval graphs. Theor. Comput. Sci. 411(43): 3859-3866 (2010)

David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara: Ghost chimneys. CCCG 2010: 63-66

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Any monotone boolean function can be realized by interlocked polygons. CCCG 2010: 139-142

Ryuhei Uehara: On stretch minimization problem on unit strip paper. CCCG 2010: 223-226

Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara: Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Bipartite Permutation Graphs Are Reconstructible. COCOA (2) 2010: 362-373

Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente: Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM 2010: 190-201

Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara: Kaboozle Is NP-complete, Even in a Strip. FUN 2010: 28-36

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: UNO Is Hard, Even for a Single Player. FUN 2010: 133-144

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Reconstruction Algorithm for Permutation Graphs. WALCOM 2010: 125-135

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: The complexity of UNO. CoRR abs/1003.2851 (2010)

Ryuhei Uehara, Yushi Uno: Laminar structure of ptolemaic graphs with applications. Discrete Applied Mathematics 157(7): 1533-1543 (2009)

Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. J. Comput. Sci. Technol. 24(3): 517-533 (2009)

Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe: Scale free interval graphs. Theor. Comput. Sci. 410(45): 4588-4600 (2009)

Yoshio Okamoto, Ryuhei Uehara: How to make a picturesque maze. CCCG 2009: 137-140

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Reconstruction of Interval Graphs. COCOON 2009: 106-115

Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara: Route-Enabling Graph Orientation Problems. ISAAC 2009: 403-412

Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara: Algorithmic Folding Complexity. ISAAC 2009: 452-461

Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara: Random Generation and Enumeration of Bipartite Permutation Graphs. ISAAC 2009: 1104-1113

Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara: Random Generation and Enumeration of Proper Interval Graphs. WALCOM 2009: 177-189

Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. WG 2009: 296-307

Sandip Das, Ryuhei Uehara (Eds.): WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5431, Springer 2009, isbn 978-3-642-00201-4

Yoshihiro Takahara, Sachio Teramoto, Ryuhei Uehara: Longest Path Problems on Ptolemaic Graphs. IEICE Transactions 91-D(2): 170-177 (2008)

Ryuhei Uehara: Special Section on Discrete Mathematics and Its Applications. IEICE Transactions 91-A(9): 2283 (2008)

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2): 229-242 (2008)

Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe: Scale Free Interval Graphs. AAIM 2008: 292-303

Youichi Fujimoto, Mitsuo Motoki, Ryuhei Uehara: Inverting Linkages with Stretch. CCCG 2008

Ryuhei Uehara: Polygons Folding to Plural Incongruent Orthogonal Boxes. CCCG 2008

Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno: On the Complexity of Reconfiguration Problems. ISAAC 2008: 28-39

Ryuhei Uehara: Bandwidth of Bipartite Permutation Graphs. ISAAC 2008: 824-835

Yasuko Matsui, Ryuhei Uehara, Takeaki Uno: Enumeration of Perfect Sequences of Chordal Graph. ISAAC 2008: 859-870

Ryuhei Uehara: Simple Geometrical Intersection Graphs. WALCOM 2008: 25-33

Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47(1): 27-51 (2007)

Ryuhei Uehara, Yushi Uno: On Computing Longest Paths in Small Graph Classes. Int. J. Found. Comput. Sci. 18(5): 911-930 (2007)

Ryuhei Uehara, Gabriel Valiente: Linear structure of bipartite permutation graphs and the longest path problem. Inf. Process. Lett. 103(2): 71-77 (2007)

Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC 2007: 115-127

Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: Efficient Algorithms for Airline Problem. TAMC 2007: 428-439

Ryuhei Uehara, Sachio Teramoto: The Complexity of a Pop-Up Book. CCCG 2006

Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara: Voronoi game on graphs and its complexity. CIG 2006: 265-271

Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discrete Applied Mathematics 145(3): 479-482 (2005)

Ryuhei Uehara, Yushi Uno: Laminar Structure of Ptolemaic Graphs and Its Applications. ISAAC 2005: 186-195

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG 2005: 433-444

Peisen Zhang, Huitao Sheng, Ryuhei Uehara: A double classification tree search algorithm for index SNP selection. BMC Bioinformatics 5: 89 (2004)

Ryuhei Uehara: Canonical Data Structure for Interval Probe Graphs. ISAAC 2004: 859-870

Ryuhei Uehara, Yushi Uno: Efficient Algorithms for the Longest Path Problem. ISAAC 2004: 871-883

Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118

Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang: Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108

Ryuhei Uehara: Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. ICALP 2002: 993-1004

Ryuhei Uehara, Zhi-Zhong Chen: Parallel approximation algorithms for maximum weighted matching in general graphs. Inf. Process. Lett. 76(1-2): 13-17 (2000)

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener: Identification of Partial Disjunction, Parity, and Threshold Functions. Theor. Comput. Sci. 230(1-2): 131-147 (2000)

Ryuhei Uehara, Zhi-Zhong Chen: Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. IFIP TCS 2000: 84-98

Ryuhei Uehara: A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits. Int. J. Found. Comput. Sci. 10(4): 473-482 (1999)

Ryuhei Uehara, Zhi-Zhong Chen, Xin He: Fast RNC and NC Algorithms for Maximal Path Sets. Theor. Comput. Sci. 215(1-2): 89-98 (1999)

Ryuhei Uehara: Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph. ISPAN 1999: 350-355

Ryuhei Uehara: Collapse of PP with a Semi-Random Source to BPP. Inf. Process. Lett. 61(2): 83-87 (1997)

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener: Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions. EuroCOLT 1997: 171-184

Ryuhei Uehara: A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. WG 1997: 333-341

Ryuhei Uehara, Zhi-Zhong Chen, Xin He: Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. COCOON 1996: 209-218

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener: Optimal attribute-efficient learning of disjunction, parity, and threshold functions. Electronic Colloquium on Computational Complexity (ECCC) 3(61) (1996)

Ryuhei Uehara: Efficient Simulations by a Biased Coin. Inf. Process. Lett. 56(5): 245-248 (1995)