Yoshio Okamoto

Citée par

	Toutes	Depuis 2019
Citations	1864	864
indice h	22	14
indice i10	51	24

180

135

20042005200620072008200920102011201220132014201520162017201820192020202120222023202412 28 31 22 48 41 53 55 60 72 79 96 113 111 149 121 136 145 141 164 154

Accès public

Tout afficher

26 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

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

Suivre

Yoshio Okamoto

University of Electro-Communications

Adresse e-mail validée de uec.ac.jp - Page d'accueil

Algorithms Combinatorial Optimization Graph Algorithms Discrete and Computational Geometry Computational Geometry


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	252	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	101	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	68	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	60*	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
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
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	37	2014
The affine representation theorem for abstract convex geometries K Kashiwabara, M Nakamura, Y Okamoto Computational Geometry 30 (2), 129-144, 2005	37	2005
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
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	31	2018
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

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs