Ryuhei Uehara
Citata da
Citata da
On the complexity of reconfiguration problems
T Ito, ED Demaine, NJA Harvey, CH Papadimitriou, M Sideri, R Uehara, ...
Theoretical Computer Science 412 (12-14), 1054-1065, 2011
Efficient algorithms for the longest path problem
R Uehara, Y Uno
International symposium on algorithms and computation, 871-883, 2004
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
R Uehara, S Toda, T Nagoya
Discrete Applied Mathematics 145 (3), 479-482, 2005
Generalized Hi-Q is NP-complete
R Uehara, S Iwata
IEICE TRANSACTIONS (1976-1990) 73 (2), 270-273, 1990
On computing longest paths in small graph classes
R Uehara, Y Uno
International Journal of Foundations of Computer Science 18 (05), 911-930, 2007
Optimal attribute-efficient learning of disjunction, parity, and threshold functions
R Uehara, K Tsuchida, I Wegener
European Conference on Computational Learning Theory, 171-184, 1997
NP-complete problems on a 3-connected cubic planar graph and their applications
R Uehara
Tokyo Woman's Christian University, Tokyo, Japan, Tech. Rep. TWCU-M-0004, 1996
Track (1) on Algorithms, Complexity and Models of Computation-Session 1.2-Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs
R Uehara, ZZ Chen
Lecture Notes in Computer Science 1872, 84-98, 2000
Counting the number of independent sets in chordal graphs
Y Okamoto, T Uno, R Uehara
Journal of Discrete Algorithms 6 (2), 229-242, 2008
Linear structure of bipartite permutation graphs and the longest path problem
R Uehara, G Valiente
Information Processing Letters 103 (2), 71-77, 2007
Method of managing data structure containing both persistent data and transient data
T Kurosawa, M Yoshimoto, S Shibayama, R Uehara
US Patent 5,504,895, 1996
Voronoi game on graphs and its complexity
S Teramoto, ED Demaine, R Uehara
2006 IEEE Symposium on Computational Intelligence and Games, 265-271, 2006
Depth-First Search Using Bits
T Asano, T Izumi, M Kiyomi, M Konagaya, H Ono, Y Otachi, P Schweitzer, ...
International Symposium on Algorithms and Computation, 553-564, 2014
Linear-time algorithm for sliding tokens on trees
ED Demaine, ML Demaine, E Fox-Epstein, DA Hoang, T Ito, H Ono, ...
Theoretical Computer Science 600, 132-142, 2015
Linear-time counting algorithms for independent sets in chordal graphs
Y Okamoto, T Uno, R Uehara
International Workshop on Graph-Theoretic Concepts in Computer Science, 433-444, 2005
A double classification tree search algorithm for index SNP selection
P Zhang, H Sheng, R Uehara
BMC bioinformatics 5 (1), 89, 2004
Tree spanners for bipartite graphs and probe interval graphs
A Brandstadt, FF Dragan, HO Le, R Uehara
Algorithmica 47 (1), 27-51, 2007
A new approach to graph recognition and applications to distance-hereditary graphs
S Nakano, R Uehara, T Uno
Journal of computer science and technology 24 (3), 517-533, 2009
On the parameterized complexity for token jumping on graphs
T Ito, M Kamiński, H Ono, A Suzuki, R Uehara, K Yamanaka
International Conference on Theory and Applications of Models of Computation …, 2014
Laminar structure of ptolemaic graphs with applications
R Uehara, Y Uno
Discrete applied mathematics 157 (7), 1533-1543, 2009
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20