Yoshio Okamoto

Citata da

	Tutte	Dal 2019
Citazioni	1890	890
Indice H	22	14
i10-index	52	25

180

135

20042005200620072008200920102011201220132014201520162017201820192020202120222023202412 28 31 22 48 41 53 55 60 72 79 96 113 111 149 121 136 146 142 165 177

Accesso pubblico

Visualizza tutto

26 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Takeaki UnoNational Institute of Informatics, JapanEmail verificata su nii.jp
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyEmail verificata su jaist.ac.jp
Yusuke KOBAYASHIKyoto UniversityEmail verificata su kurims.kyoto-u.ac.jp
Yota OtachiNagoya UniversityEmail verificata su nagoya-u.jp
Naonori KakimuraKeio UniversityEmail verificata su math.keio.ac.jp
Matias KormanSiemens EDAEmail verificata su mentor.com
Toshiki SaitohKyushu Institute of TechnologyEmail verificata su ces.kyutech.ac.jp
Michael HoffmannETH ZürichEmail verificata su inf.ethz.ch
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgEmail verificata su uni-wuerzburg.de
Masashi KiyomiSeikei UniversityEmail verificata su st.seikei.ac.jp
Shinichi NakanoProfessor of Computer Science, Gunma UniversityEmail verificata su gunma-u.ac.jp
Sang Won BaeKyonggi UniversityEmail verificata su kgu.ac.kr
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienEmail verificata su ac.tuwien.ac.at
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail verificata su mit.edu
Kevin BuchinProfessor of Computer Science, Technical University DortmundEmail verificata su tu-dortmund.de
Shuji KijimaShiga UniversityEmail verificata su biwako.shiga-u.ac.jp
Chan-Su Shin (신찬수)Professor of Division of Computer Engineering, Hankuk University of Foreign StuidesEmail verificata su hufs.ac.kr
André van RenssenUniversity of SydneyEmail verificata su sydney.edu.au
Rodrigo I. SilveiraUniversitat Politècnica de CatalunyaEmail verificata su upc.edu
Jarek ByrkaUniversity of WroclawEmail verificata su cs.uni.wroc.pl

Segui

Yoshio Okamoto

University of Electro-Communications

Email verificata su uec.ac.jp - Home page

Algorithms Combinatorial Optimization Graph Algorithms Discrete and Computational Geometry Computational Geometry


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
On problems as hard as CNF-SAT M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ... ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 2016	254	2016
Swapping labeled tokens on graphs K Yamanaka, ED Demaine, T Ito, J Kawahara, M Kiyomi, Y Okamoto, ... Theoretical Computer Science 586, 81-94, 2015	105	2015
Counting the number of independent sets in chordal graphs Y Okamoto, T Uno, R Uehara Journal of Discrete Algorithms 6 (2), 229-242, 2008	86*	2008
Approximation and hardness for token swapping T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno arXiv preprint arXiv:1602.05150, 2016	72	2016
Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tractability K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, RI Silveira, ... Algorithmica 62, 309-332, 2012	63	2012
The traveling salesman problem with few inner points VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger Operations Research Letters 34 (1), 106-110, 2006	61*	2006
The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto Computational Geometry 34 (3), 149-158, 2006	47	2006
User’s manual for SparseCoLO: Conversion methods for sparse conic-form linear optimization problems K Fujisawa, S Kim, M Kojima, Y Okamoto, M Yamashita Report B-453, Dept. of Math. and Comp. Sci. Japan, Tech. Rep, 152-8552, 2009	44*	2009
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	42	2014
Core stability of minimum coloring games T Bietenhader, Y Okamoto Mathematics of Operations Research 31 (2), 418-431, 2006	41	2006
Semantic word cloud representations: Hardness and approximation algorithms L Barth, SI Fabrikant, SG Kobourov, A Lubiw, M Nöllenburg, Y Okamoto, ... Latin American Symposium on Theoretical Informatics, 514-525, 2014	39	2014
Untangling a planar graph X Goaoc, J Kratochvíl, Y Okamoto, CS Shin, A Spillner, A Wolff Discrete & Computational Geometry 42 (4), 542-569, 2009	39	2009
Fair cost allocations under conflicts—a game-theoretic point of view— Y Okamoto Discrete Optimization 5 (1), 1-18, 2008	39*	2008
The affine representation theorem for abstract convex geometries K Kashiwabara, M Nakamura, Y Okamoto Computational Geometry 30 (2), 129-144, 2005	37	2005
Exact algorithms for the max-min dispersion problem T Akagi, T Araki, T Horiyama, S Nakano, Y Okamoto, Y Otachi, T Saitoh, ... International Workshop on Frontiers in Algorithmics, 263-272, 2018	32	2018
Submodular fractional programming for balanced clustering Y Kawahara, K Nagano, Y Okamoto Pattern Recognition Letters 32 (2), 235-243, 2011	32	2011
Submodularity of some classes of the combinatorial optimization games Y Okamoto Mathematical Methods of Operations Research 58 (1), 131-139, 2003	32	2003
The geodesic diameter of polygonal domains SW Bae, M Korman, Y Okamoto Discrete & Computational Geometry 50, 306-329, 2013	28	2013
Counting the number of matchings in chordal and chordal bipartite graph classes Y Okamoto, R Uehara, T Uno International Workshop on Graph-Theoretic Concepts in Computer Science, 296-307, 2009	26	2009
How to make a picturesque maze Y Okamoto, R Uehara 21st Annual Canadian Conference on Computational Geometry, 137-140, 2009	24	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