Yoshio Okamoto

Navedeno

	Vse	Od leta 2018
Navedbe	1633	781
indeks h	21	13
indeks i10	47	22

160

120

2004200520062007200820092010201120122013201420152016201720182019202020212022202310 28 34 23 47 38 55 54 59 76 77 98 116 109 153 126 140 145 136 75

Javni dostop

Prikaži vse

24 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Takeaki UnoNational Institute of Informatics, JapanPreverjeni e-poštni naslov na nii.jp
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyPreverjeni e-poštni naslov na jaist.ac.jp
Yota OtachiNagoya UniversityPreverjeni e-poštni naslov na nagoya-u.jp
Yusuke KOBAYASHIKyoto UniversityPreverjeni e-poštni naslov na kurims.kyoto-u.ac.jp
Matias KormanSiemens EDAPreverjeni e-poštni naslov na mentor.com
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgPreverjeni e-poštni naslov na uni-wuerzburg.de
Michael HoffmannETH ZürichPreverjeni e-poštni naslov na inf.ethz.ch
Naonori KakimuraKeio UniversityPreverjeni e-poštni naslov na math.keio.ac.jp
Masashi KiyomiSeikei UniversityPreverjeni e-poštni naslov na st.seikei.ac.jp
Shinichi NakanoProfessor of Computer Science, Gunma UniversityPreverjeni e-poštni naslov na gunma-u.ac.jp
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienPreverjeni e-poštni naslov na ac.tuwien.ac.at
Sang Won BaeKyonggi UniversityPreverjeni e-poštni naslov na kgu.ac.kr
Kevin BuchinProfessor of Computer Science, Technical University DortmundPreverjeni e-poštni naslov na tu-dortmund.de
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyPreverjeni e-poštni naslov na mit.edu
Shuji KijimaShiga UniversityPreverjeni e-poštni naslov na biwako.shiga-u.ac.jp
Rodrigo I. SilveiraUniversitat Politècnica de CatalunyaPreverjeni e-poštni naslov na upc.edu
Jarek ByrkaUniversity of WroclawPreverjeni e-poštni naslov na cs.uni.wroc.pl
Maike BuchinRuhr-Universität BochumPreverjeni e-poštni naslov na rub.de
Chan-Su Shin (신찬수)Professor of Division of Computer Engineering, Hankuk University of Foreign StuidesPreverjeni e-poštni naslov na hufs.ac.kr
Koichi YamazakiTokyo Denki UniversityPreverjeni e-poštni naslov na mail.dendai.ac.jp

Spremljaj

Yoshio Okamoto

University of Electro-Communications

Preverjeni e-poštni naslov na uec.ac.jp - Domača stran

Algorithms Combinatorial Optimization Graph Algorithms Discrete and Computational Geometry Computational Geometry


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	219	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	87	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
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	54	2012
Approximation and hardness for token swapping T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno arXiv preprint arXiv:1602.05150, 2016	53	2016
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	44*	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	33	2014
Submodular fractional programming for balanced clustering Y Kawahara, K Nagano, Y Okamoto Pattern Recognition Letters 32 (2), 235-243, 2011	29	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	24	2013
How to make a picturesque maze Y Okamoto, R Uehara 21st Annual Canadian Conference on Computational Geometry, 137-140, 2009	23	2009
Improved bounds for wireless localization T Christ, M Hoffmann, Y Okamoto, T Uno Algorithmica 57 (3), 499-516, 2010	22	2010

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji