Yoshio Okamoto

Cited by

	All	Since 2017
Citations	1516	766
h-index	20	13
i10-index	44	23

160

120

200320042005200620072008200920102011201220132014201520162017201820192020202120224 12 28 32 21 48 44 53 54 55 77 81 99 118 113 152 134 139 158 66

Public access

View all

26 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
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
Yusuke KOBAYASHIKyoto UniversityVerified email at kurims.kyoto-u.ac.jp
Masashi KiyomiSeikei UniversityVerified email at st.seikei.ac.jp
Sang Won BaeKyonggi UniversityVerified email at kgu.ac.kr
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
Kevin BuchinProfessor of Computer Science, Technical University DortmundVerified email at tu-dortmund.de
Naonori KakimuraKeio UniversityVerified email at math.keio.ac.jp
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	202	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	80*	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	77	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	49*	2006
Drawing (complete) binary tanglegrams K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, RI Silveira, ... Algorithmica 62 (1), 309-332, 2012	48*	2012
The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto Computational Geometry 34 (3), 149-158, 2006	48	2006
Approximation and hardness for token swapping T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno arXiv preprint arXiv:1602.05150, 2016	43	2016
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	42*	2009
Core stability of minimum coloring games T Bietenhader, Y Okamoto Mathematics of Operations Research 31 (2), 418-431, 2006	37	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	36	2009
Fair cost allocations under conflicts—a game-theoretic point of view— Y Okamoto Discrete Optimization 5 (1), 1-18, 2008	35*	2008
The affine representation theorem for abstract convex geometries K Kashiwabara, M Nakamura, Y Okamoto Computational Geometry 30 (2), 129-144, 2005	35	2005
Submodularity of some classes of the combinatorial optimization games Y Okamoto Mathematical Methods of Operations Research 58 (1), 131-139, 2003	34	2003
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	32	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	31	2014
The geodesic diameter of polygonal domains SW Bae, M Korman, Y Okamoto Discrete & Computational Geometry 50 (2), 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
Submodular fractional programming for balanced clustering Y Kawahara, K Nagano, Y Okamoto Pattern Recognition Letters 32 (2), 235-243, 2011	21	2011
How to make a picturesque maze Y Okamoto, R Uehara 21st Annual Canadian Conference on Computational Geometry, 137-140, 2009	21	2009
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	20	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 this author

Cited by

Co-authors