Yoshio Okamoto

Sitert av

	Alle	Siden 2020
Sitater	1932	797
h-indeks	22	14
i10-indeks	53	24

200

100

150

200420052006200720082009201020112012201320142015201620172018201920202021202220232024202513 28 31 22 49 41 54 56 62 76 79 99 109 111 150 123 136 147 140 164 181 28

Offentlig tilgang

Vis alle

26 artikler

0 artikler

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

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

Følg

Yoshio Okamoto

University of Electro-Communications

Verifisert e-postadresse på uec.ac.jp - Startside

Algorithms Combinatorial Optimization Graph Algorithms Discrete and Computational Geometry Computational Geometry


Tittel Sorter etter sitater Sorter etter år Sorter etter tittel	Sitert av Sitert av	År
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	262	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	108	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	88*	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	73	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	66	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
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	45	2014
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	43*	2009
Core stability of minimum coloring games T Bietenhader, Y Okamoto Mathematics of Operations Research 31 (2), 418-431, 2006	42	2006
Fair cost allocations under conflicts—a game-theoretic point of view— Y Okamoto Discrete Optimization 5 (1), 1-18, 2008	41*	2008
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	40	2009
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
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	33	2018
Submodularity of some classes of the combinatorial optimization games Y Okamoto Mathematical Methods of Operations Research 58 (1), 131-139, 2003	33	2003
Submodular fractional programming for balanced clustering Y Kawahara, K Nagano, Y Okamoto Pattern Recognition Letters 32 (2), 235-243, 2011	31	2011
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

Systemet kan ikke utføre handlingen. Prøv på nytt senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg

Sitert av

Medforfattere