Yoshio Okamoto - Google Scholar Citations

Cited by

	All	Since 2014
Citations	1123	669
h-index	18	13
i10-index	36	20

140

105

200320042005200620072008200920102011201220132014201520162017201820194 13 25 29 17 50 46 51 54 54 85 82 100 113 108 135 128

Co-authors

Takeaki UnoNational Institute of Informatics, JapanVerified email at nii.jp
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyVerified email at jaist.ac.jp
Yota OtachiKumamoto UniversityVerified email at cs.kumamoto-u.ac.jp
Matias KormanTufts UniversityVerified email at dais.is.tohoku.ac.jp
Michael HoffmannETH ZürichVerified email at inf.ethz.ch
Alexander WolffChair for Efficient Algorithms, Institute of Computer Science, University of WürzburgVerified email at uni-wuerzburg.de
Sang Won BaeKyonggi UniversityVerified email at kgu.ac.kr
Martin NöllenburgAssociate Professor, Algorithms and Complexity Group, TU WienVerified email at ac.tuwien.ac.at
Shinichi NakanoProfessor of Computer Science, Gunma UniversityVerified email at cs.gunma-u.ac.jp
Kevin BuchinAssociate Professor of Computer Science, Technical University EindhovenVerified email at tue.nl
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Rodrigo I. SilveiraUniversitat Politècnica de CatalunyaVerified email at upc.edu
Jarek ByrkaUniversity of WroclawVerified email at cs.uni.wroc.pl
Maike BuchinRuhr-Universität BochumVerified email at rub.de
Naonori KakimuraKeio UniversityVerified email at math.keio.ac.jp
Koichi YamazakiGunma UniversityVerified email at cs.gunma-u.ac.jp
Chan-Su Shin (신찬수)Professor of Division of Computer and Electronic Systems, Hankuk University of Foreign StuidesVerified email at hufs.ac.kr
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Holger DellIT University of CopenhagenVerified email at itu.dk
Dániel MarxInstitute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)Verified email at cs.bme.hu

Yoshio Okamoto

University of Electro-Communications

Verified email at uec.ac.jp - Homepage

Algorithms Combinatorial Optimization Graph Algorithms Discrete and Computational Geometry Computational Geometry


Title	Cited by	Year
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), 41, 2016	145	2016
Counting the number of independent sets in chordal graphs Y Okamoto, T Uno, R Uehara Journal of Discrete Algorithms 6 (2), 229-242, 2008	63*	2008
Swapping labeled tokens on graphs K Yamanaka, ED Demaine, T Ito, J Kawahara, M Kiyomi, Y Okamoto, ... Theoretical Computer Science 586, 81-94, 2015	48	2015
The traveling salesman problem with few inner points VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger Operations Research Letters 34 (1), 106-110, 2006	45*	2006
Drawing (complete) binary tanglegrams K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, RI Silveira, ... Algorithmica 62 (1-2), 309-332, 2012	44*	2012
The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto Computational Geometry 34 (3), 149-158, 2006	42	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 Research Report B-453, Dept. of Math. and Comp. Sci. Japan, Tech. Rep., 152-8552, 2009	33*	2009
Core stability of minimum coloring games T Bietenhader, Y Okamoto Mathematics of Operations Research 31 (2), 418-431, 2006	33	2006
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	32	2009
Fair cost allocations under conflicts—a game-theoretic point of view— Y Okamoto Discrete Optimization 5 (1), 1-18, 2008	32*	2008
Submodularity of some classes of the combinatorial optimization games Y Okamoto Mathematical Methods of Operations Research 58 (1), 131-139, 2003	27	2003
The affine representation theorem for abstract convex geometries K Kashiwabara, M Nakamura, Y Okamoto Computational Geometry 30 (2), 129-144, 2005	25	2005
Approximation and hardness for token swapping T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno arXiv preprint arXiv:1602.05150, 2016	24	2016
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	19	2014
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	19*	2014
The geodesic diameter of polygonal domains SW Bae, M Korman, Y Okamoto Discrete & Computational Geometry 50 (2), 306-329, 2013	19	2013
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs Y Otachi, Y Okamoto, K Yamazaki Discrete Applied Mathematics 155 (17), 2383-2390, 2007	19	2007
Improved bounds for wireless localization T Christ, M Hoffmann, Y Okamoto, T Uno Algorithmica 57 (3), 499-516, 2010	18	2010
How to make a picturesque maze Y Okamoto, R Uehara 21st Annual Canadian Conference on Computational Geometry, 137-140, 2009	18	2009
08431 Open Problems--Moderately Exponential Time Algorithms FV Fomin, K Iwama, D Kratsch, P Kaski, M Koivisto, L Kowalik, Y Okamoto, ... Dagstuhl Seminar Proceedings, 2008	18*	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors