| 2011 |
|---|
| 18 | Algorithmic Folding Complexity. Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara, Stefan Langerman, Ryuhei Uehara, Takeaki Uno. Graphs and Combinatorics (27): 341-351 (2011). Web SearchBibTeXDownload |
| 17 | The Voronoi game on graphs and its complexity. Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara. J. Graph Algorithms Appl. (15): 485-501 (2011). Web SearchBibTeXDownload |
| 16 | Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. J. Graph Algorithms Appl. (15): 3-5 (2011). Web SearchBibTeXDownload |
| 15 | On the complexity of reconfiguration problems. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno. Theor. Comput. Sci. (412): 1054-1065 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 14 | Ghost chimneys. David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara. CCCG 2010, 63-66. Web SearchBibTeXDownload |
| 13 | Any monotone boolean function can be realized by interlocked polygons. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara. CCCG 2010, 139-142. Web SearchBibTeXDownload |
| 12 | Coverage with k-Transmitters in the Presence of Obstacles. 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. COCOA (2) 2010, 1-15. Web SearchBibTeXDownload |
| 11 | The complexity of UNO. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno. CoRR (abs/1003.2851) (2010). Web SearchBibTeXDownload |
| 10 | Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente. CPM 2010, 190-201. Web SearchBibTeXDownload |
| 9 | UNO Is Hard, Even for a Single Player. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno. FUN 2010, 133-144. Web SearchBibTeXDownload |
| 8 | Kaboozle Is NP-complete, Even in a Strip. Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara. FUN 2010, 28-36. Web SearchBibTeXDownload |
| 2009 |
|---|
| 7 | Route-Enabling Graph Orientation Problems. Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara. ISAAC 2009, 403-412. Web SearchBibTeXDownload |
| 6 | Algorithmic Folding Complexity. Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara, Stefan Langerman, Ryuhei Uehara, Takeaki Uno. ISAAC 2009, 452-461. Web SearchBibTeXDownload |
| 2008 |
|---|
| 5 | On the Complexity of Reconfiguration Problems. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno. ISAAC 2008, 28-39. Web SearchBibTeXDownload |
| 2007 |
|---|
| 4 | Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara. Algorithmica (47): 27-51 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 3 | Voronoi game on graphs and its complexity. Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara. CIG 2006, 265-271. Web SearchBibTeXDownload |
| 2003 |
|---|
| 2 | Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara. WG 2003, 106-118. Web SearchBibTeXDownload |
| 2002 |
|---|
| 1 | Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang. CCCG 2002, 105-108. Web SearchBibTeXDownload |
