The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ryuhei Uehara: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:105-108 [Conf]
  2. Ryuhei Uehara, Zhi-Zhong Chen, Xin He
    Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:209-218 [Conf]
  3. Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
    Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:171-184 [Conf]
  4. Ryuhei Uehara
    Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:993-1004 [Conf]
  5. Ryuhei Uehara, Zhi-Zhong Chen
    Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:84-98 [Conf]
  6. Ryuhei Uehara
    Canonical Data Structure for Interval Probe Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:859-870 [Conf]
  7. Ryuhei Uehara, Yushi Uno
    Efficient Algorithms for the Longest Path Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:871-883 [Conf]
  8. Ryuhei Uehara, Yushi Uno
    Laminar Structure of Ptolemaic Graphs and Its Applications. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:186-195 [Conf]
  9. Ryuhei Uehara
    Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1999, pp:350-355 [Conf]
  10. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
    Tree Spanners for Bipartite Graphs and Probe Interval Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:106-118 [Conf]
  11. Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
    Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:433-444 [Conf]
  12. Ryuhei Uehara
    A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:333-341 [Conf]
  13. Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
    Voronoi game on graphs and its complexity. [Citation Graph (0, 0)][DBLP]
    CIG, 2006, pp:265-271 [Conf]
  14. Peisen Zhang, Huitao Sheng, Ryuhei Uehara
    A double classification tree search algorithm for index SNP selection. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2004, v:5, n:, pp:89- [Journal]
  15. Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya
    Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:3, pp:479-482 [Journal]
  16. Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
    Optimal attribute-efficient learning of disjunction, parity, and threshold functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:61, pp:- [Journal]
  17. Ryuhei Uehara
    A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:473-482 [Journal]
  18. Ryuhei Uehara
    Efficient Simulations by a Biased Coin. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:5, pp:245-248 [Journal]
  19. Ryuhei Uehara
    Collapse of PP with a Semi-Random Source to BPP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:2, pp:83-87 [Journal]
  20. Ryuhei Uehara, Zhi-Zhong Chen
    Parallel approximation algorithms for maximum weighted matching in general graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:13-17 [Journal]
  21. Ryuhei Uehara, Gabriel Valiente
    Linear structure of bipartite permutation graphs and the longest path problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:2, pp:71-77 [Journal]
  22. Ryuhei Uehara, Zhi-Zhong Chen, Xin He
    Fast RNC and NC Algorithms for Maximal Path Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:89-98 [Journal]
  23. Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
    Identification of Partial Disjunction, Parity, and Threshold Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:230, n:1-2, pp:131-147 [Journal]
  24. Ryuhei Uehara, Sachio Teramoto
    The Complexity of a Pop-Up Book. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  25. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
    A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:115-127 [Conf]
  26. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
    Efficient Algorithms for Airline Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:428-439 [Conf]
  27. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
    Tree Spanners for Bipartite Graphs and Probe Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:1, pp:27-51 [Journal]

  28. Scale Free Interval Graphs. [Citation Graph (, )][DBLP]


  29. Inverting Linkages with Stretch. [Citation Graph (, )][DBLP]


  30. Polygons Folding to Plural Incongruent Orthogonal Boxes. [Citation Graph (, )][DBLP]


  31. On stretch minimization problem on unit strip paper. [Citation Graph (, )][DBLP]


  32. Any monotone boolean function can be realized by interlocked polygons. [Citation Graph (, )][DBLP]


  33. Ghost chimneys. [Citation Graph (, )][DBLP]


  34. How to make a picturesque maze. [Citation Graph (, )][DBLP]


  35. Reconstruction of Interval Graphs. [Citation Graph (, )][DBLP]


  36. Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. [Citation Graph (, )][DBLP]


  37. Route-Enabling Graph Orientation Problems. [Citation Graph (, )][DBLP]


  38. Enumeration of Perfect Sequences of Chordal Graph. [Citation Graph (, )][DBLP]


  39. Bandwidth of Bipartite Permutation Graphs. [Citation Graph (, )][DBLP]


  40. Random Generation and Enumeration of Bipartite Permutation Graphs. [Citation Graph (, )][DBLP]


  41. On the Complexity of Reconfiguration Problems. [Citation Graph (, )][DBLP]


  42. Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. [Citation Graph (, )][DBLP]


  43. Random Generation and Enumeration of Proper Interval Graphs. [Citation Graph (, )][DBLP]


  44. Reconstruction Algorithm for Permutation Graphs. [Citation Graph (, )][DBLP]


  45. Simple Geometrical Intersection Graphs. [Citation Graph (, )][DBLP]


  46. UNO Is Hard, Even for a Single Player. [Citation Graph (, )][DBLP]


  47. Kaboozle Is NP-complete, Even in a Strip. [Citation Graph (, )][DBLP]


  48. The complexity of UNO [Citation Graph (, )][DBLP]


  49. Laminar structure of ptolemaic graphs with applications. [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.028secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002