Yoshio Okamoto

引用次数

	总计	2019 年至今
引用	1891	891
h 指数	22	15
i10 指数	52	25

180

135

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

开放获取的出版物数量

查看全部

26 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Takeaki UnoNational Institute of Informatics, Japan在 nii.jp 的电子邮件经过验证
Ryuhei UeharaJapan Advanced Institute of Science and Technology在 jaist.ac.jp 的电子邮件经过验证
Yusuke KOBAYASHIKyoto University在 kurims.kyoto-u.ac.jp 的电子邮件经过验证
Yota OtachiNagoya University在 nagoya-u.jp 的电子邮件经过验证
Naonori KakimuraKeio University在 math.keio.ac.jp 的电子邮件经过验证
Matias KormanSiemens EDA在 mentor.com 的电子邮件经过验证
Toshiki SaitohKyushu Institute of Technology在 ces.kyutech.ac.jp 的电子邮件经过验证
Michael HoffmannETH Zürich在 inf.ethz.ch 的电子邮件经过验证
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg在 uni-wuerzburg.de 的电子邮件经过验证
Masashi KiyomiSeikei University在 st.seikei.ac.jp 的电子邮件经过验证
Shinichi NakanoProfessor of Computer Science, Gunma University在 gunma-u.ac.jp 的电子邮件经过验证
Sang Won BaeKyonggi University在 kgu.ac.kr 的电子邮件经过验证
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU Wien在 ac.tuwien.ac.at 的电子邮件经过验证
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Kevin BuchinProfessor of Computer Science, Technical University Dortmund在 tu-dortmund.de 的电子邮件经过验证
Shuji KijimaShiga University在 biwako.shiga-u.ac.jp 的电子邮件经过验证
Chan-Su Shin (신찬수)Professor of Division of Computer Engineering, Hankuk University of Foreign Stuides在 hufs.ac.kr 的电子邮件经过验证
André van RenssenUniversity of Sydney在 sydney.edu.au 的电子邮件经过验证
Rodrigo I. SilveiraUniversitat Politècnica de Catalunya在 upc.edu 的电子邮件经过验证
Jarek ByrkaUniversity of Wroclaw在 cs.uni.wroc.pl 的电子邮件经过验证

关注

Yoshio Okamoto

University of Electro-Communications

在 uec.ac.jp 的电子邮件经过验证 - 首页

Algorithms Combinatorial Optimization Graph Algorithms Discrete and Computational Geometry Computational Geometry


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

关注

引用次数

合著作者