Ryuhei Uehara

Citata da

	Tutte	Dal 2020
Citazioni	3113	1267
Indice H	28	15
i10-index	83	31

280

140

210

199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202510 20 12 11 17 18 23 17 36 47 42 93 81 90 113 113 139 155 197 186 190 200 222 279 214 250 266 35

Accesso pubblico

Visualizza tutto

20 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail verificata su mit.edu
Takeaki UnoNational Institute of Informatics, JapanEmail verificata su nii.jp
Yota OtachiNagoya UniversityEmail verificata su nagoya-u.jp
Toshiki SaitohKyushu Institute of TechnologyEmail verificata su ces.kyutech.ac.jp
Martin DemaineMITEmail verificata su mit.edu
Yoshio OkamotoUniversity of Electro-CommunicationsEmail verificata su uec.ac.jp
Shinichi NakanoProfessor of Computer Science, Gunma UniversityEmail verificata su gunma-u.ac.jp
Masashi KiyomiSeikei UniversityEmail verificata su st.seikei.ac.jp
Hirotaka OnoNagoya University, JapanEmail verificata su i.nagoya-u.ac.jp
Duc A. HoangUniversity of Science, Vietnam National University, HanoiEmail verificata su vnu.edu.vn
Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaEmail verificata su cs.ubc.ca
Hiro ItoEmail verificata su uec.ac.jp
Eli Fox-EpsteinGoogleEmail verificata su google.com
Tomohiro TachiProfessor, University of TokyoEmail verificata su idea.c.u-tokyo.ac.jp
Tetsuo AsanoProfessor of School of Information Science, JAISTEmail verificata su jaist.ac.jp
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooEmail verificata su uwaterloo.ca
Yasuko MatsuiTokai UniversityEmail verificata su tokai-u.jp
Adam HesterbergHarvard SEASEmail verificata su seas.harvard.edu
Giovanni VigliettaAssociate Professor, University of AizuEmail verificata su u-aizu.ac.jp
Christos H PAPADIMITRIOUColumbia UniversityEmail verificata su columbia.edu

Segui

Ryuhei Uehara

Japan Advanced Institute of Science and Technology

Email verificata su jaist.ac.jp - Home page

computational complexity computational geometry graph algorithm games and puzzles computational origami


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	339	2011
Efficient algorithms for the longest path problem R Uehara, Y Uno International symposium on algorithms and computation, 871-883, 2004	113	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	86	2005
Voronoi game on graphs and its complexity S Teramoto, ED Demaine, R Uehara 2006 IEEE Symposium on Computational Intelligence and Games, 265-271, 2006	66	2006
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	65	2015
Generalized Hi-Q is NP-complete R Uehara, S Iwata IEICE TRANSACTIONS (1976-1990) 73 (2), 270-273, 1990	64	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	63	2007
Counting the number of independent sets in chordal graphs Y Okamoto, T Uno, R Uehara Journal of Discrete Algorithms 6 (2), 229-242, 2008	60	2008
Linear structure of bipartite permutation graphs and the longest path problem R Uehara, G Valiente Information Processing Letters 103 (2), 71-77, 2007	56	2007
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	54	2014
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	51*	2000
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	51	1996
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	50	1997
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	46	2014
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	44	1996
Computational complexity and an integer programming model of Shakashaka ED Demaine, Y Okamoto, R Uehara, Y Uno IEICE Transactions on Fundamentals of Electronics, Communications and …, 2014	43	2014
Tree spanners for bipartite graphs and probe interval graphs A Brandstadt, FF Dragan, HO Le, VB Le, R Uehara Algorithmica 47, 27-51, 2007	43*	2007
Sliding token on bipartite permutation graphs E Fox-Epstein, DA Hoang, Y Otachi, R Uehara Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya …, 2015	41	2015
UNO is hard, even for a single player ED Demaine, ML Demaine, NJA Harvey, R Uehara, T Uno, Y Uno Theoretical Computer Science 521, 51-61, 2014	38*	2014
Laminar structure of ptolemaic graphs with applications R Uehara, Y Uno Discrete applied mathematics 157 (7), 1533-1543, 2009	37*	2009

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori