Refereed International Conferences

  1. Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno: Bounding the number of reduced trees, cographs, and series-parallel graphs by compression, Workshop on Algorithms and Computation (WALCOM 2012), Lecture Notes in Computer Science, accepted, 2012/2/15-17.
  2. Toshihiro Shirakawa, Takashi Horiyama,and Ryuhei Uehara: On Common Unfolding of a Regular Tetrahedron and a Cube, Japan Conference on Discrete and Computational Geometry (JCDCG 2011), accepted, 2011/11/28-29.
  3. Yosuke Okayama, Masashi Kiyomi and Ryuhei Uehara: On covering of any point configuration by disjoint unit disks, The 23rd Canadian Conference on Computational Geometry (CCCG' 11), pp. 393-397, 2011/8/10-12. JAIST Repository
  4. Zachary Abel, Erik Demaine, Martin Demaine, Hiroaki Matsui, Guenter Rote and Ryuhei Uehara: Common Developments of Several Different Orthogonal Boxes, The 23rd Canadian Conference on Computational Geometry (CCCG' 11), pp. 77-82, 2011/8/10-12. JAIST Repository
  5. Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, and Hiro Ito: Complexity of the stamp folding problem, 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA '11), Lecture Notes in Computer Science, Vol. 6831, pp. 311-321, 2011/8/4-6.
  6. Hiroyuki Fukuki, Akihiro Nakanishi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno: The Complexity of Free Flood Filling Game, 14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011), pp. 51-56, 2011/7/8-9.
  7. Ryuhei Uehara: On Common Developments of Several Different Polyhedra (Invited Talk), 14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011), pp. 159-163, 2011/7/8-9.
  8. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara and Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem, 8th Annual Conference on Theory and Applications of Medels of Computation (TAMC 2011), Lecture Notes in Computer Science, Vol. 6648, pp. 452-462, 2011/5/23-25, JAIST Repository
  9. Arata Goto and Ryuhei Uehara: On the generalized Hoffman puzzle, 4th Asian Association for Algorithms and Computation (AAAC 2011), p. 38, 2011/4/16-17.
  10. Toshihiro Shirakawa, Takashi Horiyama,and Ryuhei Uehara: Construct of Common Development of Regular Tetrahedron and Cube, 27th European Workshop on Computational Geometry (EuroCG 2011), pp. 47-50, 2011/3/28-30, JAIST Repository
  11. 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: Coverage with k-Transmitters in the Presence of Obstacles, 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) , Lecture Notes in Computer Science, Vol. 6509, pp. 1-15, 2010/12/18-20.
  12. Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara: Bipartite Permutation Graphs are Reconstructible, 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) , Lecture Notes in Computer Science, Vol. 6509, pp. 362-373, 2010/12/18-20.
  13. Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara: Bipartite Powers of Interval Bigraphs, China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010) , accepted, 2010/11/03-06.
  14. Ryuhei Uehara: Simple Undecidable Problem on Origami, China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010) , accepted, 2010/11/03-06.
  15. Takashi Horiyama and Ryuhei Uehara: Nonexistence of Common Edge Developments of Regular Tetrahedron and Other Platonic Solids, China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010) , accepted, 2010/11/03-06.
  16. Ryuhei Uehara: On Stretch Minimization Problem on Unit Strip Paper, 22nd Canadian Conference on Computational Geometry (CCCG 2010) , pp. 223-226, 2010/8/9-11.
  17. David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Pat Morin, and Ryuhei Uehara: Ghost Chimneys, 22nd Canadian Conference on Computational Geometry (CCCG 2010) , pp. 63-66, 2010/8/9-11.
  18. Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara: Any Monotone Function is Realized by Interlocked Polygons, 22nd Canadian Conference on Computational Geometry (CCCG 2010) , pp. 139-142, 2010/8/9-11.
  19. Ryuhei Uehara: Stretch Minimization Problem of a Strip Paper, 5th International Conference on Origami in Science, Mathematics and Education (5OSME), 2010/7/13-17.
  20. Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente: Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks, 21st Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 6129, pp. 190-201, 2010/6/21-23, JAIST Repository
  21. Tetsuo Asano, Erik Demaine, Martin Demaine, and Ryuhei Uehara: Kaboozle is NP-complete, even in a Strip Form, 5th International Conference on FUN WITH ALGORITHMS, Lecture Notes in Computer Science Vol. 6099, pp. 28-36, 2010/6/2-4, JAIST Repository
  22. Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, and Yushi Uno: UNO is hard, even for a single player, 5th International Conference on FUN WITH ALGORITHMS, Lecture Notes in Computer Science Vol. 6099, pp. 133-144, 2010/6/2-4. (Technical Report is avairable at CoRR arXiv:1003.2851.)
  23. Akihiro Nakanishi, Toshiki Saitoh, Masashi Kiyomi and Ryuhei Uehara: Fast Algorithm for the Bandwidth Problem of Bipartite Permutation Graphs, 3rd Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2010), pp. 35, 2010/4/17-19.
  24. Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara: Reconstruction Algorithm for Permutation Graphs, 4th Annual Workshop on Algorithms and Computation (WALCOM 2010), Lecture Notes in Computer Science Vol. 5942, pp. 125-135, 2010/2/10-12.
  25. Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, and Ryuhei Uehara: Random Generation and Enumeration of Bipartite Permutation Graphs, 20th International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science Vol. 5868, pp. 1104-1113, 2009/12/18.
  26. Jean Cardinal, Erik Demaine, Martin Demaine, Shinji Imahori, Stefan Langerman and Ryuhei Uehara: Algorithmic Folding Complexity, 20th International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science Vol. 5868, pp. 452-461, 2009/12/16.
  27. Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, and Ryuhei Uehara: Route-Enabling Graph Orientation Problems, 20th International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science Vol. 5868, pp. 403-412, 2009/12/16.
  28. Jean Cardinal, Erik Demaine, Martin Demaine, Shinji Imahori, Stefan Langerman and Ryuhei Uehara: Algorithmic Folding Complexity (Extended Abstract), 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), pp. 143-144, 2009/11/13.
  29. Yoshio Okamoto and Ryuhei Uehara: How to make a picturesque maze, 21st Canadian Conference on Computational Geometry (CCCG 2009), pp. 137-140, 2009/8/18.
  30. Masashi Kiyomi, Toshiki Saitoh and Ryuhei Uehara: Reconstruction of Interval Graphs, 15th Annual International Computing and Combinatorics Conference (COCOON 2009), Lecture Notes in Computer Science Vol. 5609, pp. 106-115, 2009/7/13.
  31. Yoshio Okamoto, Ryuhei Uehara and Takeaki Uno: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes, 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), Lecture Notes in Computer Science Vol. 5911, pp. 296-307, 2009/6/26.
  32. Tsuyoshi Ito, Masashi Kiyomi, Shinji Imahori and Ryuhei Uehara: Complexity of pleats folding, 25th European Workshop on Computational Geometry (EuroCG '09), pp. 143-146, 2009/3/17.
  33. Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada: Efficient Enumeration of All Pseudoline Arrangements, 25th European Workshop on Computational Geometry (EuroCG '09) , pp. 53-56, 2009/3/16.
    [Note] Our algorithm in the paper updates some data on The On-Line Encyclopedia of Integer Sequences.
  34. Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi and Ryuhei Uehara: Random Generation and Enumeration of Proper Interval Graphs, 3rd Annual Workshop on Algorithms and Computation (WALCOM 2009) , Lecture Notes in Computer Science Vol. 5431, pp. 177-189, 2009/2/20.
  35. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, and Yushi Uno: On the Complexity of Reconfiguration Problems, 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science Vol. 5369, pp. 28-39, 2008/12.
  36. Yasuko Matsui, Ryuhei Uehara, Takeaki Uno: Enumeration of Perfect Sequences of Chordal Graph, 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science Vol. 5369, pp. 859-870, 2008/12.
  37. Ryuhei Uehara: Bandwidth of Bipartite Permutation Graphs, 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science Vol. 5369, pp. 824-835, 2008/12.
  38. Yoichi Fujimoto, Mitsuo Motoki, and Ryuhei Uehara: Inverting Linkages with Stretch, Canadian Conference on Computational Geometry (CCCG 2008), pp. 31-34, 2008/8/13. (Also presented at The First AAAC Annual Meeting (AAAC 08), 2008/4.)
  39. Jun Mitani and Ryuhei Uehara: Polygons Folding to Plural Incongruent Orthogonal Boxes, Canadian Conference on Computational Geometry (CCCG 2008), pp. 39-42, 2008/8/13. Support pages written in Japanese/ English are available.
  40. Naoto Miyoshi, Mariko Ogura, Takeya Shigezumi, and Ryuhei Uehara: Scale-free Interval Graphs Generated by Immigration-depth Processes, International Workshop on Applied Probability (IWAP 2008), 2008/7.
  41. Takeya Shigezumi, Naoto Miyoshi, Ryuhei Uehara, and Osamu Watanabe: Scale Free Interval Graphs, International Conference on Algorithmic Aspects in Information and Management (AAIM 2008), Lecture Notes in Computer Science Vol.5034, pp. 202-303, 2008/6. (Also presented at The First AAAC Annual Meeting (AAAC 08), 2008/4.)
  42. Ryuhei Uehara: Simple Geometrical Intersection Graphs (Invited Talk), Workshop on Algorithms and Computation (WALCOM 2008), Lecture Notes in Computer Science Vol. 4921, pp. 25-33, 2008/2.
  43. Toshiki Saitoh, Masashi Kiyomi, and Ryuhei Uehara: Simple Efficient Algorithm for MPQ-tree of an Interval Graph, KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC 2007), pp.121-126, 2007/8.
  44. Yoshihiro Takahara, Sachio Teramoto, and Ryuhei Uehara: Longest Path Problems on Ptolemaic Graphs, The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007) , 2007/6.
  45. Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno: Efficient Algorithms for Airline Problem, 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 07) , Lecture Notes in Computer Science Vol.4484, pp.428-439, 2007/5.
  46. Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs, 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 07) , Lecture Notes in Computer Science Vol.4484, pp.115-127, 2007/5.
  47. Ryuhei Uehara and Sachio Teramoto: Computational Complexity of a Pop-up book, 4th International Conference on Origami in Science, Mathematics, and Education (4OSME), Poster, 2006/9. PDF file (95586 bytes). Full paper appears pp. 295-304 in the proceedings published by A K Press in 2009.
  48. Ryuhei Uehara and Sachio Teramoto: The complexity of a Pop-up book, 18th Canadian Conference on Computational Geometry (CCCG 2006) , pp.3-6, 2006/8. PDF file (126431 bytes) (Note: the draft for 4OSME contains improved results.)
  49. Sachio Teramoto, Erik D. Demaine, and Ryuhei Uehara: Voronoi game on graphs and its complexity, 2nd IEEE Symposium on Computational Intelligence and Games (CIG 2006), pp.265-271, 2006/5. PDF file (132193 bytes).
  50. Ryuhei Uehara and Yushi Uno: Laminar Structure of Ptolemaic Graphs and Its Applications, 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), Lecture Notes in Computer Science Vol.3827, pp.186-195, 2005/12. PDF file (281249 bytes), DOI:10.1007/11602613_20
  51. Yoshio Okamoto, Takeaki Uno, and Ryuhei Uehara: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs, 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Lecture Notes in Computer Science Vol.3787, pp.433-444, 2005/6. PDF file (101546 bytes), DOI:10.1007/11604686_38
  52. Ryuhei Uehara: Canonical Data Structure for Interval Probe Graphs, 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004), Lecture Notes in Computer Science Vol.3341, pp.859-870, 2004/12. PDF file (284459 bytes), DOI:10.1007/b104582
  53. Ryuhei Uehara and Yushi Uno: Efficient Algorithms for the Longest Path Problem, 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004), Lecture Notes in Computer Science Vol.3341, pp.871-883, 2004/12. PDF file (231075 bytes), DOI:10.1007/b104582
  54. Andreas Brandstädt, Feodor F. Dragan, Hoang-Oanh Le, Van Bang Le, and Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs, 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), Lecture Notes in Computer Science Vol.2880, pp.106-118, 2003/6. PDF file (314069 bytes). DOI:10.1007/b93953
  55. Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, and Ming-wei Wang: Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles, 14th Canadian Conference on Computational Geometry (CCCG 2002), pp.105-108, 2002/8. See Erik's page for the detail.
  56. Ryuhei Uehara: Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs, 29th International Colloquium on Automata,Languages, and Programming (ICALP 2002), Lecture Notes in Computer Science Vol.2380, pp.993-1004, 2002/7. The PostScript file for the conference (76284 bytes, compressed by gzip) contains a serious bug; see Erratum for counterexample.
  57. Ryuhei Uehara and Zhi-Zhong Chen: Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs, IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), Lecture Notes in Computer Science Vol.1872, pp.84-98, 2000/8. PostScript file (75586 bytes, compressed by gzip).
  58. Ryuhei Uehara: Tractable Problems on Small Connected Components in Graphs, KOREA-JAPAN Joint Workshop on Algorithms and Computation, pp.116-122, 1999/7. PostScript file (51038 bytes, compressed by gzip).
  59. Ryuhei Uehara: Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph, International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN '99), pp.350-355, 1999/6. PostScript file (60183 bytes, compressed by gzip).
  60. Ryuhei Uehara: A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problem, 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG '97), Lecture Notes in Computer Science Vol.1335, pp.333-341, 1997/6. PostScript file (58098 bytes, compressed by gzip). DOI:10.1007/BFb0024508
  61. Ryuhei Uehara and Zhi-Zhong Chen: Parallel Algorithms for Maximal Linear Forests, Second Workshop on Randomized Parallel Computing of Eleventh International Parallel Processing Symposium (IPPS '97), 1997/4. PostScript file (75446 bytes, compressed by gzip).
  62. Ryuhei Uehara, Kensei Tsuchida, and Ingo Wegener: Optimal Attribute-Efficient Learning of Disjunction, Parity, and Threshold Functions, Third European Conference on Computational Learning Theory (EuroCOLT '97), Lecture Notes in Artificial Intelligence Vol.1208, pp 171-184, 1997/3. PostScript file (81206 bytes, compressed by gzip). DOI:10.1007/3-540-62685-9_15
  63. Ryuhei Uehara, Zhi-Zhong Chen, and Xin He: Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application, Second Annual International Computing and Combinatorics Conference (COCOON '96), Lecture Notes in Computer Science Vol.1090, pp 209-218, 1996/6. PostScript file (77507 bytes, compressed by gzip). DOI:10.1007/3-540-61332-3_154
Last modified: Sun Dec 19 17:29:56 JST 2010
by R.Uehara (uehara@jaist.ac.jp) 		Valid HTML 4.0!