Yoshio Okamoto

Citée par

	Toutes	Depuis 2016
Citations	1361	713
indice h	19	13
indice i10	40	24

160

120

20032004200520062007200820092010201120122013201420152016201720182019202020214 13 25 31 20 48 44 55 55 59 83 81 102 127 103 150 155 144 34

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
Yota OtachiNagoya UniversityAdresse e-mail validée de nagoya-u.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
Matias KormanTufts UniversityAdresse e-mail validée de dais.is.tohoku.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
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyAdresse e-mail validée de mit.edu
Yusuke KOBAYASHIKyoto UniversityAdresse e-mail validée de kurims.kyoto-u.ac.jp
Shinichi NakanoProfessor of Computer Science, Gunma UniversityAdresse e-mail validée de cs.gunma-u.ac.jp
Kevin BuchinAssociate Professor of Computer Science, Technical University EindhovenAdresse e-mail validée de tue.nl
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
Maike BuchinRuhr-Universität BochumAdresse e-mail validée de rub.de
Naonori KakimuraKeio UniversityAdresse e-mail validée de math.keio.ac.jp
Chan-Su Shin (신찬수)Professor of Division of Computer and Electronic Systems, Hankuk University of Foreign StuidesAdresse e-mail validée de hufs.ac.kr
Koichi YamazakiGunma UniversityAdresse e-mail validée de cs.gunma-u.ac.jp
Marek CyganUniversity of WarsawAdresse e-mail validée de mimuw.edu.pl
Holger DellIT University of CopenhagenAdresse e-mail validée de itu.dk

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	175	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	73*	2008
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
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 minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto Computational Geometry 34 (3), 149-158, 2006	46	2006
Drawing (complete) binary tanglegrams K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, RI Silveira, ... Algorithmica 62 (1), 309-332, 2012	41*	2012
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	37*	2009
Approximation and hardness for token swapping T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno arXiv preprint arXiv:1602.05150, 2016	35	2016
Core stability of minimum coloring games T Bietenhader, Y Okamoto Mathematics of Operations Research 31 (2), 418-431, 2006	35	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	34	2009
Fair cost allocations under conflicts—a game-theoretic point of view— Y Okamoto Discrete Optimization 5 (1), 1-18, 2008	34*	2008
The affine representation theorem for abstract convex geometries K Kashiwabara, M Nakamura, Y Okamoto Computational Geometry 30 (2), 129-144, 2005	32	2005
Submodularity of some classes of the combinatorial optimization games Y Okamoto Mathematical Methods of Operations Research 58 (1), 131-139, 2003	31	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	28	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	25	2014
Swapping labeled tokens on graphs K Yamanaka, ED Demaine, T Ito, J Kawahara, M Kiyomi, Y Okamoto, ... International Conference on Fun with Algorithms, 364-375, 2014	24	2014
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	20	2009
The geodesic diameter of polygonal domains SW Bae, M Korman, Y Okamoto Discrete & Computational Geometry 50 (2), 306-329, 2013	19	2013
Improved bounds for wireless localization T Christ, M Hoffmann, Y Okamoto, T Uno Algorithmica 57 (3), 499-516, 2010	19	2010

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

Importer un PDF

Suivre les mises à jour de cet auteur

Citée par

Coauteurs