Yoshio Okamoto

Cited by

	All	Since 2018
Citations	1606	755
h-index	21	13
i10-index	47	20

160

120

2004200520062007200820092010201120122013201420152016201720182019202020212022202310 28 34 23 47 38 55 55 57 77 77 98 116 108 153 126 140 145 138 47

Public access

View all

20 articles

0 articles

available

not available

Based on funding mandates

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 OtachiNagoya UniversityVerified email at nagoya-u.jp
Yusuke KOBAYASHIKyoto UniversityVerified email at kurims.kyoto-u.ac.jp
Matias KormanSiemens EDAVerified email at mentor.com
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgVerified email at uni-wuerzburg.de
Michael HoffmannETH ZürichVerified email at inf.ethz.ch
Masashi KiyomiSeikei UniversityVerified email at st.seikei.ac.jp
Naonori KakimuraKeio UniversityVerified email at math.keio.ac.jp
Shinichi NakanoProfessor of Computer Science, Gunma UniversityVerified email at gunma-u.ac.jp
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerified email at ac.tuwien.ac.at
Sang Won BaeKyonggi UniversityVerified email at kgu.ac.kr
Kevin BuchinProfessor of Computer Science, Technical University DortmundVerified email at tu-dortmund.de
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Shuji KijimaShiga UniversityVerified email at biwako.shiga-u.ac.jp
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
Chan-Su Shin (신찬수)Professor of Division of Computer Engineering, Hankuk University of Foreign StuidesVerified email at hufs.ac.kr
Koichi YamazakiTokyo Denki UniversityVerified email at mail.dendai.ac.jp

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 Sort by citations Sort by year Sort by title	Cited by 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), 1-24, 2016	218	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	86	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	82*	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	52	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	52	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	51*	2006
The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto Computational Geometry 34 (3), 149-158, 2006	48	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	43*	2009
Core stability of minimum coloring games T Bietenhader, Y Okamoto Mathematics of Operations Research 31 (2), 418-431, 2006	38	2006
Fair cost allocations under conflicts—a game-theoretic point of view— Y Okamoto Discrete Optimization 5 (1), 1-18, 2008	37*	2008
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	36	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	36	2009
The affine representation theorem for abstract convex geometries K Kashiwabara, M Nakamura, Y Okamoto Computational Geometry 30 (2), 129-144, 2005	34	2005
Submodularity of some classes of the combinatorial optimization games Y Okamoto Mathematical Methods of Operations Research 58 (1), 131-139, 2003	34	2003
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. L Barth, SI Fabrikant, SG Kobourov, A Lubiw, M Nöllenburg, Y Okamoto, ... LATIN 14, 514-525, 2014	31	2014
Submodular fractional programming for balanced clustering Y Kawahara, K Nagano, Y Okamoto Pattern Recognition Letters 32 (2), 235-243, 2011	26	2011
Exact algorithms for the max-min dispersion problem T Akagi, T Araki, T Horiyama, S Nakano, Y Okamoto, Y Otachi, T Saitoh, ... Frontiers in Algorithmics: 12th International Workshop, FAW 2018, Guangzhou …, 2018	24	2018
The geodesic diameter of polygonal domains SW Bae, M Korman, Y Okamoto Discrete & Computational Geometry 50, 306-329, 2013	23	2013
Improved bounds for wireless localization T Christ, M Hoffmann, Y Okamoto, T Uno Algorithmica 57 (3), 499-516, 2010	22	2010
How to make a picturesque maze Y Okamoto, R Uehara 21st Annual Canadian Conference on Computational Geometry, 137-140, 2009	22	2009

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

Follow

Cited by

Co-authors